./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:37:36,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:37:36,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:37:36,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:37:36,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:37:36,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:37:36,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:37:36,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:37:36,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:37:36,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:37:36,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:37:36,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:37:36,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:37:36,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:37:36,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:37:36,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:37:36,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:37:36,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:37:36,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:37:36,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:37:36,699 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:37:36,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:37:36,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:37:36,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:37:36,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:37:36,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:37:36,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:37:36,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:37:36,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:37:36,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:37:36,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:37:36,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:37:36,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:37:36,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:37:36,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:37:36,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:37:36,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:37:36,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:37:36,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:37:36,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:37:36,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:37:36,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:37:36,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:37:36,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:37:36,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:37:36,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:37:36,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:37:36,737 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:37:36,738 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:37:36,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:37:36,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:37:36,739 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:37:36,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:37:36,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:37:36,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:37:36,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:37:36,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:37:36,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:37:36,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:37:36,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:37:36,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:37:36,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:37:36,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:37:36,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:37:36,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:37:36,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:37:36,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:37:36,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:37:36,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:37:36,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:37:36,745 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:37:36,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:37:36,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:37:36,746 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 -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2022-07-22 22:37:36,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:37:36,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:37:36,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:37:36,992 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:37:36,992 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:37:36,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-07-22 22:37:37,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d061ee21/a5a184259b7b4db282a8265e5d451697/FLAGefc1788e6 [2022-07-22 22:37:37,643 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:37:37,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-07-22 22:37:37,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d061ee21/a5a184259b7b4db282a8265e5d451697/FLAGefc1788e6 [2022-07-22 22:37:38,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d061ee21/a5a184259b7b4db282a8265e5d451697 [2022-07-22 22:37:38,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:37:38,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:37:38,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:37:38,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:37:38,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:37:38,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:38,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5275ea1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38, skipping insertion in model container [2022-07-22 22:37:38,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:38,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:37:38,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:37:38,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-07-22 22:37:38,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:37:38,750 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:37:38,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-07-22 22:37:38,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:37:38,919 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:37:38,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38 WrapperNode [2022-07-22 22:37:38,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:37:38,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:37:38,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:37:38,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:37:38,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:38,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,014 INFO L137 Inliner]: procedures = 77, calls = 256, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 728 [2022-07-22 22:37:39,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:37:39,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:37:39,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:37:39,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:37:39,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:37:39,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:37:39,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:37:39,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:37:39,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (1/1) ... [2022-07-22 22:37:39,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:37:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:39,173 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-22 22:37:39,182 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-22 22:37:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2022-07-22 22:37:39,208 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2022-07-22 22:37:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:37:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-22 22:37:39,208 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-22 22:37:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:37:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-22 22:37:39,209 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-22 22:37:39,209 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2022-07-22 22:37:39,209 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2022-07-22 22:37:39,209 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-22 22:37:39,209 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-22 22:37:39,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:37:39,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:37:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-22 22:37:39,210 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-22 22:37:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 22:37:39,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 22:37:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-22 22:37:39,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-22 22:37:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:37:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-22 22:37:39,211 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-22 22:37:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:37:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 22:37:39,211 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 22:37:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:37:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-22 22:37:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-22 22:37:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-22 22:37:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-22 22:37:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-22 22:37:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-22 22:37:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-22 22:37:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-22 22:37:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:37:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:37:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:37:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:37:39,494 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:37:39,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:37:39,589 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-22 22:37:39,602 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 22:37:40,330 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-22 22:37:40,330 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-22 22:37:40,342 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:37:40,357 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:37:40,357 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 22:37:40,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:37:40 BoogieIcfgContainer [2022-07-22 22:37:40,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:37:40,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:37:40,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:37:40,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:37:40,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:37:38" (1/3) ... [2022-07-22 22:37:40,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb9bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:37:40, skipping insertion in model container [2022-07-22 22:37:40,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:37:38" (2/3) ... [2022-07-22 22:37:40,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb9bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:37:40, skipping insertion in model container [2022-07-22 22:37:40,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:37:40" (3/3) ... [2022-07-22 22:37:40,369 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-07-22 22:37:40,381 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:37:40,382 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:37:40,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:37:40,447 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@6daaa959, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59ed2ebd [2022-07-22 22:37:40,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:37:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 127 states have internal predecessors, (158), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-22 22:37:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 22:37:40,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:40,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:37:40,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash 567277314, now seen corresponding path program 1 times [2022-07-22 22:37:40,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:40,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518977913] [2022-07-22 22:37:40,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:40,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:37:40,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:40,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518977913] [2022-07-22 22:37:40,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518977913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:40,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:37:40,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:37:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595370940] [2022-07-22 22:37:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:40,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:37:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:37:40,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:37:40,957 INFO L87 Difference]: Start difference. First operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 127 states have internal predecessors, (158), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 22:37:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:41,062 INFO L93 Difference]: Finished difference Result 447 states and 604 transitions. [2022-07-22 22:37:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:37:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-22 22:37:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:41,074 INFO L225 Difference]: With dead ends: 447 [2022-07-22 22:37:41,074 INFO L226 Difference]: Without dead ends: 287 [2022-07-22 22:37:41,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:37:41,080 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 184 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:41,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 408 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:37:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-22 22:37:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2022-07-22 22:37:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 210 states have (on average 1.2190476190476192) internal successors, (256), 214 states have internal predecessors, (256), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-07-22 22:37:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 350 transitions. [2022-07-22 22:37:41,142 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 350 transitions. Word has length 17 [2022-07-22 22:37:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:41,142 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 350 transitions. [2022-07-22 22:37:41,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 22:37:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 350 transitions. [2022-07-22 22:37:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 22:37:41,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:41,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:37:41,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:37:41,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:41,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:41,145 INFO L85 PathProgramCache]: Analyzing trace with hash 405605840, now seen corresponding path program 1 times [2022-07-22 22:37:41,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:41,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877259173] [2022-07-22 22:37:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:37:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:41,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877259173] [2022-07-22 22:37:41,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877259173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:41,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:37:41,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:37:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733968183] [2022-07-22 22:37:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:41,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:37:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:37:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:37:41,273 INFO L87 Difference]: Start difference. First operand 283 states and 350 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 22:37:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:41,308 INFO L93 Difference]: Finished difference Result 820 states and 1021 transitions. [2022-07-22 22:37:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:37:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-22 22:37:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:41,312 INFO L225 Difference]: With dead ends: 820 [2022-07-22 22:37:41,312 INFO L226 Difference]: Without dead ends: 542 [2022-07-22 22:37:41,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:37:41,315 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 174 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:41,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 417 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:37:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-22 22:37:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 535. [2022-07-22 22:37:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 398 states have (on average 1.2110552763819096) internal successors, (482), 401 states have internal predecessors, (482), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-22 22:37:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 662 transitions. [2022-07-22 22:37:41,379 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 662 transitions. Word has length 18 [2022-07-22 22:37:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:41,380 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 662 transitions. [2022-07-22 22:37:41,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 22:37:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 662 transitions. [2022-07-22 22:37:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 22:37:41,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:41,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:37:41,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:37:41,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:41,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1497198459, now seen corresponding path program 1 times [2022-07-22 22:37:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940443660] [2022-07-22 22:37:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:41,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:37:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:37:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:41,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940443660] [2022-07-22 22:37:41,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940443660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:41,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:37:41,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:37:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11094910] [2022-07-22 22:37:41,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:41,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:37:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:37:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:37:41,586 INFO L87 Difference]: Start difference. First operand 535 states and 662 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 22:37:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:41,877 INFO L93 Difference]: Finished difference Result 1114 states and 1383 transitions. [2022-07-22 22:37:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:37:41,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-22 22:37:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:41,883 INFO L225 Difference]: With dead ends: 1114 [2022-07-22 22:37:41,883 INFO L226 Difference]: Without dead ends: 587 [2022-07-22 22:37:41,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:37:41,885 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 53 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:41,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 786 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:37:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-07-22 22:37:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 535. [2022-07-22 22:37:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 398 states have (on average 1.2085427135678393) internal successors, (481), 401 states have internal predecessors, (481), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-22 22:37:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 661 transitions. [2022-07-22 22:37:41,912 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 661 transitions. Word has length 51 [2022-07-22 22:37:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:41,912 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 661 transitions. [2022-07-22 22:37:41,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 22:37:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 661 transitions. [2022-07-22 22:37:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 22:37:41,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:41,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:37:41,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:37:41,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash 748380995, now seen corresponding path program 1 times [2022-07-22 22:37:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:41,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882627434] [2022-07-22 22:37:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 22:37:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:37:42,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:42,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882627434] [2022-07-22 22:37:42,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882627434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:42,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:37:42,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:37:42,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900396650] [2022-07-22 22:37:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:42,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:37:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:37:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:37:42,106 INFO L87 Difference]: Start difference. First operand 535 states and 661 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 22:37:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:42,386 INFO L93 Difference]: Finished difference Result 1233 states and 1565 transitions. [2022-07-22 22:37:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:37:42,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-22 22:37:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:42,394 INFO L225 Difference]: With dead ends: 1233 [2022-07-22 22:37:42,394 INFO L226 Difference]: Without dead ends: 709 [2022-07-22 22:37:42,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:37:42,404 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 206 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:42,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 472 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:37:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2022-07-22 22:37:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 606. [2022-07-22 22:37:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 469 states have (on average 1.2409381663113006) internal successors, (582), 472 states have internal predecessors, (582), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-22 22:37:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 762 transitions. [2022-07-22 22:37:42,437 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 762 transitions. Word has length 51 [2022-07-22 22:37:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:42,438 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 762 transitions. [2022-07-22 22:37:42,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-22 22:37:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2022-07-22 22:37:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 22:37:42,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:42,440 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-22 22:37:42,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:37:42,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash -38243739, now seen corresponding path program 1 times [2022-07-22 22:37:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:42,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021551231] [2022-07-22 22:37:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:37:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:42,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021551231] [2022-07-22 22:37:42,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021551231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:42,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985818938] [2022-07-22 22:37:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:42,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:42,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:42,755 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-22 22:37:42,784 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-22 22:37:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:37:43,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:37:43,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:43,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985818938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:43,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:43,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-22 22:37:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622374848] [2022-07-22 22:37:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:43,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:37:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:37:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:43,211 INFO L87 Difference]: Start difference. First operand 606 states and 762 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 22:37:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:43,270 INFO L93 Difference]: Finished difference Result 1189 states and 1524 transitions. [2022-07-22 22:37:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:37:43,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-07-22 22:37:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:43,274 INFO L225 Difference]: With dead ends: 1189 [2022-07-22 22:37:43,274 INFO L226 Difference]: Without dead ends: 596 [2022-07-22 22:37:43,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:37:43,276 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 41 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:43,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 677 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:37:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-22 22:37:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2022-07-22 22:37:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 334 states have internal predecessors, (408), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-07-22 22:37:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2022-07-22 22:37:43,309 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2022-07-22 22:37:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:43,310 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2022-07-22 22:37:43,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 22:37:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2022-07-22 22:37:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-22 22:37:43,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:43,315 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-22 22:37:43,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 22:37:43,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:43,521 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539649, now seen corresponding path program 1 times [2022-07-22 22:37:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427025140] [2022-07-22 22:37:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:37:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 22:37:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 22:37:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427025140] [2022-07-22 22:37:43,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427025140] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:43,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131768835] [2022-07-22 22:37:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:43,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:43,836 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-22 22:37:43,837 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-22 22:37:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 22:37:44,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 22:37:44,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:44,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131768835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:44,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:44,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-22 22:37:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702556373] [2022-07-22 22:37:44,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:44,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:37:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:44,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:37:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:37:44,308 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 22:37:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:44,458 INFO L93 Difference]: Finished difference Result 906 states and 1163 transitions. [2022-07-22 22:37:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:37:44,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-07-22 22:37:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:44,462 INFO L225 Difference]: With dead ends: 906 [2022-07-22 22:37:44,462 INFO L226 Difference]: Without dead ends: 596 [2022-07-22 22:37:44,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:37:44,464 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 185 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:44,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1771 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:37:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-22 22:37:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2022-07-22 22:37:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 334 states have internal predecessors, (406), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-07-22 22:37:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2022-07-22 22:37:44,493 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 83 [2022-07-22 22:37:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:44,495 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2022-07-22 22:37:44,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 22:37:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2022-07-22 22:37:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 22:37:44,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:44,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-22 22:37:44,519 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-22 22:37:44,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-22 22:37:44,712 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:44,712 INFO L85 PathProgramCache]: Analyzing trace with hash 23795875, now seen corresponding path program 1 times [2022-07-22 22:37:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:44,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036011859] [2022-07-22 22:37:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:44,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:37:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036011859] [2022-07-22 22:37:44,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036011859] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673890300] [2022-07-22 22:37:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:44,966 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-22 22:37:44,995 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-22 22:37:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:45,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 22:37:45,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:37:45,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:45,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673890300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:45,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:45,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-07-22 22:37:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139746436] [2022-07-22 22:37:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:45,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:37:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:45,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:37:45,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:45,479 INFO L87 Difference]: Start difference. First operand 426 states and 526 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 22:37:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:45,609 INFO L93 Difference]: Finished difference Result 661 states and 817 transitions. [2022-07-22 22:37:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:37:45,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-07-22 22:37:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:45,614 INFO L225 Difference]: With dead ends: 661 [2022-07-22 22:37:45,614 INFO L226 Difference]: Without dead ends: 658 [2022-07-22 22:37:45,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:45,616 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 284 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:45,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 375 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:37:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-07-22 22:37:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 636. [2022-07-22 22:37:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 497 states have (on average 1.2374245472837022) internal successors, (615), 498 states have internal predecessors, (615), 88 states have call successors, (88), 51 states have call predecessors, (88), 50 states have return successors, (88), 86 states have call predecessors, (88), 84 states have call successors, (88) [2022-07-22 22:37:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 791 transitions. [2022-07-22 22:37:45,654 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 791 transitions. Word has length 86 [2022-07-22 22:37:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:45,655 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 791 transitions. [2022-07-22 22:37:45,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 22:37:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2022-07-22 22:37:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-22 22:37:45,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:45,660 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-22 22:37:45,691 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-22 22:37:45,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:45,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:45,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:45,892 INFO L85 PathProgramCache]: Analyzing trace with hash -170270410, now seen corresponding path program 1 times [2022-07-22 22:37:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:45,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909283348] [2022-07-22 22:37:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:37:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:37:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:37:46,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:46,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909283348] [2022-07-22 22:37:46,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909283348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:46,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:37:46,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:37:46,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654713685] [2022-07-22 22:37:46,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:46,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:37:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:46,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:37:46,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:37:46,089 INFO L87 Difference]: Start difference. First operand 636 states and 791 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 22:37:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:46,353 INFO L93 Difference]: Finished difference Result 1320 states and 1645 transitions. [2022-07-22 22:37:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:37:46,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2022-07-22 22:37:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:46,357 INFO L225 Difference]: With dead ends: 1320 [2022-07-22 22:37:46,357 INFO L226 Difference]: Without dead ends: 685 [2022-07-22 22:37:46,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:37:46,359 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 163 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:46,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 608 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:37:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-07-22 22:37:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 596. [2022-07-22 22:37:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 465 states have (on average 1.2236559139784946) internal successors, (569), 466 states have internal predecessors, (569), 86 states have call successors, (86), 45 states have call predecessors, (86), 44 states have return successors, (88), 84 states have call predecessors, (88), 82 states have call successors, (88) [2022-07-22 22:37:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2022-07-22 22:37:46,393 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 96 [2022-07-22 22:37:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:46,393 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2022-07-22 22:37:46,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 22:37:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2022-07-22 22:37:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-22 22:37:46,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:46,395 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-22 22:37:46,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:37:46,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 320363955, now seen corresponding path program 1 times [2022-07-22 22:37:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:46,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309526007] [2022-07-22 22:37:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:37:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:37:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:37:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:37:46,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:46,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309526007] [2022-07-22 22:37:46,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309526007] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:46,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396809173] [2022-07-22 22:37:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:46,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:46,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:46,648 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-22 22:37:46,649 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-22 22:37:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:47,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 22:37:47,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:47,567 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-07-22 22:37:47,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:47,688 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 31 treesize of output 30 [2022-07-22 22:37:47,697 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-22 22:37:47,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-22 22:37:47,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-22 22:37:47,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-22 22:37:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:37:47,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:47,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396809173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:47,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:47,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-07-22 22:37:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189754590] [2022-07-22 22:37:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:37:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:37:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=241, Unknown=1, NotChecked=30, Total=306 [2022-07-22 22:37:47,778 INFO L87 Difference]: Start difference. First operand 596 states and 743 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-22 22:37:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:48,190 INFO L93 Difference]: Finished difference Result 702 states and 868 transitions. [2022-07-22 22:37:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:37:48,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 105 [2022-07-22 22:37:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:48,193 INFO L225 Difference]: With dead ends: 702 [2022-07-22 22:37:48,193 INFO L226 Difference]: Without dead ends: 661 [2022-07-22 22:37:48,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=303, Unknown=1, NotChecked=34, Total=380 [2022-07-22 22:37:48,194 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:48,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1058 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 238 Unchecked, 0.3s Time] [2022-07-22 22:37:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-22 22:37:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-07-22 22:37:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 487 states have (on average 1.2258726899383983) internal successors, (597), 490 states have internal predecessors, (597), 90 states have call successors, (90), 49 states have call predecessors, (90), 50 states have return successors, (98), 88 states have call predecessors, (98), 86 states have call successors, (98) [2022-07-22 22:37:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 785 transitions. [2022-07-22 22:37:48,232 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 785 transitions. Word has length 105 [2022-07-22 22:37:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:48,233 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 785 transitions. [2022-07-22 22:37:48,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-22 22:37:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 785 transitions. [2022-07-22 22:37:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-22 22:37:48,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:48,234 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-07-22 22:37:48,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 22:37:48,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:48,460 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1953167954, now seen corresponding path program 1 times [2022-07-22 22:37:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:48,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722117476] [2022-07-22 22:37:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:37:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:37:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:37:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:37:48,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:48,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722117476] [2022-07-22 22:37:48,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722117476] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:48,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187012040] [2022-07-22 22:37:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:48,730 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:48,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 22:37:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:37:49,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 22:37:49,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:49,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187012040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:49,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:49,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-22 22:37:49,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296794496] [2022-07-22 22:37:49,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:49,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:37:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:37:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:37:49,242 INFO L87 Difference]: Start difference. First operand 628 states and 785 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:49,398 INFO L93 Difference]: Finished difference Result 1390 states and 1777 transitions. [2022-07-22 22:37:49,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:37:49,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2022-07-22 22:37:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:49,402 INFO L225 Difference]: With dead ends: 1390 [2022-07-22 22:37:49,402 INFO L226 Difference]: Without dead ends: 810 [2022-07-22 22:37:49,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:37:49,406 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 145 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:49,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 2158 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:37:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-22 22:37:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 628. [2022-07-22 22:37:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 491 states have internal predecessors, (591), 88 states have call successors, (88), 49 states have call predecessors, (88), 54 states have return successors, (102), 87 states have call predecessors, (102), 84 states have call successors, (102) [2022-07-22 22:37:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 781 transitions. [2022-07-22 22:37:49,445 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 781 transitions. Word has length 105 [2022-07-22 22:37:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:49,445 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 781 transitions. [2022-07-22 22:37:49,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 781 transitions. [2022-07-22 22:37:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 22:37:49,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:49,447 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-22 22:37:49,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 22:37:49,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 22:37:49,662 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1044819566, now seen corresponding path program 1 times [2022-07-22 22:37:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:49,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232903451] [2022-07-22 22:37:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:37:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 22:37:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:37:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:37:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232903451] [2022-07-22 22:37:49,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232903451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465907506] [2022-07-22 22:37:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:49,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:49,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:49,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:49,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 22:37:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:50,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-22 22:37:50,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 22:37:50,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:50,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465907506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:50,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:50,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2022-07-22 22:37:50,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440876749] [2022-07-22 22:37:50,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:50,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:37:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:50,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:37:50,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:37:50,531 INFO L87 Difference]: Start difference. First operand 628 states and 781 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:50,655 INFO L93 Difference]: Finished difference Result 1262 states and 1579 transitions. [2022-07-22 22:37:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:37:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2022-07-22 22:37:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:50,658 INFO L225 Difference]: With dead ends: 1262 [2022-07-22 22:37:50,658 INFO L226 Difference]: Without dead ends: 677 [2022-07-22 22:37:50,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:37:50,660 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 23 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:50,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1536 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:37:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-07-22 22:37:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 648. [2022-07-22 22:37:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 500 states have (on average 1.212) internal successors, (606), 505 states have internal predecessors, (606), 88 states have call successors, (88), 49 states have call predecessors, (88), 59 states have return successors, (111), 93 states have call predecessors, (111), 84 states have call successors, (111) [2022-07-22 22:37:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2022-07-22 22:37:50,697 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2022-07-22 22:37:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:50,697 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2022-07-22 22:37:50,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2022-07-22 22:37:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 22:37:50,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:50,699 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-07-22 22:37:50,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 22:37:50,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:50,914 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:50,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829069, now seen corresponding path program 1 times [2022-07-22 22:37:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:50,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844625413] [2022-07-22 22:37:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:37:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 22:37:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:37:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:37:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:51,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844625413] [2022-07-22 22:37:51,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844625413] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:51,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844730473] [2022-07-22 22:37:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:51,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:51,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:51,189 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:51,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 22:37:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:51,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 22:37:51,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 22:37:51,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:51,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844730473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:51,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:51,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-22 22:37:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873705910] [2022-07-22 22:37:51,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:51,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:37:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:37:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:37:51,715 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:51,863 INFO L93 Difference]: Finished difference Result 856 states and 1088 transitions. [2022-07-22 22:37:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:37:51,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2022-07-22 22:37:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:51,867 INFO L225 Difference]: With dead ends: 856 [2022-07-22 22:37:51,867 INFO L226 Difference]: Without dead ends: 821 [2022-07-22 22:37:51,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:37:51,868 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 186 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:51,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1928 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:37:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-07-22 22:37:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 648. [2022-07-22 22:37:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 500 states have (on average 1.212) internal successors, (606), 505 states have internal predecessors, (606), 88 states have call successors, (88), 49 states have call predecessors, (88), 59 states have return successors, (111), 93 states have call predecessors, (111), 84 states have call successors, (111) [2022-07-22 22:37:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2022-07-22 22:37:51,912 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2022-07-22 22:37:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:51,912 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2022-07-22 22:37:51,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2022-07-22 22:37:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 22:37:51,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:51,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-07-22 22:37:51,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 22:37:52,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:52,124 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 966922471, now seen corresponding path program 1 times [2022-07-22 22:37:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:52,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763365470] [2022-07-22 22:37:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:37:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 22:37:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:37:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:37:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:52,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763365470] [2022-07-22 22:37:52,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763365470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:52,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816847969] [2022-07-22 22:37:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:52,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:52,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:52,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:52,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 22:37:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:52,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 22:37:52,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:37:52,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:37:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 22:37:53,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816847969] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:53,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:37:53,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 17 [2022-07-22 22:37:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816710014] [2022-07-22 22:37:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:53,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:37:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:37:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:37:53,169 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:37:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:53,619 INFO L93 Difference]: Finished difference Result 1874 states and 2335 transitions. [2022-07-22 22:37:53,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:37:53,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2022-07-22 22:37:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:53,625 INFO L225 Difference]: With dead ends: 1874 [2022-07-22 22:37:53,625 INFO L226 Difference]: Without dead ends: 1250 [2022-07-22 22:37:53,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:37:53,628 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 359 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:53,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 689 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:37:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-07-22 22:37:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1210. [2022-07-22 22:37:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 935 states have (on average 1.2117647058823529) internal successors, (1133), 943 states have internal predecessors, (1133), 163 states have call successors, (163), 92 states have call predecessors, (163), 111 states have return successors, (208), 174 states have call predecessors, (208), 159 states have call successors, (208) [2022-07-22 22:37:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1504 transitions. [2022-07-22 22:37:53,705 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1504 transitions. Word has length 108 [2022-07-22 22:37:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:53,705 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1504 transitions. [2022-07-22 22:37:53,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:37:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1504 transitions. [2022-07-22 22:37:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 22:37:53,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:53,707 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-22 22:37:53,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 22:37:53,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 22:37:53,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1819211607, now seen corresponding path program 1 times [2022-07-22 22:37:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418724232] [2022-07-22 22:37:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:53,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:37:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:37:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:37:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:37:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 22:37:54,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:54,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418724232] [2022-07-22 22:37:54,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418724232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:54,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486228157] [2022-07-22 22:37:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:54,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:54,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:54,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:54,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 22:37:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:54,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 1779 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 22:37:54,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:37:54,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:54,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486228157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:54,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:54,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-22 22:37:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977740013] [2022-07-22 22:37:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:54,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:37:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:37:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:54,818 INFO L87 Difference]: Start difference. First operand 1210 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:54,887 INFO L93 Difference]: Finished difference Result 1861 states and 2314 transitions. [2022-07-22 22:37:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:37:54,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2022-07-22 22:37:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:54,891 INFO L225 Difference]: With dead ends: 1861 [2022-07-22 22:37:54,891 INFO L226 Difference]: Without dead ends: 697 [2022-07-22 22:37:54,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:37:54,893 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 13 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 589 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-22 22:37:54,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 589 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:37:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-07-22 22:37:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 667. [2022-07-22 22:37:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 515 states have (on average 1.2058252427184466) internal successors, (621), 520 states have internal predecessors, (621), 90 states have call successors, (90), 51 states have call predecessors, (90), 61 states have return successors, (112), 95 states have call predecessors, (112), 86 states have call successors, (112) [2022-07-22 22:37:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 823 transitions. [2022-07-22 22:37:54,940 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 823 transitions. Word has length 116 [2022-07-22 22:37:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:54,941 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 823 transitions. [2022-07-22 22:37:54,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 823 transitions. [2022-07-22 22:37:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 22:37:54,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:54,942 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-22 22:37:54,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 22:37:55,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 22:37:55,168 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:55,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2067358101, now seen corresponding path program 1 times [2022-07-22 22:37:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:55,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393082980] [2022-07-22 22:37:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:55,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:37:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:37:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:37:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:37:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 22:37:55,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:55,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393082980] [2022-07-22 22:37:55,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393082980] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:55,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426146825] [2022-07-22 22:37:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:55,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:55,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:55,396 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:55,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 22:37:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:55,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 1778 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 22:37:55,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:37:56,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:56,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426146825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:56,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:56,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-07-22 22:37:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601389433] [2022-07-22 22:37:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:56,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:37:56,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:37:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:56,139 INFO L87 Difference]: Start difference. First operand 667 states and 823 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:56,279 INFO L93 Difference]: Finished difference Result 1213 states and 1506 transitions. [2022-07-22 22:37:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:37:56,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2022-07-22 22:37:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:56,285 INFO L225 Difference]: With dead ends: 1213 [2022-07-22 22:37:56,285 INFO L226 Difference]: Without dead ends: 1208 [2022-07-22 22:37:56,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:56,286 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 247 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:56,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:37:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-07-22 22:37:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1176. [2022-07-22 22:37:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 910 states have (on average 1.2142857142857142) internal successors, (1105), 917 states have internal predecessors, (1105), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2022-07-22 22:37:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1466 transitions. [2022-07-22 22:37:56,358 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1466 transitions. Word has length 116 [2022-07-22 22:37:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:56,358 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1466 transitions. [2022-07-22 22:37:56,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 22:37:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2022-07-22 22:37:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-22 22:37:56,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:56,360 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-22 22:37:56,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 22:37:56,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 22:37:56,583 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash 541721343, now seen corresponding path program 1 times [2022-07-22 22:37:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219087163] [2022-07-22 22:37:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:37:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:37:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:37:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:37:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:37:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 22:37:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-22 22:37:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:56,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219087163] [2022-07-22 22:37:56,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219087163] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:56,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451863777] [2022-07-22 22:37:56,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:56,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:56,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:56,879 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:56,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 22:37:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:57,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 1834 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 22:37:57,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:37:57,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:57,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451863777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:57,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:57,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-22 22:37:57,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645805481] [2022-07-22 22:37:57,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:57,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:37:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:57,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:37:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:57,510 INFO L87 Difference]: Start difference. First operand 1176 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 22:37:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:57,613 INFO L93 Difference]: Finished difference Result 1368 states and 1732 transitions. [2022-07-22 22:37:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:37:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2022-07-22 22:37:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:57,619 INFO L225 Difference]: With dead ends: 1368 [2022-07-22 22:37:57,619 INFO L226 Difference]: Without dead ends: 1358 [2022-07-22 22:37:57,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:37:57,621 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 213 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:57,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 446 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:37:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-07-22 22:37:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1182. [2022-07-22 22:37:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 916 states have (on average 1.212882096069869) internal successors, (1111), 923 states have internal predecessors, (1111), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2022-07-22 22:37:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1472 transitions. [2022-07-22 22:37:57,707 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1472 transitions. Word has length 129 [2022-07-22 22:37:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:57,707 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1472 transitions. [2022-07-22 22:37:57,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 22:37:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1472 transitions. [2022-07-22 22:37:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-22 22:37:57,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:57,710 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-22 22:37:57,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-22 22:37:57,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 22:37:57,931 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash -554191626, now seen corresponding path program 1 times [2022-07-22 22:37:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:57,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784163949] [2022-07-22 22:37:57,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:37:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:37:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:37:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:37:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:37:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:37:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-22 22:37:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:58,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784163949] [2022-07-22 22:37:58,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784163949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:58,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059513846] [2022-07-22 22:37:58,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:58,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:58,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:58,220 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:58,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 22:37:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:58,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 1846 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:37:58,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:37:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:37:58,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:37:58,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059513846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:37:58,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:37:58,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-22 22:37:58,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353482631] [2022-07-22 22:37:58,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:37:58,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:37:58,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:58,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:37:58,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:58,900 INFO L87 Difference]: Start difference. First operand 1182 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-22 22:37:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:37:58,998 INFO L93 Difference]: Finished difference Result 2302 states and 2876 transitions. [2022-07-22 22:37:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:37:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 133 [2022-07-22 22:37:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:37:59,004 INFO L225 Difference]: With dead ends: 2302 [2022-07-22 22:37:59,005 INFO L226 Difference]: Without dead ends: 1110 [2022-07-22 22:37:59,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:37:59,007 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:37:59,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 423 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:37:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-07-22 22:37:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2022-07-22 22:37:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 844 states have (on average 1.15521327014218) internal successors, (975), 851 states have internal predecessors, (975), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2022-07-22 22:37:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1336 transitions. [2022-07-22 22:37:59,096 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1336 transitions. Word has length 133 [2022-07-22 22:37:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:37:59,096 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1336 transitions. [2022-07-22 22:37:59,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-22 22:37:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1336 transitions. [2022-07-22 22:37:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-22 22:37:59,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:37:59,098 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-22 22:37:59,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 22:37:59,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 22:37:59,318 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:37:59,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:37:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash 78838695, now seen corresponding path program 1 times [2022-07-22 22:37:59,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:37:59,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880234977] [2022-07-22 22:37:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:59,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:37:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:37:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:37:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:37:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:37:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:37:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:37:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:37:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:37:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:37:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:37:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:37:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:37:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 22:37:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 22:37:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-22 22:37:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:37:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 22:37:59,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:37:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880234977] [2022-07-22 22:37:59,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880234977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:59,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598291537] [2022-07-22 22:37:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:37:59,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:37:59,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:37:59,625 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:37:59,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 22:38:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:00,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 22:38:00,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 22:38:00,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:38:00,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598291537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:00,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:38:00,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2022-07-22 22:38:00,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400110712] [2022-07-22 22:38:00,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:00,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:38:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:38:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:38:00,398 INFO L87 Difference]: Start difference. First operand 1110 states and 1336 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 22:38:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:00,579 INFO L93 Difference]: Finished difference Result 2194 states and 2647 transitions. [2022-07-22 22:38:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:38:00,580 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2022-07-22 22:38:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:00,584 INFO L225 Difference]: With dead ends: 2194 [2022-07-22 22:38:00,584 INFO L226 Difference]: Without dead ends: 1139 [2022-07-22 22:38:00,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:38:00,587 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 27 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:00,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1590 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:38:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-07-22 22:38:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1110. [2022-07-22 22:38:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 844 states have (on average 1.1492890995260663) internal successors, (970), 851 states have internal predecessors, (970), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2022-07-22 22:38:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1331 transitions. [2022-07-22 22:38:00,659 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1331 transitions. Word has length 144 [2022-07-22 22:38:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:00,660 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1331 transitions. [2022-07-22 22:38:00,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 22:38:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1331 transitions. [2022-07-22 22:38:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-22 22:38:00,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:00,662 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-22 22:38:00,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 22:38:00,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 22:38:00,876 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash 92371496, now seen corresponding path program 2 times [2022-07-22 22:38:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:00,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390592095] [2022-07-22 22:38:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:00,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:38:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:38:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:38:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:38:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:38:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:38:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:38:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:38:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:38:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 22:38:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 22:38:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-22 22:38:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 22:38:01,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:01,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390592095] [2022-07-22 22:38:01,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390592095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:01,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522151981] [2022-07-22 22:38:01,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:38:01,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:01,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:01,132 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:38:01,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 22:38:01,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 22:38:01,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:38:01,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 22:38:01,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:38:01,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:38:01,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522151981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:01,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:38:01,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-22 22:38:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336559609] [2022-07-22 22:38:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:01,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:38:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:01,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:38:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:38:01,798 INFO L87 Difference]: Start difference. First operand 1110 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:38:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:01,860 INFO L93 Difference]: Finished difference Result 1765 states and 2122 transitions. [2022-07-22 22:38:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:38:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2022-07-22 22:38:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:01,863 INFO L225 Difference]: With dead ends: 1765 [2022-07-22 22:38:01,863 INFO L226 Difference]: Without dead ends: 717 [2022-07-22 22:38:01,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:38:01,866 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:01,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 360 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:38:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-07-22 22:38:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2022-07-22 22:38:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 543 states have (on average 1.138121546961326) internal successors, (618), 548 states have internal predecessors, (618), 100 states have call successors, (100), 61 states have call predecessors, (100), 69 states have return successors, (122), 103 states have call predecessors, (122), 96 states have call successors, (122) [2022-07-22 22:38:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 840 transitions. [2022-07-22 22:38:01,912 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 840 transitions. Word has length 144 [2022-07-22 22:38:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:01,912 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 840 transitions. [2022-07-22 22:38:01,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:38:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 840 transitions. [2022-07-22 22:38:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-22 22:38:01,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:01,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-22 22:38:01,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 22:38:02,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:02,127 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:02,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1279560877, now seen corresponding path program 1 times [2022-07-22 22:38:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:02,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597328210] [2022-07-22 22:38:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:38:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:38:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:38:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:38:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:38:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:38:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:38:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:38:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:38:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 22:38:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 22:38:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 22:38:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:02,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597328210] [2022-07-22 22:38:02,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597328210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:02,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962171045] [2022-07-22 22:38:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:02,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:02,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:02,386 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:38:02,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 22:38:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 22:38:03,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:38:03,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:38:03,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962171045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:03,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:38:03,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-07-22 22:38:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370793300] [2022-07-22 22:38:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:03,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:38:03,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:03,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:38:03,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:38:03,200 INFO L87 Difference]: Start difference. First operand 713 states and 840 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:38:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:03,498 INFO L93 Difference]: Finished difference Result 1338 states and 1585 transitions. [2022-07-22 22:38:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:38:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 146 [2022-07-22 22:38:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:03,502 INFO L225 Difference]: With dead ends: 1338 [2022-07-22 22:38:03,502 INFO L226 Difference]: Without dead ends: 653 [2022-07-22 22:38:03,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:38:03,504 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 149 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:03,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 511 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:38:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-07-22 22:38:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 596. [2022-07-22 22:38:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 456 states have (on average 1.1337719298245614) internal successors, (517), 461 states have internal predecessors, (517), 84 states have call successors, (84), 49 states have call predecessors, (84), 55 states have return successors, (102), 85 states have call predecessors, (102), 81 states have call successors, (102) [2022-07-22 22:38:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 703 transitions. [2022-07-22 22:38:03,544 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 703 transitions. Word has length 146 [2022-07-22 22:38:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:03,545 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 703 transitions. [2022-07-22 22:38:03,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:38:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 703 transitions. [2022-07-22 22:38:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:38:03,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:03,547 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-22 22:38:03,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 22:38:03,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:03,765 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1011559813, now seen corresponding path program 1 times [2022-07-22 22:38:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:03,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874367926] [2022-07-22 22:38:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:38:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:38:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:38:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:38:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:38:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:38:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:38:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:38:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:38:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 22:38:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:04,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 22:38:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 22:38:04,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:04,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874367926] [2022-07-22 22:38:04,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874367926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:04,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831977389] [2022-07-22 22:38:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:04,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:04,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:04,008 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:38:04,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 22:38:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:04,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 22:38:04,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 22:38:04,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:38:04,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831977389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:04,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:38:04,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 16 [2022-07-22 22:38:04,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289872250] [2022-07-22 22:38:04,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:04,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:38:04,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:38:04,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:38:04,845 INFO L87 Difference]: Start difference. First operand 596 states and 703 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 22:38:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:05,079 INFO L93 Difference]: Finished difference Result 1241 states and 1469 transitions. [2022-07-22 22:38:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:38:05,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2022-07-22 22:38:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:05,083 INFO L225 Difference]: With dead ends: 1241 [2022-07-22 22:38:05,083 INFO L226 Difference]: Without dead ends: 673 [2022-07-22 22:38:05,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:38:05,084 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 32 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:05,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1765 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:38:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-22 22:38:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 633. [2022-07-22 22:38:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 488 states have (on average 1.1311475409836065) internal successors, (552), 490 states have internal predecessors, (552), 84 states have call successors, (84), 49 states have call predecessors, (84), 60 states have return successors, (110), 93 states have call predecessors, (110), 81 states have call successors, (110) [2022-07-22 22:38:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 746 transitions. [2022-07-22 22:38:05,131 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 746 transitions. Word has length 147 [2022-07-22 22:38:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:05,132 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 746 transitions. [2022-07-22 22:38:05,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 22:38:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 746 transitions. [2022-07-22 22:38:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:38:05,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:05,134 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-22 22:38:05,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-22 22:38:05,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:05,355 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2093368100, now seen corresponding path program 2 times [2022-07-22 22:38:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:05,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469159969] [2022-07-22 22:38:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:38:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:38:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:38:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:38:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:38:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:38:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:38:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:38:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:38:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 22:38:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 22:38:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 22:38:05,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469159969] [2022-07-22 22:38:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469159969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311049912] [2022-07-22 22:38:05,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:38:05,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:05,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:05,608 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:38:05,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 22:38:06,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 22:38:06,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:38:06,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 22:38:06,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:38:06,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:38:06,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311049912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:06,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:38:06,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-22 22:38:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797268773] [2022-07-22 22:38:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:06,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:38:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:38:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:38:06,389 INFO L87 Difference]: Start difference. First operand 633 states and 746 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:38:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:06,426 INFO L93 Difference]: Finished difference Result 660 states and 770 transitions. [2022-07-22 22:38:06,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:38:06,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2022-07-22 22:38:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:06,428 INFO L225 Difference]: With dead ends: 660 [2022-07-22 22:38:06,428 INFO L226 Difference]: Without dead ends: 259 [2022-07-22 22:38:06,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:38:06,430 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:06,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:38:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-22 22:38:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2022-07-22 22:38:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 186 states have (on average 1.0913978494623655) internal successors, (203), 189 states have internal predecessors, (203), 34 states have call successors, (34), 22 states have call predecessors, (34), 24 states have return successors, (37), 33 states have call predecessors, (37), 32 states have call successors, (37) [2022-07-22 22:38:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2022-07-22 22:38:06,446 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 147 [2022-07-22 22:38:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:06,447 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2022-07-22 22:38:06,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:38:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-07-22 22:38:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-22 22:38:06,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:06,449 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:38:06,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-22 22:38:06,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:06,663 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash 301053376, now seen corresponding path program 1 times [2022-07-22 22:38:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:06,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137692844] [2022-07-22 22:38:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 22:38:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:38:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:38:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:38:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:38:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:38:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:38:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:38:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:38:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 22:38:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 22:38:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 22:38:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-22 22:38:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:06,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137692844] [2022-07-22 22:38:06,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137692844] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:06,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875104451] [2022-07-22 22:38:06,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:06,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:06,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:06,928 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:38:06,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-22 22:38:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:07,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 22:38:07,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:38:07,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:38:07,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875104451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:07,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:38:07,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-07-22 22:38:07,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207425281] [2022-07-22 22:38:07,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:07,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:38:07,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:07,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:38:07,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:38:07,811 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 22:38:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:07,859 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2022-07-22 22:38:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:38:07,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 177 [2022-07-22 22:38:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:07,860 INFO L225 Difference]: With dead ends: 251 [2022-07-22 22:38:07,860 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 22:38:07,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:38:07,861 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 36 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:07,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 572 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:38:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 22:38:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 22:38:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 22:38:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 22:38:07,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2022-07-22 22:38:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:07,862 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 22:38:07,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 22:38:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 22:38:07,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 22:38:07,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:38:07,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-22 22:38:08,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:08,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 22:38:15,958 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-22 22:38:23,055 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-22 22:38:32,819 INFO L902 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2022-07-22 22:38:32,820 INFO L899 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2022-07-22 22:38:32,820 INFO L902 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2022-07-22 22:38:32,820 INFO L902 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2022-07-22 22:38:32,820 INFO L902 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2022-07-22 22:38:32,820 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2022-07-22 22:38:32,820 INFO L899 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2022-07-22 22:38:32,820 INFO L899 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2022-07-22 22:38:32,821 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2022-07-22 22:38:32,821 INFO L895 garLoopResultBuilder]: At program point dev_get_drvdataENTRY(lines 4209 4211) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-22 22:38:32,821 INFO L895 garLoopResultBuilder]: At program point L4210(line 4210) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-22 22:38:32,821 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2022-07-22 22:38:32,821 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2022-07-22 22:38:32,821 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 4264 4266) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2022-07-22 22:38:32,821 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2022-07-22 22:38:32,822 INFO L899 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2022-07-22 22:38:32,822 INFO L902 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2022-07-22 22:38:32,822 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2022-07-22 22:38:32,822 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2022-07-22 22:38:32,822 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2022-07-22 22:38:32,822 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2022-07-22 22:38:32,822 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2022-07-22 22:38:32,823 INFO L895 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .cse1 (not (= ~ldv_coherent_state~0 1)) .cse2 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse2))) [2022-07-22 22:38:32,823 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2022-07-22 22:38:32,823 INFO L902 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2022-07-22 22:38:32,823 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2022-07-22 22:38:32,823 INFO L895 garLoopResultBuilder]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-22 22:38:32,823 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2022-07-22 22:38:32,824 INFO L895 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 4150 4179) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-22 22:38:32,824 INFO L899 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2022-07-22 22:38:32,824 INFO L899 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2022-07-22 22:38:32,824 INFO L895 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0)) (and (= ~ldv_urb_state~0 0) (not (= (mod (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset) 18446744073709551616) 0)))) [2022-07-22 22:38:32,824 INFO L895 garLoopResultBuilder]: At program point L4166(line 4166) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-22 22:38:32,824 INFO L899 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2022-07-22 22:38:32,824 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2022-07-22 22:38:32,825 INFO L902 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2022-07-22 22:38:32,825 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2022-07-22 22:38:32,825 INFO L899 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2022-07-22 22:38:32,825 INFO L902 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2022-07-22 22:38:32,825 INFO L902 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2022-07-22 22:38:32,825 INFO L899 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2022-07-22 22:38:32,826 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 4201 4205) the Hoare annotation is: (let ((.cse2 (not (= ~ldv_coherent_state~0 1))) (.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_urb_state~0 1)) .cse1 .cse2 .cse3) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse3))) [2022-07-22 22:38:32,826 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2022-07-22 22:38:32,826 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2022-07-22 22:38:32,826 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2022-07-22 22:38:32,826 INFO L895 garLoopResultBuilder]: At program point L4207(line 4207) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-22 22:38:32,826 INFO L899 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2022-07-22 22:38:32,826 INFO L902 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2022-07-22 22:38:32,827 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2022-07-22 22:38:32,827 INFO L902 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2022-07-22 22:38:32,827 INFO L895 garLoopResultBuilder]: At program point kzallocENTRY(lines 3405 3413) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-22 22:38:32,827 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2022-07-22 22:38:32,827 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2022-07-22 22:38:32,827 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2022-07-22 22:38:32,827 INFO L895 garLoopResultBuilder]: At program point L4117(lines 4093 4122) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse3 (not (= |old(~ldv_coherent_state~0)| 1)))) (and (let ((.cse1 (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base)) (.cse2 (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset))) (or .cse0 (and (= |usb_free_coherent_#in~addr.base| 0) (<= 1 ~ldv_coherent_state~0) (= |usb_free_coherent_#in~addr.offset| 0) .cse1 .cse2) .cse3 (and (= ~ldv_coherent_state~0 0) .cse1 .cse2))) (or (not (= (mod (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset) 18446744073709551616) 0)) .cse0 (not (= 0 ~res_kbtab_probe_3~0)) .cse3))) [2022-07-22 22:38:32,828 INFO L895 garLoopResultBuilder]: At program point usb_free_coherentENTRY(lines 4093 4122) the Hoare annotation is: (or (= ~ldv_coherent_state~0 1) (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2022-07-22 22:38:32,828 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2022-07-22 22:38:32,828 INFO L895 garLoopResultBuilder]: At program point L4109(line 4109) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2022-07-22 22:38:32,828 INFO L899 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2022-07-22 22:38:32,828 INFO L902 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2022-07-22 22:38:32,828 INFO L899 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2022-07-22 22:38:32,829 INFO L895 garLoopResultBuilder]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (and (= ~ldv_coherent_state~0 1) (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base) (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset)) (not (= |old(~ldv_coherent_state~0)| 1))) [2022-07-22 22:38:32,829 INFO L899 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2022-07-22 22:38:32,829 INFO L899 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2022-07-22 22:38:32,829 INFO L895 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-22 22:38:32,829 INFO L899 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2022-07-22 22:38:32,829 INFO L895 garLoopResultBuilder]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2022-07-22 22:38:32,829 INFO L895 garLoopResultBuilder]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,830 INFO L895 garLoopResultBuilder]: At program point L3884(line 3884) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-22 22:38:32,830 INFO L899 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2022-07-22 22:38:32,830 INFO L899 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2022-07-22 22:38:32,830 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2022-07-22 22:38:32,830 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 22:38:32,830 INFO L899 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2022-07-22 22:38:32,830 INFO L895 garLoopResultBuilder]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-07-22 22:38:32,831 INFO L899 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2022-07-22 22:38:32,831 INFO L895 garLoopResultBuilder]: At program point L3885(line 3885) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1)) [2022-07-22 22:38:32,831 INFO L899 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2022-07-22 22:38:32,831 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2022-07-22 22:38:32,831 INFO L899 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2022-07-22 22:38:32,831 INFO L895 garLoopResultBuilder]: At program point L3886(line 3886) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0)) [2022-07-22 22:38:32,831 INFO L899 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2022-07-22 22:38:32,832 INFO L895 garLoopResultBuilder]: At program point L3886-1(lines 3875 3890) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0)) [2022-07-22 22:38:32,832 INFO L895 garLoopResultBuilder]: At program point L4233(lines 4232 4234) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse5 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse4 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= (+ 12 ~res_kbtab_probe_3~0) 0) .cse1 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse3 .cse4 .cse5 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse2 .cse6) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse3 (not .cse6) .cse5 .cse1 .cse2 (not .cse4)))) [2022-07-22 22:38:32,832 INFO L899 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2022-07-22 22:38:32,832 INFO L899 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2022-07-22 22:38:32,832 INFO L895 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2022-07-22 22:38:32,832 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-07-22 22:38:32,832 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2022-07-22 22:38:32,833 INFO L899 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2022-07-22 22:38:32,833 INFO L899 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2022-07-22 22:38:32,833 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2022-07-22 22:38:32,833 INFO L899 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2022-07-22 22:38:32,833 INFO L899 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2022-07-22 22:38:32,833 INFO L895 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-22 22:38:32,833 INFO L895 garLoopResultBuilder]: At program point L3426(line 3426) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-22 22:38:32,834 INFO L895 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse5 (= ~ldv_coherent_state~0 0)) (.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse6 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse5 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 .cse1 (not .cse4) .cse2 .cse6 .cse3))) [2022-07-22 22:38:32,834 INFO L899 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2022-07-22 22:38:32,834 INFO L895 garLoopResultBuilder]: At program point L3839-1(line 3839) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,834 INFO L895 garLoopResultBuilder]: At program point L3839(line 3839) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,834 INFO L895 garLoopResultBuilder]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,834 INFO L895 garLoopResultBuilder]: At program point L3856(line 3856) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-07-22 22:38:32,835 INFO L899 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2022-07-22 22:38:32,835 INFO L895 garLoopResultBuilder]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-07-22 22:38:32,835 INFO L895 garLoopResultBuilder]: At program point L3972(line 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-07-22 22:38:32,835 INFO L899 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2022-07-22 22:38:32,835 INFO L895 garLoopResultBuilder]: At program point L3840(line 3840) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,835 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:38:32,835 INFO L899 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2022-07-22 22:38:32,836 INFO L895 garLoopResultBuilder]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2022-07-22 22:38:32,836 INFO L895 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2022-07-22 22:38:32,836 INFO L895 garLoopResultBuilder]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,836 INFO L895 garLoopResultBuilder]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,836 INFO L895 garLoopResultBuilder]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-22 22:38:32,836 INFO L895 garLoopResultBuilder]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,836 INFO L899 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2022-07-22 22:38:32,837 INFO L895 garLoopResultBuilder]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (.cse4 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (= ~ldv_coherent_state~0 0) .cse0 .cse1 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0) .cse2 .cse3 .cse4) (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 (= ~ldv_coherent_state~0 1) .cse3 (not .cse2) .cse4))) [2022-07-22 22:38:32,837 INFO L895 garLoopResultBuilder]: At program point L4073(line 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,837 INFO L899 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2022-07-22 22:38:32,837 INFO L895 garLoopResultBuilder]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2022-07-22 22:38:32,837 INFO L899 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2022-07-22 22:38:32,837 INFO L895 garLoopResultBuilder]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,838 INFO L899 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2022-07-22 22:38:32,838 INFO L895 garLoopResultBuilder]: At program point L3529(line 3529) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:38:32,838 INFO L899 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2022-07-22 22:38:32,838 INFO L895 garLoopResultBuilder]: At program point L3513(line 3513) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,838 INFO L895 garLoopResultBuilder]: At program point L3513-2(lines 3512 3514) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,838 INFO L899 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2022-07-22 22:38:32,839 INFO L895 garLoopResultBuilder]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,839 INFO L899 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2022-07-22 22:38:32,839 INFO L895 garLoopResultBuilder]: At program point L3861(line 3861) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-07-22 22:38:32,839 INFO L895 garLoopResultBuilder]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,839 INFO L895 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-22 22:38:32,839 INFO L899 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2022-07-22 22:38:32,839 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2022-07-22 22:38:32,840 INFO L899 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2022-07-22 22:38:32,840 INFO L895 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-22 22:38:32,840 INFO L895 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2022-07-22 22:38:32,840 INFO L895 garLoopResultBuilder]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-07-22 22:38:32,840 INFO L895 garLoopResultBuilder]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-07-22 22:38:32,840 INFO L895 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ~ldv_coherent_state~0 1)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-07-22 22:38:32,840 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2022-07-22 22:38:32,841 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:38:32,841 INFO L895 garLoopResultBuilder]: At program point L3798(line 3798) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,841 INFO L899 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2022-07-22 22:38:32,841 INFO L895 garLoopResultBuilder]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,841 INFO L899 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2022-07-22 22:38:32,841 INFO L899 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2022-07-22 22:38:32,842 INFO L895 garLoopResultBuilder]: At program point L3865(line 3865) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ~ldv_coherent_state~0 1)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (or (not (= |ULTIMATE.start_kbtab_probe_#t~mem80#1.base| 0)) (not (= |ULTIMATE.start_kbtab_probe_#t~mem80#1.offset| 0))) .cse1 .cse2 .cse3 .cse4 .cse5 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-07-22 22:38:32,842 INFO L895 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse7 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse8 (= ~ldv_coherent_state~0 1)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) (.cse6 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)))) (.cse5 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (let ((.cse4 (not .cse7))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5))) (= 0 ~res_kbtab_probe_3~0) .cse8 (= ~ldv_urb_state~0 1)) (and .cse0 .cse1 .cse7 (= ~ldv_urb_state~0 0) .cse8 .cse2 .cse3 .cse6 .cse5 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)))) [2022-07-22 22:38:32,842 INFO L899 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2022-07-22 22:38:32,842 INFO L895 garLoopResultBuilder]: At program point L3882(line 3882) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-22 22:38:32,842 INFO L899 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2022-07-22 22:38:32,842 INFO L895 garLoopResultBuilder]: At program point L4130(line 4130) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-22 22:38:32,843 INFO L895 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| |ULTIMATE.start_main_~tmp___8~3#1|)))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 .cse4 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 .cse4 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-07-22 22:38:32,843 INFO L895 garLoopResultBuilder]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-22 22:38:32,843 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2022-07-22 22:38:32,843 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2022-07-22 22:38:32,843 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2022-07-22 22:38:32,843 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2022-07-22 22:38:32,843 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2022-07-22 22:38:32,844 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2022-07-22 22:38:32,844 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2022-07-22 22:38:32,847 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:38:32,848 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:38:32,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:32,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:32,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:32,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:32,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:32,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:32,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:32,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:32,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:32,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:32,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:32,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:32,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:32,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:32,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:32,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:32,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:38:32 BoogieIcfgContainer [2022-07-22 22:38:32,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:38:32,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:38:32,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:38:32,881 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:38:32,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:37:40" (3/4) ... [2022-07-22 22:38:32,884 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2022-07-22 22:38:32,889 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-22 22:38:32,890 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-07-22 22:38:32,890 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-07-22 22:38:32,890 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2022-07-22 22:38:32,890 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-07-22 22:38:32,890 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-07-22 22:38:32,906 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2022-07-22 22:38:32,907 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-22 22:38:32,908 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-22 22:38:32,909 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 22:38:32,910 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:38:32,938 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 == \old(ldv_urb_state)) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3)) || (ldv_urb_state == 0 && !((urb + urb) % 18446744073709551616 == 0)) [2022-07-22 22:38:32,938 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_urb_state == 0) || ((((addr == 0 && 1 <= ldv_coherent_state) && addr == 0) && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1)) || ((ldv_coherent_state == 0 && addr == addr) && addr == addr)) && (((!((addr + addr) % 18446744073709551616 == 0) || !(ldv_urb_state == 0)) || !(0 == res_kbtab_probe_3)) || !(\old(ldv_coherent_state) == 1)) [2022-07-22 22:38:32,938 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) || (((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) [2022-07-22 22:38:32,940 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_urb_state == 0) || ((ldv_coherent_state == 1 && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1) [2022-07-22 22:38:32,941 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-07-22 22:38:32,941 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) [2022-07-22 22:38:32,941 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) [2022-07-22 22:38:32,941 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0)) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) || (((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) && 0 == \result) [2022-07-22 22:38:32,942 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-22 22:38:32,942 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == 1 || !(1 == \old(ldv_urb_state))) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3) [2022-07-22 22:38:32,942 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0 [2022-07-22 22:38:32,942 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-22 22:38:32,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-22 22:38:32,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-22 22:38:32,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-22 22:38:32,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-22 22:38:32,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-22 22:38:32,944 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) [2022-07-22 22:38:33,057 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 22:38:33,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:38:33,058 INFO L158 Benchmark]: Toolchain (without parser) took 55024.34ms. Allocated memory was 94.4MB in the beginning and 773.8MB in the end (delta: 679.5MB). Free memory was 58.3MB in the beginning and 422.8MB in the end (delta: -364.5MB). Peak memory consumption was 313.3MB. Max. memory is 16.1GB. [2022-07-22 22:38:33,058 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:38:33,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 887.28ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 58.1MB in the beginning and 57.4MB in the end (delta: 664.6kB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-07-22 22:38:33,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.71ms. Allocated memory is still 113.2MB. Free memory was 57.4MB in the beginning and 51.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 22:38:33,059 INFO L158 Benchmark]: Boogie Preprocessor took 93.56ms. Allocated memory is still 113.2MB. Free memory was 51.7MB in the beginning and 46.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 22:38:33,061 INFO L158 Benchmark]: RCFGBuilder took 1242.69ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 46.4MB in the beginning and 105.0MB in the end (delta: -58.6MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-07-22 22:38:33,063 INFO L158 Benchmark]: TraceAbstraction took 52516.94ms. Allocated memory was 144.7MB in the beginning and 773.8MB in the end (delta: 629.1MB). Free memory was 104.0MB in the beginning and 441.7MB in the end (delta: -337.7MB). Peak memory consumption was 484.4MB. Max. memory is 16.1GB. [2022-07-22 22:38:33,063 INFO L158 Benchmark]: Witness Printer took 176.63ms. Allocated memory is still 773.8MB. Free memory was 441.7MB in the beginning and 422.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-22 22:38:33,068 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.19ms. Allocated memory is still 94.4MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 887.28ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 58.1MB in the beginning and 57.4MB in the end (delta: 664.6kB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.71ms. Allocated memory is still 113.2MB. Free memory was 57.4MB in the beginning and 51.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.56ms. Allocated memory is still 113.2MB. Free memory was 51.7MB in the beginning and 46.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1242.69ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 46.4MB in the beginning and 105.0MB in the end (delta: -58.6MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * TraceAbstraction took 52516.94ms. Allocated memory was 144.7MB in the beginning and 773.8MB in the end (delta: 629.1MB). Free memory was 104.0MB in the beginning and 441.7MB in the end (delta: -337.7MB). Peak memory consumption was 484.4MB. Max. memory is 16.1GB. * Witness Printer took 176.63ms. Allocated memory is still 773.8MB. Free memory was 441.7MB in the beginning and 422.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 164 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.4s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2902 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2799 mSDsluCounter, 19795 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 14777 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2008 IncrementalHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 5018 mSDtfsCounter, 2008 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3038 GetRequests, 2742 SyntacticMatches, 8 SemanticMatches, 288 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=13, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 3470 PreInvPairs, 3685 NumberOfFragments, 1942 HoareAnnotationTreeSize, 3470 FomulaSimplifications, 377649 FormulaSimplificationTreeSizeReduction, 15.3s HoareSimplificationTime, 81 FomulaSimplificationsInter, 268966 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 4605 NumberOfCodeBlocks, 4503 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4671 ConstructedInterpolants, 8 QuantifiedInterpolants, 9786 SizeOfPredicates, 86 NumberOfNonLiveVariables, 27912 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 42 InterpolantComputations, 23 PerfectInterpolantSequences, 1329/1543 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: (!(ldv_urb_state == 0) || ((ldv_coherent_state == 1 && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1) - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3793]: Loop Invariant [2022-07-22 22:38:33,082 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:33,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:33,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:33,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) || (((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: (((!(ldv_urb_state == 0) || ((((addr == 0 && 1 <= ldv_coherent_state) && addr == 0) && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1)) || ((ldv_coherent_state == 0 && addr == addr) && addr == addr)) && (((!((addr + addr) % 18446744073709551616 == 0) || !(ldv_urb_state == 0)) || !(0 == res_kbtab_probe_3)) || !(\old(ldv_coherent_state) == 1)) - InvariantResult [Line: 3875]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4129]: Loop Invariant [2022-07-22 22:38:33,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:33,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:33,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:33,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) - InvariantResult [Line: 4124]: Loop Invariant [2022-07-22 22:38:33,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:33,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:33,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:33,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:33,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:33,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 22:38:33,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:38:33,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0)) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) || (((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) && 0 == \result) - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ((!(1 == \old(ldv_urb_state)) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3)) || (ldv_urb_state == 0 && !((urb + urb) % 18446744073709551616 == 0)) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 1 || !(1 == \old(ldv_urb_state))) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) RESULT: Ultimate proved your program to be correct! [2022-07-22 22:38:33,148 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE