./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 f4b24e32 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-?-f4b24e3 [2022-07-14 04:23:55,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:23:55,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:23:55,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:23:55,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:23:55,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:23:55,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:23:55,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:23:55,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:23:55,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:23:55,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:23:55,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:23:55,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:23:55,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:23:55,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:23:55,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:23:55,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:23:55,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:23:55,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:23:55,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:23:55,829 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:23:55,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:23:55,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:23:55,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:23:55,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:23:55,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:23:55,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:23:55,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:23:55,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:23:55,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:23:55,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:23:55,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:23:55,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:23:55,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:23:55,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:23:55,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:23:55,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:23:55,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:23:55,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:23:55,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:23:55,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:23:55,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:23:55,842 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:23:55,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:23:55,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:23:55,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:23:55,862 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:23:55,863 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:23:55,863 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:23:55,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:23:55,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:23:55,864 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:23:55,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:23:55,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:23:55,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:23:55,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:23:55,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:23:55,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:23:55,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:23:55,866 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:23:55,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:23:55,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:23:55,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:23:55,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:23:55,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:23:55,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:23:55,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:23:55,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:23:55,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:23:55,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:23:55,869 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:23:55,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:23:55,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:23:55,869 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-14 04:23:56,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:23:56,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:23:56,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:23:56,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:23:56,158 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:23:56,159 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-14 04:23:56,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a100a59d7/a8976b1bca8745f19572fc854e52a4b5/FLAG978629aea [2022-07-14 04:23:57,038 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:23:57,039 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-14 04:23:57,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a100a59d7/a8976b1bca8745f19572fc854e52a4b5/FLAG978629aea [2022-07-14 04:23:57,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a100a59d7/a8976b1bca8745f19572fc854e52a4b5 [2022-07-14 04:23:57,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:23:57,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:23:57,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:23:57,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:23:57,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:23:57,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:23:57" (1/1) ... [2022-07-14 04:23:57,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7c833f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:57, skipping insertion in model container [2022-07-14 04:23:57,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:23:57" (1/1) ... [2022-07-14 04:23:57,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:23:57,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:23:59,035 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-14 04:23:59,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:23:59,086 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:23:59,366 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-14 04:23:59,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:23:59,493 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:23:59,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59 WrapperNode [2022-07-14 04:23:59,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:23:59,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:23:59,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:23:59,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:23:59,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,708 INFO L137 Inliner]: procedures = 396, calls = 1846, calls flagged for inlining = 235, calls inlined = 222, statements flattened = 5742 [2022-07-14 04:23:59,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:23:59,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:23:59,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:23:59,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:23:59,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:23:59,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:23:59,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:23:59,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:23:59,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (1/1) ... [2022-07-14 04:23:59,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:23:59,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:24:00,037 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-14 04:24:00,046 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-14 04:24:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:24:00,074 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:24:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:24:00,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:24:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-14 04:24:00,074 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-14 04:24:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 04:24:00,075 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 04:24:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mii_read [2022-07-14 04:24:00,075 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mii_read [2022-07-14 04:24:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_resume [2022-07-14 04:24:00,075 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_resume [2022-07-14 04:24:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-14 04:24:00,075 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-14 04:24:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_drv_probe [2022-07-14 04:24:00,076 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_drv_probe [2022-07-14 04:24:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure no_printk [2022-07-14 04:24:00,076 INFO L138 BoogieDeclarations]: Found implementation of procedure no_printk [2022-07-14 04:24:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:24:00,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:24:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-14 04:24:00,076 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-14 04:24:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-07-14 04:24:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-07-14 04:24:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-14 04:24:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-14 04:24:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:24:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:24:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-14 04:24:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-14 04:24:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_set_multicast_list [2022-07-14 04:24:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_set_multicast_list [2022-07-14 04:24:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_set_hw_mac_address [2022-07-14 04:24:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_set_hw_mac_address [2022-07-14 04:24:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure phy_write [2022-07-14 04:24:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_write [2022-07-14 04:24:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-14 04:24:00,078 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-14 04:24:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:24:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-14 04:24:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-14 04:24:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_drv_remove [2022-07-14 04:24:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_drv_remove [2022-07-14 04:24:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_multicast_update [2022-07-14 04:24:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_multicast_update [2022-07-14 04:24:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 04:24:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 04:24:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:24:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-07-14 04:24:00,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-07-14 04:24:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-14 04:24:00,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-14 04:24:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_writefifo [2022-07-14 04:24:00,080 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_writefifo [2022-07-14 04:24:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:24:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:24:00,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:24:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_irqhandler [2022-07-14 04:24:00,081 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_irqhandler [2022-07-14 04:24:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:24:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:24:00,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:24:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_clk1__more_at_exit [2022-07-14 04:24:00,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_clk1__more_at_exit [2022-07-14 04:24:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-14 04:24:00,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-14 04:24:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_disable_resources [2022-07-14 04:24:00,082 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_disable_resources [2022-07-14 04:24:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_get_rxstatus [2022-07-14 04:24:00,082 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_get_rxstatus [2022-07-14 04:24:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_read [2022-07-14 04:24:00,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_read [2022-07-14 04:24:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_getregslen [2022-07-14 04:24:00,082 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_getregslen [2022-07-14 04:24:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:24:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:24:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-14 04:24:00,083 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-14 04:24:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:24:00,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:24:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-14 04:24:00,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-14 04:24:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:24:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:24:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:24:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-14 04:24:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-14 04:24:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:24:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:24:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mii_write [2022-07-14 04:24:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mii_write [2022-07-14 04:24:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_complete [2022-07-14 04:24:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_complete [2022-07-14 04:24:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-14 04:24:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-14 04:24:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 04:24:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 04:24:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-14 04:24:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-14 04:24:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32_rep [2022-07-14 04:24:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32_rep [2022-07-14 04:24:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-14 04:24:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-14 04:24:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource_byname [2022-07-14 04:24:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource_byname [2022-07-14 04:24:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-14 04:24:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-14 04:24:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 04:24:00,087 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 04:24:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-14 04:24:00,087 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-14 04:24:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:24:00,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:24:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-14 04:24:00,087 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-14 04:24:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-14 04:24:00,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-14 04:24:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_get_txstatus [2022-07-14 04:24:00,088 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_get_txstatus [2022-07-14 04:24:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-14 04:24:00,088 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-14 04:24:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_free [2022-07-14 04:24:00,088 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_free [2022-07-14 04:24:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:24:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:24:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:24:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:24:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_readfifo [2022-07-14 04:24:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_readfifo [2022-07-14 04:24:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_open [2022-07-14 04:24:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_open [2022-07-14 04:24:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_unregister [2022-07-14 04:24:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_unregister [2022-07-14 04:24:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_get_eeprom_len [2022-07-14 04:24:00,090 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_get_eeprom_len [2022-07-14 04:24:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_readfifo_shift [2022-07-14 04:24:00,090 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_readfifo_shift [2022-07-14 04:24:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_suspend [2022-07-14 04:24:00,090 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_suspend [2022-07-14 04:24:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_read_mac_address [2022-07-14 04:24:00,090 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_read_mac_address [2022-07-14 04:24:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_write [2022-07-14 04:24:00,090 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_write [2022-07-14 04:24:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure phy_read [2022-07-14 04:24:00,091 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_read [2022-07-14 04:24:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 04:24:00,091 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 04:24:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-14 04:24:00,091 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-14 04:24:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2022-07-14 04:24:00,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2022-07-14 04:24:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_write [2022-07-14 04:24:00,092 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_write [2022-07-14 04:24:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:24:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-14 04:24:00,092 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-14 04:24:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:24:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_reg_write [2022-07-14 04:24:00,092 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_reg_write [2022-07-14 04:24:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_nwayreset [2022-07-14 04:24:00,092 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_nwayreset [2022-07-14 04:24:00,093 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_free_resources [2022-07-14 04:24:00,093 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_free_resources [2022-07-14 04:24:00,093 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_disable_irq_chip [2022-07-14 04:24:00,093 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_disable_irq_chip [2022-07-14 04:24:00,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:24:00,093 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-14 04:24:00,093 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-14 04:24:00,093 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_eeprom_send_cmd [2022-07-14 04:24:00,093 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_eeprom_send_cmd [2022-07-14 04:24:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 04:24:00,094 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 04:24:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_phy_adjust_link [2022-07-14 04:24:00,094 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_phy_adjust_link [2022-07-14 04:24:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_reg_read [2022-07-14 04:24:00,094 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_reg_read [2022-07-14 04:24:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:24:00,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:24:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-14 04:24:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-14 04:24:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_update_txcounters [2022-07-14 04:24:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_update_txcounters [2022-07-14 04:24:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_read_shift [2022-07-14 04:24:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_read_shift [2022-07-14 04:24:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-14 04:24:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-14 04:24:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_write_shift [2022-07-14 04:24:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_write_shift [2022-07-14 04:24:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-14 04:24:00,096 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-14 04:24:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 04:24:00,096 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 04:24:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-14 04:24:00,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-14 04:24:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-14 04:24:00,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-14 04:24:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_phy_enable_external [2022-07-14 04:24:00,097 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_phy_enable_external [2022-07-14 04:24:00,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:24:00,097 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_read [2022-07-14 04:24:00,097 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_read [2022-07-14 04:24:00,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:24:00,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:24:00,097 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-14 04:24:00,097 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-14 04:24:00,097 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-14 04:24:00,098 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-14 04:24:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_soft_reset [2022-07-14 04:24:00,098 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_soft_reset [2022-07-14 04:24:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_eeprom_enable_access [2022-07-14 04:24:00,098 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_eeprom_enable_access [2022-07-14 04:24:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32_rep [2022-07-14 04:24:00,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32_rep [2022-07-14 04:24:00,098 INFO L130 BoogieDeclarations]: Found specification of procedure spin_is_locked [2022-07-14 04:24:00,098 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_is_locked [2022-07-14 04:24:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_stop [2022-07-14 04:24:00,099 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_stop [2022-07-14 04:24:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:24:00,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:24:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_writefifo_shift [2022-07-14 04:24:00,099 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_writefifo_shift [2022-07-14 04:24:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-14 04:24:00,099 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-14 04:24:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-14 04:24:00,100 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-14 04:24:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:24:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-14 04:24:00,100 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-14 04:24:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-14 04:24:00,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-14 04:24:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-14 04:24:00,100 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-14 04:24:00,755 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:24:00,757 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:24:01,012 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:24:03,487 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:24:03,506 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:24:03,507 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 04:24:03,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:24:03 BoogieIcfgContainer [2022-07-14 04:24:03,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:24:03,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:24:03,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:24:03,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:24:03,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:23:57" (1/3) ... [2022-07-14 04:24:03,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88179a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:24:03, skipping insertion in model container [2022-07-14 04:24:03,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:23:59" (2/3) ... [2022-07-14 04:24:03,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88179a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:24:03, skipping insertion in model container [2022-07-14 04:24:03,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:24:03" (3/3) ... [2022-07-14 04:24:03,519 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-14 04:24:03,529 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:24:03,529 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 04:24:03,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:24:03,621 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@e6aaae2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@977262 [2022-07-14 04:24:03,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 04:24:03,630 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-14 04:24:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 04:24:03,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:24:03,637 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-14 04:24:03,638 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-14 04:24:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:24:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1843472669, now seen corresponding path program 1 times [2022-07-14 04:24:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:24:03,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564363115] [2022-07-14 04:24:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:03,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:24:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:24:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:24:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:24:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:24:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,137 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-14 04:24:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:24:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564363115] [2022-07-14 04:24:04,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564363115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:24:04,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:24:04,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 04:24:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112438845] [2022-07-14 04:24:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:24:04,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 04:24:04,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:24:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 04:24:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 04:24:04,171 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-14 04:24:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:24:04,418 INFO L93 Difference]: Finished difference Result 4885 states and 7351 transitions. [2022-07-14 04:24:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:24:04,421 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-14 04:24:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:24:04,452 INFO L225 Difference]: With dead ends: 4885 [2022-07-14 04:24:04,453 INFO L226 Difference]: Without dead ends: 2436 [2022-07-14 04:24:04,475 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-14 04:24:04,481 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-14 04:24:04,482 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-14 04:24:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-07-14 04:24:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2022-07-14 04:24:04,682 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-14 04:24:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3409 transitions. [2022-07-14 04:24:04,699 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3409 transitions. Word has length 48 [2022-07-14 04:24:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:24:04,700 INFO L495 AbstractCegarLoop]: Abstraction has 2436 states and 3409 transitions. [2022-07-14 04:24:04,701 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-14 04:24:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3409 transitions. [2022-07-14 04:24:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 04:24:04,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:24:04,703 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-14 04:24:04,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:24:04,703 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-14 04:24:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:24:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2135049724, now seen corresponding path program 1 times [2022-07-14 04:24:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:24:04,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842715205] [2022-07-14 04:24:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:24:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:24:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:24:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:24:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:24:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:24:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:04,896 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-14 04:24:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:24:04,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842715205] [2022-07-14 04:24:04,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842715205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:24:04,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:24:04,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 04:24:04,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499076850] [2022-07-14 04:24:04,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:24:04,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 04:24:04,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:24:04,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 04:24:04,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 04:24:04,900 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-14 04:24:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:24:05,095 INFO L93 Difference]: Finished difference Result 4853 states and 6839 transitions. [2022-07-14 04:24:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:24:05,096 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-14 04:24:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:24:05,140 INFO L225 Difference]: With dead ends: 4853 [2022-07-14 04:24:05,140 INFO L226 Difference]: Without dead ends: 4754 [2022-07-14 04:24:05,147 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-14 04:24:05,151 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-14 04:24:05,151 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-14 04:24:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2022-07-14 04:24:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2022-07-14 04:24:05,327 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-14 04:24:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6700 transitions. [2022-07-14 04:24:05,358 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6700 transitions. Word has length 53 [2022-07-14 04:24:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:24:05,358 INFO L495 AbstractCegarLoop]: Abstraction has 4754 states and 6700 transitions. [2022-07-14 04:24:05,358 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-14 04:24:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6700 transitions. [2022-07-14 04:24:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-14 04:24:05,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:24:05,385 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-14 04:24:05,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:24:05,385 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-14 04:24:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:24:05,386 INFO L85 PathProgramCache]: Analyzing trace with hash 970042127, now seen corresponding path program 1 times [2022-07-14 04:24:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:24:05,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755104896] [2022-07-14 04:24:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:24:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:24:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:24:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:24:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:24:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:24:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:05,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:24:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:24:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:24:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:24:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:24:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:24:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:24:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 04:24:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:24:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:24:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:24:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:24:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 04:24:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 04:24:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:24:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-14 04:24:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:24:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-14 04:24:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-14 04:24:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:24:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:24:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-14 04:24:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:24:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:24:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-14 04:24:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-14 04:24:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-14 04:24:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-14 04:24:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-14 04:24:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-14 04:24:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-14 04:24:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-14 04:24:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-14 04:24:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-14 04:24:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:06,541 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-14 04:24:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:24:06,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755104896] [2022-07-14 04:24:06,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755104896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:24:06,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:24:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 04:24:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665954509] [2022-07-14 04:24:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:24:06,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 04:24:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:24:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 04:24:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:24:06,545 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-14 04:24:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:24:20,775 INFO L93 Difference]: Finished difference Result 12573 states and 18366 transitions. [2022-07-14 04:24:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:24:20,776 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-14 04:24:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:24:20,881 INFO L225 Difference]: With dead ends: 12573 [2022-07-14 04:24:20,881 INFO L226 Difference]: Without dead ends: 7834 [2022-07-14 04:24:20,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-14 04:24:20,918 INFO L413 NwaCegarLoop]: 3487 mSDtfsCounter, 5390 mSDsluCounter, 13266 mSDsCounter, 0 mSdLazyCounter, 12662 mSolverCounterSat, 3517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6063 SdHoareTripleChecker+Valid, 16753 SdHoareTripleChecker+Invalid, 16179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3517 IncrementalHoareTripleChecker+Valid, 12662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:24:20,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6063 Valid, 16753 Invalid, 16179 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3517 Valid, 12662 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-07-14 04:24:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2022-07-14 04:24:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 5504. [2022-07-14 04:24:21,564 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-14 04:24:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5504 states to 5504 states and 7856 transitions. [2022-07-14 04:24:21,783 INFO L78 Accepts]: Start accepts. Automaton has 5504 states and 7856 transitions. Word has length 423 [2022-07-14 04:24:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:24:21,786 INFO L495 AbstractCegarLoop]: Abstraction has 5504 states and 7856 transitions. [2022-07-14 04:24:21,786 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-14 04:24:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5504 states and 7856 transitions. [2022-07-14 04:24:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-14 04:24:21,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:24:21,811 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-14 04:24:21,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:24:21,812 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-14 04:24:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:24:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1308329677, now seen corresponding path program 1 times [2022-07-14 04:24:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:24:21,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043872344] [2022-07-14 04:24:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:24:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:24:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:24:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:24:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:24:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:24:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:24:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:24:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:24:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:24:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:24:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:24:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:24:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 04:24:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:24:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:24:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:24:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:24:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 04:24:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 04:24:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:24:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-14 04:24:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:24:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-14 04:24:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-14 04:24:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:24:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:24:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-14 04:24:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:24:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:24:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-14 04:24:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-14 04:24:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-14 04:24:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-14 04:24:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-14 04:24:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-14 04:24:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-14 04:24:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-14 04:24:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-14 04:24:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-14 04:24:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:23,235 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-14 04:24:23,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:24:23,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043872344] [2022-07-14 04:24:23,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043872344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:24:23,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388620611] [2022-07-14 04:24:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:23,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:24:23,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:24:23,275 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-14 04:24:23,324 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-14 04:24:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:24,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 3586 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 04:24:24,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:24:24,388 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-14 04:24:24,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:24:24,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388620611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:24:24,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:24:24,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-14 04:24:24,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100282252] [2022-07-14 04:24:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:24:24,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 04:24:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:24:24,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 04:24:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-14 04:24:24,393 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-14 04:24:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:24:25,025 INFO L93 Difference]: Finished difference Result 11049 states and 15862 transitions. [2022-07-14 04:24:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:24:25,025 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-14 04:24:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:24:25,096 INFO L225 Difference]: With dead ends: 11049 [2022-07-14 04:24:25,102 INFO L226 Difference]: Without dead ends: 5560 [2022-07-14 04:24:25,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-07-14 04:24:25,163 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-14 04:24:25,163 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-14 04:24:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2022-07-14 04:24:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 5541. [2022-07-14 04:24:25,763 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-14 04:24:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 7905 transitions. [2022-07-14 04:24:25,878 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 7905 transitions. Word has length 423 [2022-07-14 04:24:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:24:25,880 INFO L495 AbstractCegarLoop]: Abstraction has 5541 states and 7905 transitions. [2022-07-14 04:24:25,880 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-14 04:24:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 7905 transitions. [2022-07-14 04:24:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-14 04:24:25,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:24:25,914 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-14 04:24:25,954 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-14 04:24:26,127 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-14 04:24:26,128 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-14 04:24:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:24:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1554137551, now seen corresponding path program 1 times [2022-07-14 04:24:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:24:26,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193875089] [2022-07-14 04:24:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:24:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:24:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:24:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:24:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:24:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:24:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:24:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:24:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:24:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:24:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:24:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:24:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:24:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 04:24:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:24:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:24:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:24:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:24:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 04:24:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 04:24:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:24:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-14 04:24:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:24:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-14 04:24:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-14 04:24:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:24:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 04:24:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-14 04:24:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:24:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:24:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-14 04:24:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-14 04:24:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-14 04:24:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-14 04:24:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-14 04:24:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-14 04:24:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-14 04:24:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-14 04:24:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-14 04:24:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-14 04:24:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:26,976 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-14 04:24:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:24:26,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193875089] [2022-07-14 04:24:26,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193875089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:24:26,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365003148] [2022-07-14 04:24:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:26,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:24:26,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:24:26,978 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-14 04:24:26,979 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-14 04:24:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:27,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 3587 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 04:24:27,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:24:28,015 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-14 04:24:28,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:24:28,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365003148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:24:28,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:24:28,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-14 04:24:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049181315] [2022-07-14 04:24:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:24:28,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:24:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:24:28,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:24:28,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-07-14 04:24:28,018 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-14 04:24:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:24:30,684 INFO L93 Difference]: Finished difference Result 14010 states and 20303 transitions. [2022-07-14 04:24:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 04:24:30,685 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-14 04:24:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:24:30,781 INFO L225 Difference]: With dead ends: 14010 [2022-07-14 04:24:30,783 INFO L226 Difference]: Without dead ends: 8484 [2022-07-14 04:24:30,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-07-14 04:24:30,810 INFO L413 NwaCegarLoop]: 4110 mSDtfsCounter, 7697 mSDsluCounter, 23946 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7917 SdHoareTripleChecker+Valid, 28056 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2731 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:24:30,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7917 Valid, 28056 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2731 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 04:24:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2022-07-14 04:24:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 5558. [2022-07-14 04:24:31,377 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-14 04:24:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 7925 transitions. [2022-07-14 04:24:31,397 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 7925 transitions. Word has length 423 [2022-07-14 04:24:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:24:31,398 INFO L495 AbstractCegarLoop]: Abstraction has 5558 states and 7925 transitions. [2022-07-14 04:24:31,398 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-14 04:24:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 7925 transitions. [2022-07-14 04:24:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2022-07-14 04:24:31,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:24:31,414 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-14 04:24:31,440 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-14 04:24:31,631 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-14 04:24:31,632 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-14 04:24:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:24:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2022471282, now seen corresponding path program 1 times [2022-07-14 04:24:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:24:31,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51131157] [2022-07-14 04:24:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:24:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:24:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:24:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:24:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:24:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:24:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:24:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:24:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:24:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:24:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:24:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:24:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:24:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 04:24:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:24:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:24:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:24:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:24:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:24:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:24:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 04:24:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 04:24:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:24:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-14 04:24:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:24:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-14 04:24:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-14 04:24:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-14 04:24:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:24:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-14 04:24:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:24:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:24:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 04:24:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-14 04:24:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:24:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-14 04:24:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-07-14 04:24:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2022-07-14 04:24:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-07-14 04:24:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-07-14 04:24:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-14 04:24:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-14 04:24:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-14 04:24:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:24:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2022-07-14 04:24:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-07-14 04:24:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2022-07-14 04:24:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:32,414 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-14 04:24:32,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:24:32,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51131157] [2022-07-14 04:24:32,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51131157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:24:32,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50972757] [2022-07-14 04:24:32,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:24:32,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:24:32,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:24:32,416 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-14 04:24:32,420 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-14 04:24:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:24:33,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 3796 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 04:24:33,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:24:33,571 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-14 04:24:33,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:24:34,080 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-14 04:24:34,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50972757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:24:34,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:24:34,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 29 [2022-07-14 04:24:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913335613] [2022-07-14 04:24:34,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:24:34,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 04:24:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:24:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 04:24:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-07-14 04:24:34,083 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-14 04:25:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:25:02,050 INFO L93 Difference]: Finished difference Result 11957 states and 17458 transitions. [2022-07-14 04:25:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 04:25:02,051 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-14 04:25:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:25:02,092 INFO L225 Difference]: With dead ends: 11957 [2022-07-14 04:25:02,092 INFO L226 Difference]: Without dead ends: 6413 [2022-07-14 04:25:02,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=338, Invalid=2314, Unknown=0, NotChecked=0, Total=2652 [2022-07-14 04:25:02,178 INFO L413 NwaCegarLoop]: 3763 mSDtfsCounter, 6378 mSDsluCounter, 44073 mSDsCounter, 0 mSdLazyCounter, 48238 mSolverCounterSat, 5682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6945 SdHoareTripleChecker+Valid, 47836 SdHoareTripleChecker+Invalid, 53920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 5682 IncrementalHoareTripleChecker+Valid, 48238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:25:02,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6945 Valid, 47836 Invalid, 53920 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [5682 Valid, 48238 Invalid, 0 Unknown, 0 Unchecked, 25.4s Time] [2022-07-14 04:25:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2022-07-14 04:25:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 5563. [2022-07-14 04:25:02,503 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-14 04:25:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5563 states to 5563 states and 7945 transitions. [2022-07-14 04:25:02,524 INFO L78 Accepts]: Start accepts. Automaton has 5563 states and 7945 transitions. Word has length 465 [2022-07-14 04:25:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:25:02,525 INFO L495 AbstractCegarLoop]: Abstraction has 5563 states and 7945 transitions. [2022-07-14 04:25:02,525 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-14 04:25:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5563 states and 7945 transitions. [2022-07-14 04:25:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-14 04:25:02,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:25:02,539 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-14 04:25:02,563 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-14 04:25:02,755 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-14 04:25:02,755 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-14 04:25:02,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:25:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash -107417767, now seen corresponding path program 1 times [2022-07-14 04:25:02,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:25:02,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395869159] [2022-07-14 04:25:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:25:02,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:25:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:25:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:25:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:25:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:25:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:25:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:25:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:25:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:25:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:25:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:25:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:25:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:25:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:25:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:25:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:25:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:25:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:25:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:25:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 04:25:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:25:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 04:25:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:25:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:25:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:25:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:25:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:25:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:25:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 04:25:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-14 04:25:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 04:25:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:25:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-14 04:25:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:25:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-14 04:25:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-14 04:25:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:25:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:25:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-14 04:25:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:25:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:25:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-14 04:25:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-14 04:25:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-14 04:25:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-14 04:25:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-14 04:25:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-07-14 04:25:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2022-07-14 04:25:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-07-14 04:25:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-14 04:25:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2022-07-14 04:25:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-07-14 04:25:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-14 04:25:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2022-07-14 04:25:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2022-07-14 04:25:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2022-07-14 04:25:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:03,637 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-14 04:25:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:25:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395869159] [2022-07-14 04:25:03,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395869159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:25:03,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:25:03,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 04:25:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450207164] [2022-07-14 04:25:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:25:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 04:25:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:25:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 04:25:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:25:03,639 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-14 04:25:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:25:15,114 INFO L93 Difference]: Finished difference Result 11954 states and 17458 transitions. [2022-07-14 04:25:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 04:25:15,115 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-14 04:25:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:25:15,290 INFO L225 Difference]: With dead ends: 11954 [2022-07-14 04:25:15,290 INFO L226 Difference]: Without dead ends: 6406 [2022-07-14 04:25:15,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-07-14 04:25:15,440 INFO L413 NwaCegarLoop]: 3783 mSDtfsCounter, 3633 mSDsluCounter, 12029 mSDsCounter, 0 mSdLazyCounter, 12289 mSolverCounterSat, 2466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4104 SdHoareTripleChecker+Valid, 15812 SdHoareTripleChecker+Invalid, 14755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2466 IncrementalHoareTripleChecker+Valid, 12289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:25:15,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4104 Valid, 15812 Invalid, 14755 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2466 Valid, 12289 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-07-14 04:25:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2022-07-14 04:25:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5569. [2022-07-14 04:25:15,868 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-14 04:25:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 7951 transitions. [2022-07-14 04:25:15,892 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 7951 transitions. Word has length 494 [2022-07-14 04:25:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:25:15,892 INFO L495 AbstractCegarLoop]: Abstraction has 5569 states and 7951 transitions. [2022-07-14 04:25:15,892 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-14 04:25:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 7951 transitions. [2022-07-14 04:25:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2022-07-14 04:25:15,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:25:15,905 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-14 04:25:15,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:25:15,906 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-14 04:25:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:25:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash -519392329, now seen corresponding path program 1 times [2022-07-14 04:25:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:25:15,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812095113] [2022-07-14 04:25:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:25:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:25:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:25:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:25:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:25:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:25:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:25:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 04:25:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:25:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:25:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:25:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:25:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:25:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:25:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 04:25:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:25:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:25:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:25:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:25:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:25:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 04:25:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 04:25:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:25:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:25:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:25:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:25:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 04:25:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:25:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:25:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:25:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-14 04:25:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 04:25:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 04:25:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 04:25:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-14 04:25:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-14 04:25:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-14 04:25:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-14 04:25:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-14 04:25:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-14 04:25:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:25:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:25:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-14 04:25:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:25:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:25:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-07-14 04:25:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-14 04:25:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-07-14 04:25:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-14 04:25:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-14 04:25:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2022-07-14 04:25:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2022-07-14 04:25:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-07-14 04:25:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-07-14 04:25:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-14 04:25:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2022-07-14 04:25:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:25:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2022-07-14 04:25:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-14 04:25:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2022-07-14 04:25:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2022-07-14 04:25:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:16,971 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-14 04:25:16,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:25:16,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812095113] [2022-07-14 04:25:16,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812095113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:25:16,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509286404] [2022-07-14 04:25:16,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:25:16,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:25:16,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:25:16,988 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-14 04:25:16,989 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-14 04:25:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:25:18,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 4001 conjuncts, 514 conjunts are in the unsatisfiable core [2022-07-14 04:25:18,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:25:18,343 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-14 04:25:18,803 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-14 04:25:18,811 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-14 04:25:18,829 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-14 04:25:18,929 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-14 04:25:18,972 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-14 04:25:19,037 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-14 04:25:19,095 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-14 04:25:19,520 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 04:25:19,520 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-14 04:25:19,880 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-14 04:25:19,880 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-14 04:25:19,884 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-14 04:25:19,908 INFO L356 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-07-14 04:25:19,908 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-14 04:25:19,931 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-14 04:25:19,931 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-14 04:25:19,953 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-07-14 04:25:19,953 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-14 04:25:19,962 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-14 04:25:19,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-14 04:25:19,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-14 04:25:20,046 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-14 04:25:20,064 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-14 04:25:20,080 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-14 04:25:20,094 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-14 04:25:20,095 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-14 04:25:20,154 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-14 04:25:20,177 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-14 04:25:20,180 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-14 04:25:20,211 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-14 04:25:21,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:25:21,089 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 278 treesize of output 398 [2022-07-14 04:25:39,099 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int) (|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (.cse1 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (and (or (= v_arrayElimCell_26 v_arrayElimCell_23) (not (= .cse0 .cse1))) (let ((.cse7 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse29 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse29))) (let ((.cse28 (= v_arrayElimCell_26 0)) (.cse27 (select (select |c_#memory_$Pointer$.base| .cse30) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (or (not (= .cse27 v_prenex_1)) .cse28) (or (not (= .cse27 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse28) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse29)) (= .cse30 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse30 .cse27)))))))) (.cse8 (not (= v_prenex_1 .cse1))) (.cse9 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse25 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse25))) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| .cse26) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (not (= .cse24 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse25)) (= .cse26 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse26 .cse24)))))))) (.cse10 (not (= .cse0 v_prenex_1))) (.cse12 (= v_arrayElimCell_26 0)) (.cse11 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse22 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse22))) (let ((.cse21 (select (select |c_#memory_$Pointer$.base| .cse23) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (or (not (= .cse21 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (= v_arrayElimCell_26 0)) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse22)) (= .cse23 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse23 .cse21)))))))) (.cse2 (= v_arrayElimCell_23 0))) (or (and .cse2 (or (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse5 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (let ((.cse4 (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse5)) (= .cse6 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)))) (or (and (not (= .cse3 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse4) (and .cse4 (= v_arrayElimCell_26 0)))) (not (= .cse6 .cse3))))))) (and (or .cse7 (and .cse8 .cse9)) .cse10) .cse11)) (and .cse8 .cse2 .cse12) (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse16 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse16))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| .cse17) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (let ((.cse14 (= v_arrayElimCell_23 0)) (.cse15 (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse16)) (= .cse17 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)))) (or (and (not (= .cse13 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse14 .cse15) (and .cse14 .cse15 (= v_arrayElimCell_26 0)))) (not (= .cse17 .cse13))))))) (and (or (and .cse7 .cse2) (and .cse8 (or (and .cse2 .cse9) .cse12))) .cse10) (and (let ((.cse18 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse19 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse19))) (and (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse19)) (= .cse20 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse20 (select (select |c_#memory_$Pointer$.base| .cse20) |ldv_dev_set_drvdata_~tmp~122#1.offset|))))))))) (or (and .cse18 .cse2 .cse10) (and .cse18 .cse2) (and (or .cse18 (and .cse18 .cse10)) .cse2))) .cse12) (and .cse11 .cse2)))))) is different from true [2022-07-14 04:27:35,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 04:27:35,880 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 216 treesize of output 346 [2022-07-14 04:27:45,837 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int) (|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (.cse1 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (and (or (= v_arrayElimCell_26 v_arrayElimCell_23) (not (= .cse0 .cse1))) (let ((.cse7 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse29 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse29))) (let ((.cse28 (= v_arrayElimCell_26 0)) (.cse27 (select (select |c_#memory_$Pointer$.base| .cse30) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (or (not (= .cse27 v_prenex_1)) .cse28) (or (not (= .cse27 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse28) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse29)) (= .cse30 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse30 .cse27)))))))) (.cse8 (not (= v_prenex_1 .cse1))) (.cse9 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse25 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse25))) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| .cse26) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (not (= .cse24 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse25)) (= .cse26 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse26 .cse24)))))))) (.cse10 (not (= .cse0 v_prenex_1))) (.cse12 (= v_arrayElimCell_26 0)) (.cse11 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse22 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse22))) (let ((.cse21 (select (select |c_#memory_$Pointer$.base| .cse23) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (or (not (= .cse21 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (= v_arrayElimCell_26 0)) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse22)) (= .cse23 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse23 .cse21)))))))) (.cse2 (= v_arrayElimCell_23 0))) (or (and .cse2 (or (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse5 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (let ((.cse4 (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse5)) (= .cse6 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)))) (or (and (not (= .cse3 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse4) (and .cse4 (= v_arrayElimCell_26 0)))) (not (= .cse6 .cse3))))))) (and (or .cse7 (and .cse8 .cse9)) .cse10) .cse11)) (and .cse8 .cse2 .cse12) (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse16 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse16))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| .cse17) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (let ((.cse14 (= v_arrayElimCell_23 0)) (.cse15 (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse16)) (= .cse17 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)))) (or (and (not (= .cse13 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse14 .cse15) (and .cse14 .cse15 (= v_arrayElimCell_26 0)))) (not (= .cse17 .cse13))))))) (and (or (and .cse7 .cse2) (and .cse8 (or (and .cse2 .cse9) .cse12))) .cse10) (and (let ((.cse18 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse19 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse19))) (and (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse19)) (= .cse20 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse20 (select (select |c_#memory_$Pointer$.base| .cse20) |ldv_dev_set_drvdata_~tmp~122#1.offset|))))))))) (or (and .cse18 .cse2 .cse10) (and .cse18 .cse2) (and (or .cse18 (and .cse18 .cse10)) .cse2))) .cse12) (and .cse11 .cse2)))))) (or (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_5) v_prenex_6) v_prenex_5))) (exists ((|v_smsc911x_drv_probe_~pdev#1.offset_BEFORE_CALL_3| Int) (|v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12| Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse32 (+ 21 |v_smsc911x_drv_probe_~pdev#1.offset_BEFORE_CALL_3|))) (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|) .cse32))) (and (or (= |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12| .cse31) (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|) .cse32))) (not (= .cse31 (select (select |c_#memory_$Pointer$.base| .cse31) |ldv_dev_set_drvdata_~tmp~122#1.offset|))))))))) is different from true [2022-07-14 04:28:25,502 INFO L356 Elim1Store]: treesize reduction 50, result has 71.6 percent of original size [2022-07-14 04:28:25,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1002 treesize of output 844 [2022-07-14 04:28:25,570 INFO L356 Elim1Store]: treesize reduction 38, result has 64.2 percent of original size [2022-07-14 04:28:25,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 850 treesize of output 876 [2022-07-14 04:28:25,629 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 04:28:25,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 04:28:25,875 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-14 04:28:25,876 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:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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-14 04:28:25,880 INFO L158 Benchmark]: Toolchain (without parser) took 268688.52ms. Allocated memory was 86.0MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 49.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-14 04:28:25,880 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 54.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 04:28:25,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2300.41ms. Allocated memory was 86.0MB in the beginning and 201.3MB in the end (delta: 115.3MB). Free memory was 49.7MB in the beginning and 124.9MB in the end (delta: -75.3MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2022-07-14 04:28:25,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 214.49ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 91.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-14 04:28:25,881 INFO L158 Benchmark]: Boogie Preprocessor took 272.34ms. Allocated memory is still 201.3MB. Free memory was 91.4MB in the beginning and 96.5MB in the end (delta: -5.1MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-07-14 04:28:25,881 INFO L158 Benchmark]: RCFGBuilder took 3527.15ms. Allocated memory was 201.3MB in the beginning and 402.7MB in the end (delta: 201.3MB). Free memory was 96.5MB in the beginning and 280.9MB in the end (delta: -184.4MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. [2022-07-14 04:28:25,881 INFO L158 Benchmark]: TraceAbstraction took 262367.02ms. Allocated memory was 402.7MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 279.8MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-07-14 04:28:25,882 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.15ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 54.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2300.41ms. Allocated memory was 86.0MB in the beginning and 201.3MB in the end (delta: 115.3MB). Free memory was 49.7MB in the beginning and 124.9MB in the end (delta: -75.3MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 214.49ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 91.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 272.34ms. Allocated memory is still 201.3MB. Free memory was 91.4MB in the beginning and 96.5MB in the end (delta: -5.1MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3527.15ms. Allocated memory was 201.3MB in the beginning and 402.7MB in the end (delta: 201.3MB). Free memory was 96.5MB in the beginning and 280.9MB in the end (delta: -184.4MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. * TraceAbstraction took 262367.02ms. Allocated memory was 402.7MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 279.8MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. 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-14 04:28:26,095 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-14 04:28:26,112 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...