./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 eb692b52 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-?-eb692b5 [2022-07-20 03:44:18,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 03:44:18,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 03:44:18,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 03:44:18,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 03:44:18,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 03:44:18,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 03:44:18,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 03:44:18,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 03:44:18,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 03:44:18,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 03:44:18,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 03:44:18,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 03:44:18,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 03:44:18,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 03:44:18,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 03:44:18,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 03:44:18,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 03:44:18,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 03:44:18,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 03:44:18,253 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 03:44:18,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 03:44:18,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 03:44:18,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 03:44:18,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 03:44:18,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 03:44:18,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 03:44:18,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 03:44:18,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 03:44:18,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 03:44:18,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 03:44:18,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 03:44:18,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 03:44:18,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 03:44:18,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 03:44:18,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 03:44:18,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 03:44:18,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 03:44:18,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 03:44:18,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 03:44:18,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 03:44:18,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 03:44:18,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 03:44:18,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 03:44:18,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 03:44:18,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 03:44:18,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 03:44:18,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 03:44:18,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 03:44:18,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 03:44:18,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 03:44:18,312 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 03:44:18,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 03:44:18,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 03:44:18,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 03:44:18,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 03:44:18,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 03:44:18,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 03:44:18,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 03:44:18,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 03:44:18,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 03:44:18,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 03:44:18,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 03:44:18,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 03:44:18,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:44:18,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 03:44:18,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 03:44:18,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 03:44:18,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 03:44:18,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 03:44:18,317 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 03:44:18,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 03:44:18,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 03:44:18,318 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-20 03:44:18,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 03:44:18,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 03:44:18,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 03:44:18,599 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 03:44:18,600 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 03:44:18,601 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-20 03:44:18,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9463ef6/d7f50d576d734cce8e60c2bef1d28dce/FLAG29ad8e107 [2022-07-20 03:44:19,486 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 03:44:19,487 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-20 03:44:19,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9463ef6/d7f50d576d734cce8e60c2bef1d28dce/FLAG29ad8e107 [2022-07-20 03:44:19,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9463ef6/d7f50d576d734cce8e60c2bef1d28dce [2022-07-20 03:44:19,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 03:44:19,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 03:44:19,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 03:44:19,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 03:44:19,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 03:44:19,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:44:19" (1/1) ... [2022-07-20 03:44:19,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f0f19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:19, skipping insertion in model container [2022-07-20 03:44:19,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:44:19" (1/1) ... [2022-07-20 03:44:20,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 03:44:20,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 03:44:22,568 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-20 03:44:22,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:44:22,645 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 03:44:23,020 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-20 03:44:23,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:44:23,222 INFO L208 MainTranslator]: Completed translation [2022-07-20 03:44:23,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23 WrapperNode [2022-07-20 03:44:23,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 03:44:23,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 03:44:23,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 03:44:23,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 03:44:23,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,510 INFO L137 Inliner]: procedures = 396, calls = 1846, calls flagged for inlining = 235, calls inlined = 222, statements flattened = 5742 [2022-07-20 03:44:23,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 03:44:23,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 03:44:23,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 03:44:23,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 03:44:23,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 03:44:23,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 03:44:23,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 03:44:23,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 03:44:23,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (1/1) ... [2022-07-20 03:44:23,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:44:23,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:44:23,864 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-20 03:44:23,889 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-20 03:44:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 03:44:23,912 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 03:44:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 03:44:23,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 03:44:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-20 03:44:23,913 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-20 03:44:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 03:44:23,913 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 03:44:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mii_read [2022-07-20 03:44:23,914 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mii_read [2022-07-20 03:44:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_resume [2022-07-20 03:44:23,914 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_resume [2022-07-20 03:44:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-20 03:44:23,914 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-20 03:44:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_drv_probe [2022-07-20 03:44:23,914 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_drv_probe [2022-07-20 03:44:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure no_printk [2022-07-20 03:44:23,915 INFO L138 BoogieDeclarations]: Found implementation of procedure no_printk [2022-07-20 03:44:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 03:44:23,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 03:44:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-20 03:44:23,915 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-20 03:44:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-07-20 03:44:23,915 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-07-20 03:44:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-20 03:44:23,916 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-20 03:44:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 03:44:23,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 03:44:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-20 03:44:23,916 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-20 03:44:23,916 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_set_multicast_list [2022-07-20 03:44:23,917 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_set_multicast_list [2022-07-20 03:44:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_set_hw_mac_address [2022-07-20 03:44:23,917 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_set_hw_mac_address [2022-07-20 03:44:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure phy_write [2022-07-20 03:44:23,917 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_write [2022-07-20 03:44:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-20 03:44:23,918 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-20 03:44:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 03:44:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-20 03:44:23,918 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-20 03:44:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_drv_remove [2022-07-20 03:44:23,919 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_drv_remove [2022-07-20 03:44:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_multicast_update [2022-07-20 03:44:23,919 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_multicast_update [2022-07-20 03:44:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 03:44:23,919 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 03:44:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 03:44:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-07-20 03:44:23,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-07-20 03:44:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-20 03:44:23,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-20 03:44:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_writefifo [2022-07-20 03:44:23,920 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_writefifo [2022-07-20 03:44:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 03:44:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 03:44:23,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 03:44:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_irqhandler [2022-07-20 03:44:23,922 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_irqhandler [2022-07-20 03:44:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 03:44:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 03:44:23,923 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 03:44:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_clk1__more_at_exit [2022-07-20 03:44:23,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_clk1__more_at_exit [2022-07-20 03:44:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-20 03:44:23,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-20 03:44:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_disable_resources [2022-07-20 03:44:23,924 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_disable_resources [2022-07-20 03:44:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_get_rxstatus [2022-07-20 03:44:23,924 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_get_rxstatus [2022-07-20 03:44:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_read [2022-07-20 03:44:23,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_read [2022-07-20 03:44:23,925 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_getregslen [2022-07-20 03:44:23,925 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_getregslen [2022-07-20 03:44:23,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 03:44:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 03:44:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-20 03:44:23,926 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-20 03:44:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 03:44:23,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 03:44:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-20 03:44:23,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-20 03:44:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 03:44:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 03:44:23,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 03:44:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-20 03:44:23,927 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-20 03:44:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 03:44:23,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 03:44:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mii_write [2022-07-20 03:44:23,928 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mii_write [2022-07-20 03:44:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_complete [2022-07-20 03:44:23,928 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_complete [2022-07-20 03:44:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-20 03:44:23,929 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-20 03:44:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 03:44:23,929 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 03:44:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-20 03:44:23,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-20 03:44:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32_rep [2022-07-20 03:44:23,930 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32_rep [2022-07-20 03:44:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-20 03:44:23,930 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-20 03:44:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource_byname [2022-07-20 03:44:23,930 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource_byname [2022-07-20 03:44:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-20 03:44:23,931 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-20 03:44:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-20 03:44:23,931 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-20 03:44:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-20 03:44:23,931 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-20 03:44:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 03:44:23,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 03:44:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-20 03:44:23,932 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-20 03:44:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-20 03:44:23,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-20 03:44:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_get_txstatus [2022-07-20 03:44:23,934 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_get_txstatus [2022-07-20 03:44:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-20 03:44:23,936 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-20 03:44:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_free [2022-07-20 03:44:23,936 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_free [2022-07-20 03:44:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 03:44:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 03:44:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 03:44:23,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 03:44:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_readfifo [2022-07-20 03:44:23,943 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_readfifo [2022-07-20 03:44:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_open [2022-07-20 03:44:23,944 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_open [2022-07-20 03:44:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_unregister [2022-07-20 03:44:23,944 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_unregister [2022-07-20 03:44:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_get_eeprom_len [2022-07-20 03:44:23,944 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_get_eeprom_len [2022-07-20 03:44:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_readfifo_shift [2022-07-20 03:44:23,944 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_readfifo_shift [2022-07-20 03:44:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_suspend [2022-07-20 03:44:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_suspend [2022-07-20 03:44:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_read_mac_address [2022-07-20 03:44:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_read_mac_address [2022-07-20 03:44:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_write [2022-07-20 03:44:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_write [2022-07-20 03:44:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure phy_read [2022-07-20 03:44:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_read [2022-07-20 03:44:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 03:44:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 03:44:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-20 03:44:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-20 03:44:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2022-07-20 03:44:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2022-07-20 03:44:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_write [2022-07-20 03:44:23,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_write [2022-07-20 03:44:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 03:44:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-20 03:44:23,947 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-20 03:44:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 03:44:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_reg_write [2022-07-20 03:44:23,947 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_reg_write [2022-07-20 03:44:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_nwayreset [2022-07-20 03:44:23,947 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_nwayreset [2022-07-20 03:44:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_free_resources [2022-07-20 03:44:23,947 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_free_resources [2022-07-20 03:44:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_disable_irq_chip [2022-07-20 03:44:23,948 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_disable_irq_chip [2022-07-20 03:44:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 03:44:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-20 03:44:23,948 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-20 03:44:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_eeprom_send_cmd [2022-07-20 03:44:23,948 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_eeprom_send_cmd [2022-07-20 03:44:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-20 03:44:23,949 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-20 03:44:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_phy_adjust_link [2022-07-20 03:44:23,949 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_phy_adjust_link [2022-07-20 03:44:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_reg_read [2022-07-20 03:44:23,949 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_reg_read [2022-07-20 03:44:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 03:44:23,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 03:44:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-20 03:44:23,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-20 03:44:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_update_txcounters [2022-07-20 03:44:23,950 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_update_txcounters [2022-07-20 03:44:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_read_shift [2022-07-20 03:44:23,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_read_shift [2022-07-20 03:44:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-20 03:44:23,950 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-20 03:44:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_write_shift [2022-07-20 03:44:23,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_write_shift [2022-07-20 03:44:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-20 03:44:23,951 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-20 03:44:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-20 03:44:23,951 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-20 03:44:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-20 03:44:23,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-20 03:44:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-20 03:44:23,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-20 03:44:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_phy_enable_external [2022-07-20 03:44:23,953 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_phy_enable_external [2022-07-20 03:44:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 03:44:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_read [2022-07-20 03:44:23,953 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_read [2022-07-20 03:44:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 03:44:23,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 03:44:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-20 03:44:23,954 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-20 03:44:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-20 03:44:23,954 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-20 03:44:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_soft_reset [2022-07-20 03:44:23,954 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_soft_reset [2022-07-20 03:44:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_eeprom_enable_access [2022-07-20 03:44:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_eeprom_enable_access [2022-07-20 03:44:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32_rep [2022-07-20 03:44:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32_rep [2022-07-20 03:44:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure spin_is_locked [2022-07-20 03:44:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_is_locked [2022-07-20 03:44:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_stop [2022-07-20 03:44:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_stop [2022-07-20 03:44:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 03:44:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 03:44:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_writefifo_shift [2022-07-20 03:44:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_writefifo_shift [2022-07-20 03:44:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-20 03:44:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-20 03:44:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-20 03:44:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-20 03:44:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 03:44:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-20 03:44:23,957 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-20 03:44:23,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-20 03:44:23,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-20 03:44:23,957 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-20 03:44:23,957 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-20 03:44:24,838 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 03:44:24,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 03:44:25,179 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 03:44:27,829 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 03:44:27,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 03:44:27,848 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 03:44:27,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:44:27 BoogieIcfgContainer [2022-07-20 03:44:27,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 03:44:27,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 03:44:27,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 03:44:27,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 03:44:27,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:44:19" (1/3) ... [2022-07-20 03:44:27,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49419950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:44:27, skipping insertion in model container [2022-07-20 03:44:27,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:44:23" (2/3) ... [2022-07-20 03:44:27,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49419950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:44:27, skipping insertion in model container [2022-07-20 03:44:27,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:44:27" (3/3) ... [2022-07-20 03:44:27,859 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-20 03:44:27,871 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 03:44:27,872 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 03:44:27,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 03:44:27,964 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@46f289e4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1eb3e069 [2022-07-20 03:44:27,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 03:44:27,975 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-20 03:44:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 03:44:27,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:44:27,984 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-20 03:44:27,985 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-20 03:44:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:44:27,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1843472669, now seen corresponding path program 1 times [2022-07-20 03:44:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:44:27,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14288591] [2022-07-20 03:44:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:27,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:44:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:44:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:28,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:44:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:28,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:28,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 03:44:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 03:44:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:28,643 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-20 03:44:28,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:44:28,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14288591] [2022-07-20 03:44:28,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14288591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:44:28,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:44:28,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 03:44:28,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884569303] [2022-07-20 03:44:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:44:28,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 03:44:28,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:44:28,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 03:44:28,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 03:44:28,688 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-20 03:44:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:44:29,015 INFO L93 Difference]: Finished difference Result 4885 states and 7351 transitions. [2022-07-20 03:44:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 03:44:29,022 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-20 03:44:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:44:29,110 INFO L225 Difference]: With dead ends: 4885 [2022-07-20 03:44:29,114 INFO L226 Difference]: Without dead ends: 2436 [2022-07-20 03:44:29,137 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-20 03:44:29,143 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-20 03:44:29,144 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-20 03:44:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-07-20 03:44:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2022-07-20 03:44:29,332 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-20 03:44:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3409 transitions. [2022-07-20 03:44:29,357 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3409 transitions. Word has length 48 [2022-07-20 03:44:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:44:29,358 INFO L495 AbstractCegarLoop]: Abstraction has 2436 states and 3409 transitions. [2022-07-20 03:44:29,359 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-20 03:44:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3409 transitions. [2022-07-20 03:44:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 03:44:29,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:44:29,361 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-20 03:44:29,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 03:44:29,362 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-20 03:44:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:44:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2135049724, now seen corresponding path program 1 times [2022-07-20 03:44:29,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:44:29,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145786559] [2022-07-20 03:44:29,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:44:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:44:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:29,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:44:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 03:44:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 03:44:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:44:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:29,627 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-20 03:44:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:44:29,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145786559] [2022-07-20 03:44:29,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145786559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:44:29,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:44:29,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 03:44:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183009731] [2022-07-20 03:44:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:44:29,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 03:44:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:44:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 03:44:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 03:44:29,630 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-20 03:44:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:44:29,914 INFO L93 Difference]: Finished difference Result 4853 states and 6839 transitions. [2022-07-20 03:44:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:44:29,915 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-20 03:44:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:44:29,969 INFO L225 Difference]: With dead ends: 4853 [2022-07-20 03:44:29,970 INFO L226 Difference]: Without dead ends: 4754 [2022-07-20 03:44:29,976 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-20 03:44:29,981 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-20 03:44:29,981 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-20 03:44:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2022-07-20 03:44:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2022-07-20 03:44:30,254 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-20 03:44:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6700 transitions. [2022-07-20 03:44:30,300 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6700 transitions. Word has length 53 [2022-07-20 03:44:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:44:30,301 INFO L495 AbstractCegarLoop]: Abstraction has 4754 states and 6700 transitions. [2022-07-20 03:44:30,301 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-20 03:44:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6700 transitions. [2022-07-20 03:44:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-20 03:44:30,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:44:30,337 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-20 03:44:30,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 03:44:30,337 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-20 03:44:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:44:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash 970042127, now seen corresponding path program 1 times [2022-07-20 03:44:30,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:44:30,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446873580] [2022-07-20 03:44:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:44:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:44:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:44:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:44:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 03:44:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:30,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:44:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:44:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:44:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 03:44:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 03:44:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 03:44:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:44:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 03:44:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 03:44:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 03:44:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:44:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 03:44:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 03:44:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 03:44:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 03:44:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 03:44:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-20 03:44:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 03:44:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-20 03:44:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-20 03:44:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:44:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-20 03:44:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-20 03:44:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-20 03:44:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-20 03:44:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-20 03:44:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-20 03:44:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-20 03:44:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-20 03:44:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-20 03:44:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-20 03:44:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-20 03:44:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-20 03:44:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-20 03:44:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-20 03:44:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:31,902 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-20 03:44:31,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:44:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446873580] [2022-07-20 03:44:31,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446873580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:44:31,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:44:31,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 03:44:31,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279686043] [2022-07-20 03:44:31,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:44:31,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 03:44:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:44:31,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 03:44:31,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-20 03:44:31,908 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-20 03:44:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:44:47,904 INFO L93 Difference]: Finished difference Result 12573 states and 18366 transitions. [2022-07-20 03:44:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 03:44:47,905 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-20 03:44:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:44:47,985 INFO L225 Difference]: With dead ends: 12573 [2022-07-20 03:44:47,985 INFO L226 Difference]: Without dead ends: 7834 [2022-07-20 03:44:48,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-20 03:44:48,022 INFO L413 NwaCegarLoop]: 3487 mSDtfsCounter, 5390 mSDsluCounter, 13277 mSDsCounter, 0 mSdLazyCounter, 12646 mSolverCounterSat, 3508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6064 SdHoareTripleChecker+Valid, 16764 SdHoareTripleChecker+Invalid, 16154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3508 IncrementalHoareTripleChecker+Valid, 12646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-07-20 03:44:48,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6064 Valid, 16764 Invalid, 16154 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3508 Valid, 12646 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2022-07-20 03:44:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2022-07-20 03:44:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 5504. [2022-07-20 03:44:48,561 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-20 03:44:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5504 states to 5504 states and 7856 transitions. [2022-07-20 03:44:48,607 INFO L78 Accepts]: Start accepts. Automaton has 5504 states and 7856 transitions. Word has length 423 [2022-07-20 03:44:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:44:48,611 INFO L495 AbstractCegarLoop]: Abstraction has 5504 states and 7856 transitions. [2022-07-20 03:44:48,612 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-20 03:44:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 5504 states and 7856 transitions. [2022-07-20 03:44:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-20 03:44:48,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:44:48,632 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-20 03:44:48,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 03:44:48,634 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-20 03:44:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:44:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1308329677, now seen corresponding path program 1 times [2022-07-20 03:44:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:44:48,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661642340] [2022-07-20 03:44:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:48,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:44:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:44:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:44:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:44:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 03:44:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:44:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:44:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:44:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 03:44:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 03:44:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 03:44:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:44:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 03:44:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 03:44:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 03:44:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:44:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 03:44:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 03:44:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 03:44:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 03:44:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 03:44:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-20 03:44:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 03:44:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-20 03:44:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-20 03:44:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:44:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-20 03:44:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-20 03:44:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-20 03:44:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-20 03:44:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-20 03:44:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-20 03:44:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-20 03:44:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-20 03:44:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-20 03:44:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-20 03:44:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-20 03:44:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-20 03:44:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-20 03:44:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-20 03:44:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:49,846 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-20 03:44:49,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:44:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661642340] [2022-07-20 03:44:49,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661642340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:44:49,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347642069] [2022-07-20 03:44:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:49,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:44:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:44:49,852 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-20 03:44:49,856 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-20 03:44:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:50,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 3586 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 03:44:50,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:44:51,039 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-20 03:44:51,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 03:44:51,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347642069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:44:51,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 03:44:51,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-20 03:44:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400282307] [2022-07-20 03:44:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:44:51,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 03:44:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:44:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 03:44:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-20 03:44:51,042 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-20 03:44:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:44:51,712 INFO L93 Difference]: Finished difference Result 11049 states and 15862 transitions. [2022-07-20 03:44:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 03:44:51,713 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-20 03:44:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:44:51,764 INFO L225 Difference]: With dead ends: 11049 [2022-07-20 03:44:51,765 INFO L226 Difference]: Without dead ends: 5560 [2022-07-20 03:44:51,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-07-20 03:44:51,808 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-20 03:44:51,809 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-20 03:44:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2022-07-20 03:44:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 5541. [2022-07-20 03:44:52,247 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-20 03:44:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 7905 transitions. [2022-07-20 03:44:52,281 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 7905 transitions. Word has length 423 [2022-07-20 03:44:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:44:52,283 INFO L495 AbstractCegarLoop]: Abstraction has 5541 states and 7905 transitions. [2022-07-20 03:44:52,283 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-20 03:44:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 7905 transitions. [2022-07-20 03:44:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-20 03:44:52,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:44:52,308 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-20 03:44:52,345 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-20 03:44:52,523 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-20 03:44:52,524 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-20 03:44:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:44:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1554137551, now seen corresponding path program 1 times [2022-07-20 03:44:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:44:52,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456799347] [2022-07-20 03:44:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:44:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:44:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:44:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:44:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 03:44:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:52,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:44:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:44:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:44:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 03:44:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 03:44:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 03:44:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:44:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 03:44:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 03:44:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 03:44:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:44:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 03:44:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 03:44:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 03:44:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 03:44:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 03:44:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-20 03:44:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 03:44:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-20 03:44:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-20 03:44:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:44:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-20 03:44:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-20 03:44:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-20 03:44:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-20 03:44:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-20 03:44:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-20 03:44:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-20 03:44:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-20 03:44:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-20 03:44:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-20 03:44:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-20 03:44:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-20 03:44:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-20 03:44:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-20 03:44:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:53,682 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-20 03:44:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:44:53,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456799347] [2022-07-20 03:44:53,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456799347] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:44:53,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011675638] [2022-07-20 03:44:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:53,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:44:53,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:44:53,685 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-20 03:44:53,687 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-20 03:44:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:54,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 3587 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 03:44:54,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:44:54,976 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-20 03:44:54,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 03:44:54,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011675638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:44:54,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 03:44:54,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-20 03:44:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538390112] [2022-07-20 03:44:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:44:54,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 03:44:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:44:54,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 03:44:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-07-20 03:44:54,979 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-20 03:44:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:44:57,542 INFO L93 Difference]: Finished difference Result 14010 states and 20303 transitions. [2022-07-20 03:44:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 03:44:57,543 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-20 03:44:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:44:57,614 INFO L225 Difference]: With dead ends: 14010 [2022-07-20 03:44:57,615 INFO L226 Difference]: Without dead ends: 8484 [2022-07-20 03:44:57,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-07-20 03:44:57,648 INFO L413 NwaCegarLoop]: 4110 mSDtfsCounter, 7697 mSDsluCounter, 23946 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 03:44:57,648 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.7s Time] [2022-07-20 03:44:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2022-07-20 03:44:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 5558. [2022-07-20 03:44:58,228 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-20 03:44:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 7925 transitions. [2022-07-20 03:44:58,264 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 7925 transitions. Word has length 423 [2022-07-20 03:44:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:44:58,265 INFO L495 AbstractCegarLoop]: Abstraction has 5558 states and 7925 transitions. [2022-07-20 03:44:58,265 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-20 03:44:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 7925 transitions. [2022-07-20 03:44:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2022-07-20 03:44:58,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:44:58,288 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-20 03:44:58,322 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-20 03:44:58,503 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-20 03:44:58,504 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-20 03:44:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:44:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2022471282, now seen corresponding path program 1 times [2022-07-20 03:44:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:44:58,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503215183] [2022-07-20 03:44:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:58,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:44:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:44:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:44:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:44:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 03:44:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:58,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:44:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:44:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:44:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 03:44:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 03:44:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 03:44:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 03:44:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 03:44:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 03:44:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 03:44:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:44:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:44:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:44:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 03:44:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 03:44:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 03:44:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 03:44:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 03:44:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-20 03:44:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 03:44:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-20 03:44:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-20 03:44:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 03:44:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:44:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-20 03:44:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:44:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:44:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-20 03:44:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-20 03:44:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-20 03:44:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-20 03:44:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-07-20 03:44:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2022-07-20 03:44:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-07-20 03:44:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-07-20 03:44:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-20 03:44:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-20 03:44:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-20 03:44:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:44:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2022-07-20 03:44:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-07-20 03:44:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2022-07-20 03:44:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:44:59,655 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-20 03:44:59,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:44:59,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503215183] [2022-07-20 03:44:59,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503215183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:44:59,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222063281] [2022-07-20 03:44:59,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:44:59,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:44:59,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:44:59,658 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-20 03:44:59,688 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-20 03:45:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:00,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 3796 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 03:45:00,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:45:01,011 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-20 03:45:01,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 03:45:01,650 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-20 03:45:01,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222063281] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 03:45:01,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 03:45:01,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 29 [2022-07-20 03:45:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432788236] [2022-07-20 03:45:01,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 03:45:01,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 03:45:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:45:01,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 03:45:01,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-07-20 03:45:01,656 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-20 03:45:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:45:31,362 INFO L93 Difference]: Finished difference Result 11957 states and 17458 transitions. [2022-07-20 03:45:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 03:45:31,362 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-20 03:45:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:45:31,412 INFO L225 Difference]: With dead ends: 11957 [2022-07-20 03:45:31,412 INFO L226 Difference]: Without dead ends: 6413 [2022-07-20 03:45:31,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=338, Invalid=2314, Unknown=0, NotChecked=0, Total=2652 [2022-07-20 03:45:31,444 INFO L413 NwaCegarLoop]: 3767 mSDtfsCounter, 6377 mSDsluCounter, 44131 mSDsCounter, 0 mSdLazyCounter, 48323 mSolverCounterSat, 5666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6942 SdHoareTripleChecker+Valid, 47898 SdHoareTripleChecker+Invalid, 53989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 5666 IncrementalHoareTripleChecker+Valid, 48323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2022-07-20 03:45:31,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6942 Valid, 47898 Invalid, 53989 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [5666 Valid, 48323 Invalid, 0 Unknown, 0 Unchecked, 26.8s Time] [2022-07-20 03:45:31,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2022-07-20 03:45:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 5563. [2022-07-20 03:45:32,031 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-20 03:45:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5563 states to 5563 states and 7945 transitions. [2022-07-20 03:45:32,073 INFO L78 Accepts]: Start accepts. Automaton has 5563 states and 7945 transitions. Word has length 465 [2022-07-20 03:45:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:45:32,073 INFO L495 AbstractCegarLoop]: Abstraction has 5563 states and 7945 transitions. [2022-07-20 03:45:32,074 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-20 03:45:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5563 states and 7945 transitions. [2022-07-20 03:45:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-20 03:45:32,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:45:32,095 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-20 03:45:32,134 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-20 03:45:32,307 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-20 03:45:32,308 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-20 03:45:32,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:45:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash -107417767, now seen corresponding path program 1 times [2022-07-20 03:45:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:45:32,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054178098] [2022-07-20 03:45:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:45:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:45:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:45:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:45:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:45:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:45:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:45:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 03:45:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:45:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:45:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:45:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:32,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:45:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:45:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:45:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 03:45:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 03:45:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 03:45:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:45:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 03:45:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 03:45:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 03:45:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:45:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 03:45:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 03:45:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:45:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:45:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:45:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 03:45:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 03:45:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 03:45:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-20 03:45:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 03:45:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 03:45:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-20 03:45:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 03:45:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 03:45:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-20 03:45:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:45:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:45:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-20 03:45:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:45:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:45:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-20 03:45:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-20 03:45:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-20 03:45:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-20 03:45:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-20 03:45:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-07-20 03:45:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2022-07-20 03:45:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-07-20 03:45:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-20 03:45:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2022-07-20 03:45:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-07-20 03:45:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-20 03:45:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2022-07-20 03:45:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2022-07-20 03:45:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2022-07-20 03:45:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:33,503 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-20 03:45:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:45:33,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054178098] [2022-07-20 03:45:33,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054178098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:45:33,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:45:33,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 03:45:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018025519] [2022-07-20 03:45:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:45:33,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 03:45:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:45:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 03:45:33,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-20 03:45:33,507 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-20 03:45:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:45:47,342 INFO L93 Difference]: Finished difference Result 11954 states and 17458 transitions. [2022-07-20 03:45:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 03:45:47,342 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-20 03:45:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:45:47,395 INFO L225 Difference]: With dead ends: 11954 [2022-07-20 03:45:47,395 INFO L226 Difference]: Without dead ends: 6406 [2022-07-20 03:45:47,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-07-20 03:45:47,428 INFO L413 NwaCegarLoop]: 3786 mSDtfsCounter, 3633 mSDsluCounter, 12046 mSDsCounter, 0 mSdLazyCounter, 12300 mSolverCounterSat, 2466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4103 SdHoareTripleChecker+Valid, 15832 SdHoareTripleChecker+Invalid, 14766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2466 IncrementalHoareTripleChecker+Valid, 12300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:45:47,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4103 Valid, 15832 Invalid, 14766 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2466 Valid, 12300 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-07-20 03:45:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2022-07-20 03:45:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5569. [2022-07-20 03:45:47,955 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-20 03:45:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 7951 transitions. [2022-07-20 03:45:47,990 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 7951 transitions. Word has length 494 [2022-07-20 03:45:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:45:47,991 INFO L495 AbstractCegarLoop]: Abstraction has 5569 states and 7951 transitions. [2022-07-20 03:45:47,991 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-20 03:45:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 7951 transitions. [2022-07-20 03:45:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2022-07-20 03:45:48,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:45:48,012 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-20 03:45:48,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 03:45:48,012 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-20 03:45:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:45:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash -519392329, now seen corresponding path program 1 times [2022-07-20 03:45:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:45:48,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114948658] [2022-07-20 03:45:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:45:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:45:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 03:45:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:45:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:45:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:45:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:45:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 03:45:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:45:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:45:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:45:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:45:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:45:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:45:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 03:45:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 03:45:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 03:45:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 03:45:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 03:45:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-20 03:45:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 03:45:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 03:45:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:45:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:45:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 03:45:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 03:45:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 03:45:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:45:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:45:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:45:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 03:45:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 03:45:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 03:45:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 03:45:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-20 03:45:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-20 03:45:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-20 03:45:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-20 03:45:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-20 03:45:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-20 03:45:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:45:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:45:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-20 03:45:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 03:45:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 03:45:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-07-20 03:45:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-20 03:45:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-07-20 03:45:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-20 03:45:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-20 03:45:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2022-07-20 03:45:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2022-07-20 03:45:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-07-20 03:45:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-07-20 03:45:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-20 03:45:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2022-07-20 03:45:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:45:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2022-07-20 03:45:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-20 03:45:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2022-07-20 03:45:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2022-07-20 03:45:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:49,466 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-20 03:45:49,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:45:49,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114948658] [2022-07-20 03:45:49,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114948658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:45:49,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566535790] [2022-07-20 03:45:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:45:49,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:45:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:45:49,468 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-20 03:45:49,501 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-20 03:45:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:45:50,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 4001 conjuncts, 514 conjunts are in the unsatisfiable core [2022-07-20 03:45:50,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:45:50,679 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-20 03:45:51,071 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-20 03:45:51,080 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-20 03:45:51,096 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-20 03:45:51,211 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-20 03:45:51,266 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-20 03:45:51,322 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-20 03:45:51,378 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-20 03:45:51,684 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 03:45:51,684 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-20 03:45:52,184 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-20 03:45:52,185 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-20 03:45:52,192 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-20 03:45:52,220 INFO L356 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-07-20 03:45:52,221 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-20 03:45:52,252 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-20 03:45:52,253 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-20 03:45:52,282 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-07-20 03:45:52,283 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-20 03:45:52,293 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-20 03:45:52,336 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-20 03:45:52,356 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-20 03:45:52,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-20 03:45:52,376 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-20 03:45:52,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-20 03:45:52,403 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-20 03:45:52,426 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-20 03:45:52,465 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-07-20 03:45:52,466 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-20 03:45:52,508 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-20 03:45:52,524 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 03:45:52,525 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-20 03:45:52,595 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-20 03:45:52,622 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-20 03:45:53,107 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 03:45:53,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 246 treesize of output 392 [2022-07-20 03:45:55,532 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int) (|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| Int)) (let ((.cse2 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse2)))) (and (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_1) |ldv_dev_set_drvdata_~tmp~122#1.offset|) .cse0)) (not (= .cse1 .cse0))))))) (exists ((v_prenex_1 Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_1) |ldv_dev_set_drvdata_~tmp~122#1.offset|) v_prenex_1))) (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 ((.cse4 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse4))) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse4)))))))) is different from true [2022-07-20 03:46:05,658 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 36 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 03:46:07,670 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_1) |ldv_dev_set_drvdata_~tmp~122#1.offset|) v_prenex_1))) is different from true [2022-07-20 03:46:18,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 03:46:18,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 267 treesize of output 415 [2022-07-20 03:46:21,210 WARN L855 $PredicateComparison]: unable to prove that (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)) (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))))) (exists ((v_prenex_4 Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (not (= v_prenex_4 (select (select |c_#memory_$Pointer$.base| v_prenex_4) |ldv_dev_set_drvdata_~tmp~122#1.offset|))))) is different from true [2022-07-20 03:46:29,303 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 32 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 03:46:29,517 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-20 03:46:29,518 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 3 case distinctions, treesize of input 134 treesize of output 134 [2022-07-20 03:46:29,553 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-07-20 03:46:29,554 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 163 [2022-07-20 03:46:29,557 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 03:46:29,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 03:46:29,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:46:29,759 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 03:46:29,763 INFO L158 Benchmark]: Toolchain (without parser) took 129771.63ms. Allocated memory was 109.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 70.9MB in the beginning and 443.0MB in the end (delta: -372.1MB). Peak memory consumption was 913.9MB. Max. memory is 16.1GB. [2022-07-20 03:46:29,763 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 03:46:29,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3229.96ms. Allocated memory was 109.1MB in the beginning and 243.3MB in the end (delta: 134.2MB). Free memory was 70.6MB in the beginning and 143.4MB in the end (delta: -72.7MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. [2022-07-20 03:46:29,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 287.01ms. Allocated memory is still 243.3MB. Free memory was 143.4MB in the beginning and 109.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-20 03:46:29,764 INFO L158 Benchmark]: Boogie Preprocessor took 319.26ms. Allocated memory is still 243.3MB. Free memory was 109.8MB in the beginning and 136.9MB in the end (delta: -27.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-07-20 03:46:29,764 INFO L158 Benchmark]: RCFGBuilder took 4020.50ms. Allocated memory was 243.3MB in the beginning and 390.1MB in the end (delta: 146.8MB). Free memory was 136.9MB in the beginning and 259.7MB in the end (delta: -122.8MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. [2022-07-20 03:46:29,764 INFO L158 Benchmark]: TraceAbstraction took 121908.93ms. Allocated memory was 390.1MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 259.7MB in the beginning and 443.0MB in the end (delta: -183.3MB). Peak memory consumption was 821.3MB. Max. memory is 16.1GB. [2022-07-20 03:46:29,765 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3229.96ms. Allocated memory was 109.1MB in the beginning and 243.3MB in the end (delta: 134.2MB). Free memory was 70.6MB in the beginning and 143.4MB in the end (delta: -72.7MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 287.01ms. Allocated memory is still 243.3MB. Free memory was 143.4MB in the beginning and 109.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 319.26ms. Allocated memory is still 243.3MB. Free memory was 109.8MB in the beginning and 136.9MB in the end (delta: -27.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4020.50ms. Allocated memory was 243.3MB in the beginning and 390.1MB in the end (delta: 146.8MB). Free memory was 136.9MB in the beginning and 259.7MB in the end (delta: -122.8MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. * TraceAbstraction took 121908.93ms. Allocated memory was 390.1MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 259.7MB in the beginning and 443.0MB in the end (delta: -183.3MB). Peak memory consumption was 821.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 03:46:29,979 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-20 03:46:29,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-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_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a085124b4007f801fe01aa89940f8a8fd2be0f47b82fa59b5624e0bb2a9cdb0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 03:46:31,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 03:46:31,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 03:46:31,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 03:46:31,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 03:46:31,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 03:46:31,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 03:46:31,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 03:46:31,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 03:46:31,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 03:46:31,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 03:46:31,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 03:46:31,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 03:46:31,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 03:46:31,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 03:46:31,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 03:46:31,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 03:46:31,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 03:46:31,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 03:46:31,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 03:46:31,708 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 03:46:31,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 03:46:31,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 03:46:31,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 03:46:31,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 03:46:31,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 03:46:31,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 03:46:31,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 03:46:31,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 03:46:31,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 03:46:31,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 03:46:31,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 03:46:31,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 03:46:31,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 03:46:31,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 03:46:31,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 03:46:31,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 03:46:31,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 03:46:31,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 03:46:31,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 03:46:31,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 03:46:31,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 03:46:31,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-20 03:46:31,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 03:46:31,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 03:46:31,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 03:46:31,775 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 03:46:31,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 03:46:31,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 03:46:31,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 03:46:31,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 03:46:31,777 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 03:46:31,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 03:46:31,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 03:46:31,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 03:46:31,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 03:46:31,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 03:46:31,779 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 03:46:31,779 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 03:46:31,779 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 03:46:31,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 03:46:31,780 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 03:46:31,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 03:46:31,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 03:46:31,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 03:46:31,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 03:46:31,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:46:31,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 03:46:31,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 03:46:31,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 03:46:31,782 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 03:46:31,782 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 03:46:31,782 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 03:46:31,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 03:46:31,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 03:46:31,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 03:46:31,784 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a085124b4007f801fe01aa89940f8a8fd2be0f47b82fa59b5624e0bb2a9cdb0a [2022-07-20 03:46:32,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 03:46:32,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 03:46:32,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 03:46:32,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 03:46:32,111 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 03:46:32,112 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-20 03:46:32,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a552f44/c3c94040b9db4c7fbddc743c7bd5652e/FLAG4059cd4c2 [2022-07-20 03:46:32,932 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 03:46:32,933 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-20 03:46:32,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a552f44/c3c94040b9db4c7fbddc743c7bd5652e/FLAG4059cd4c2 [2022-07-20 03:46:33,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a552f44/c3c94040b9db4c7fbddc743c7bd5652e [2022-07-20 03:46:33,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 03:46:33,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 03:46:33,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 03:46:33,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 03:46:33,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 03:46:33,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:46:33" (1/1) ... [2022-07-20 03:46:33,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e02374d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:46:33, skipping insertion in model container [2022-07-20 03:46:33,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:46:33" (1/1) ... [2022-07-20 03:46:33,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 03:46:33,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 03:46:34,495 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.IllegalArgumentException: cannot determine size of incomplete type at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructSizeTValueAndOffsets_StructAndUnion(TypeSizeAndOffsetComputer.java:256) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:203) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1000) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:729) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 03:46:34,501 INFO L158 Benchmark]: Toolchain (without parser) took 1473.24ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 27.5MB in the beginning and 44.9MB in the end (delta: -17.4MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-07-20 03:46:34,502 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 60.8MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 03:46:34,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1470.25ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 27.3MB in the beginning and 44.9MB in the end (delta: -17.6MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-07-20 03:46:34,507 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 60.8MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1470.25ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 27.3MB in the beginning and 44.9MB in the end (delta: -17.6MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: IllegalArgumentException: cannot determine size of incomplete type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: IllegalArgumentException: cannot determine size of incomplete type: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructSizeTValueAndOffsets_StructAndUnion(TypeSizeAndOffsetComputer.java:256) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: cannot determine size of incomplete type