./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 173e3943 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.1-dev-173e394 [2021-11-06 12:00:17,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 12:00:17,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 12:00:17,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 12:00:17,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 12:00:17,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 12:00:17,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 12:00:17,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 12:00:17,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 12:00:17,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 12:00:17,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 12:00:17,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 12:00:17,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 12:00:17,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 12:00:17,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 12:00:17,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 12:00:17,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 12:00:17,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 12:00:17,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 12:00:17,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 12:00:17,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 12:00:17,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 12:00:17,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 12:00:17,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 12:00:17,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 12:00:17,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 12:00:17,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 12:00:17,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 12:00:17,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 12:00:17,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 12:00:17,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 12:00:17,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 12:00:17,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 12:00:17,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 12:00:17,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 12:00:17,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 12:00:17,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 12:00:17,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 12:00:17,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 12:00:17,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 12:00:17,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 12:00:17,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 12:00:17,777 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 12:00:17,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 12:00:17,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 12:00:17,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 12:00:17,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 12:00:17,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 12:00:17,780 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 12:00:17,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 12:00:17,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 12:00:17,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 12:00:17,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 12:00:17,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 12:00:17,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 12:00:17,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 12:00:17,781 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 12:00:17,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 12:00:17,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 12:00:17,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 12:00:17,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 12:00:17,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:00:17,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 12:00:17,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 12:00:17,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 12:00:17,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 12:00:17,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 12:00:17,783 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 12:00:17,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 12:00:17,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 12:00:17,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 12:00:17,784 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 [2021-11-06 12:00:17,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 12:00:18,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 12:00:18,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 12:00:18,011 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 12:00:18,011 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 12:00:18,012 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 [2021-11-06 12:00:18,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954983f89/56fbe5777c0d48189eabe5daa8167f5e/FLAG1bb9065fc [2021-11-06 12:00:18,580 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 12:00:18,581 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 [2021-11-06 12:00:18,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954983f89/56fbe5777c0d48189eabe5daa8167f5e/FLAG1bb9065fc [2021-11-06 12:00:18,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954983f89/56fbe5777c0d48189eabe5daa8167f5e [2021-11-06 12:00:18,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 12:00:18,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 12:00:18,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 12:00:18,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 12:00:18,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 12:00:18,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:00:18" (1/1) ... [2021-11-06 12:00:18,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160cbf19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:18, skipping insertion in model container [2021-11-06 12:00:18,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:00:18" (1/1) ... [2021-11-06 12:00:18,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 12:00:18,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 12:00:19,355 WARN L228 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] [2021-11-06 12:00:19,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:00:19,406 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 12:00:19,519 WARN L228 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] [2021-11-06 12:00:19,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:00:19,560 INFO L208 MainTranslator]: Completed translation [2021-11-06 12:00:19,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19 WrapperNode [2021-11-06 12:00:19,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 12:00:19,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 12:00:19,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 12:00:19,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 12:00:19,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 12:00:19,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 12:00:19,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 12:00:19,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 12:00:19,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 12:00:19,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 12:00:19,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 12:00:19,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 12:00:19,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (1/1) ... [2021-11-06 12:00:19,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:00:19,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:00:19,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 12:00:19,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 12:00:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 12:00:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 12:00:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 12:00:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 12:00:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 12:00:19,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 12:00:19,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 12:00:19,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 12:00:19,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 12:00:19,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 12:00:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 12:00:19,984 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:00:20,649 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-11-06 12:00:20,649 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-11-06 12:00:20,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 12:00:20,657 INFO L299 CfgBuilder]: Removed 135 assume(true) statements. [2021-11-06 12:00:20,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:00:20 BoogieIcfgContainer [2021-11-06 12:00:20,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 12:00:20,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 12:00:20,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 12:00:20,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 12:00:20,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:00:18" (1/3) ... [2021-11-06 12:00:20,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c85763f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:00:20, skipping insertion in model container [2021-11-06 12:00:20,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:00:19" (2/3) ... [2021-11-06 12:00:20,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c85763f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:00:20, skipping insertion in model container [2021-11-06 12:00:20,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:00:20" (3/3) ... [2021-11-06 12:00:20,665 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-11-06 12:00:20,669 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 12:00:20,669 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-06 12:00:20,704 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 12:00:20,710 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 12:00:20,710 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-06 12:00:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 124 states have (on average 1.467741935483871) internal successors, (182), 130 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-06 12:00:20,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:20,742 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:20,742 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1802508012, now seen corresponding path program 1 times [2021-11-06 12:00:20,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:20,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832912239] [2021-11-06 12:00:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:20,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:21,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:21,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832912239] [2021-11-06 12:00:21,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832912239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:21,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:21,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:00:21,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73890438] [2021-11-06 12:00:21,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:00:21,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:00:21,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:21,046 INFO L87 Difference]: Start difference. First operand has 131 states, 124 states have (on average 1.467741935483871) internal successors, (182), 130 states have internal predecessors, (182), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:21,113 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2021-11-06 12:00:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:00:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-06 12:00:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:21,121 INFO L225 Difference]: With dead ends: 360 [2021-11-06 12:00:21,121 INFO L226 Difference]: Without dead ends: 226 [2021-11-06 12:00:21,123 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-06 12:00:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2021-11-06 12:00:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 212 states have (on average 1.2877358490566038) internal successors, (273), 217 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 273 transitions. [2021-11-06 12:00:21,155 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 273 transitions. Word has length 11 [2021-11-06 12:00:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:21,155 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 273 transitions. [2021-11-06 12:00:21,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 273 transitions. [2021-11-06 12:00:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 12:00:21,156 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:21,156 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:21,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 12:00:21,156 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 43172304, now seen corresponding path program 1 times [2021-11-06 12:00:21,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:21,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157282809] [2021-11-06 12:00:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:21,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:21,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:21,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157282809] [2021-11-06 12:00:21,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157282809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:21,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:21,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:00:21,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444761009] [2021-11-06 12:00:21,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:00:21,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:21,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:00:21,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:21,237 INFO L87 Difference]: Start difference. First operand 218 states and 273 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:21,281 INFO L93 Difference]: Finished difference Result 630 states and 792 transitions. [2021-11-06 12:00:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:00:21,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-06 12:00:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:21,283 INFO L225 Difference]: With dead ends: 630 [2021-11-06 12:00:21,285 INFO L226 Difference]: Without dead ends: 418 [2021-11-06 12:00:21,287 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-06 12:00:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 404. [2021-11-06 12:00:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 398 states have (on average 1.2814070351758795) internal successors, (510), 403 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 510 transitions. [2021-11-06 12:00:21,310 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 510 transitions. Word has length 12 [2021-11-06 12:00:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:21,311 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 510 transitions. [2021-11-06 12:00:21,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 510 transitions. [2021-11-06 12:00:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-06 12:00:21,312 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:21,312 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:21,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 12:00:21,313 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash -803172382, now seen corresponding path program 1 times [2021-11-06 12:00:21,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:21,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169722922] [2021-11-06 12:00:21,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:21,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:21,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:21,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169722922] [2021-11-06 12:00:21,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169722922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:21,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:21,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:00:21,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188439811] [2021-11-06 12:00:21,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:00:21,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:00:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:21,398 INFO L87 Difference]: Start difference. First operand 404 states and 510 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:21,423 INFO L93 Difference]: Finished difference Result 835 states and 1069 transitions. [2021-11-06 12:00:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:00:21,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-06 12:00:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:21,425 INFO L225 Difference]: With dead ends: 835 [2021-11-06 12:00:21,425 INFO L226 Difference]: Without dead ends: 439 [2021-11-06 12:00:21,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-06 12:00:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-11-06 12:00:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 433 states have (on average 1.2840646651270209) internal successors, (556), 438 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 556 transitions. [2021-11-06 12:00:21,460 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 556 transitions. Word has length 28 [2021-11-06 12:00:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:21,461 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 556 transitions. [2021-11-06 12:00:21,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 556 transitions. [2021-11-06 12:00:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 12:00:21,462 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:21,462 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:21,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 12:00:21,462 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash 225824829, now seen corresponding path program 1 times [2021-11-06 12:00:21,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:21,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718807805] [2021-11-06 12:00:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:21,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:21,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:21,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718807805] [2021-11-06 12:00:21,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718807805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:21,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:21,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:00:21,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330341506] [2021-11-06 12:00:21,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:00:21,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:00:21,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:00:21,587 INFO L87 Difference]: Start difference. First operand 439 states and 556 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:21,926 INFO L93 Difference]: Finished difference Result 2659 states and 3328 transitions. [2021-11-06 12:00:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 12:00:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-06 12:00:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:21,933 INFO L225 Difference]: With dead ends: 2659 [2021-11-06 12:00:21,933 INFO L226 Difference]: Without dead ends: 2229 [2021-11-06 12:00:21,934 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-06 12:00:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2021-11-06 12:00:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 483. [2021-11-06 12:00:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 477 states have (on average 1.2662473794549267) internal successors, (604), 482 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 604 transitions. [2021-11-06 12:00:21,963 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 604 transitions. Word has length 46 [2021-11-06 12:00:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:21,963 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 604 transitions. [2021-11-06 12:00:21,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 604 transitions. [2021-11-06 12:00:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 12:00:21,965 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:21,965 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:21,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 12:00:21,965 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:21,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash 248457083, now seen corresponding path program 1 times [2021-11-06 12:00:21,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:21,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052157812] [2021-11-06 12:00:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:21,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:22,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:22,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052157812] [2021-11-06 12:00:22,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052157812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:22,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:22,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:00:22,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302803051] [2021-11-06 12:00:22,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:00:22,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:00:22,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:22,039 INFO L87 Difference]: Start difference. First operand 483 states and 604 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:22,254 INFO L93 Difference]: Finished difference Result 2506 states and 3100 transitions. [2021-11-06 12:00:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:00:22,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-06 12:00:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:22,261 INFO L225 Difference]: With dead ends: 2506 [2021-11-06 12:00:22,261 INFO L226 Difference]: Without dead ends: 2257 [2021-11-06 12:00:22,262 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:00:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2021-11-06 12:00:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 495. [2021-11-06 12:00:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 489 states have (on average 1.2597137014314927) internal successors, (616), 494 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 616 transitions. [2021-11-06 12:00:22,301 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 616 transitions. Word has length 46 [2021-11-06 12:00:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:22,301 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 616 transitions. [2021-11-06 12:00:22,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 616 transitions. [2021-11-06 12:00:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 12:00:22,303 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:22,303 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:22,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 12:00:22,303 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1031406595, now seen corresponding path program 1 times [2021-11-06 12:00:22,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:22,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966008676] [2021-11-06 12:00:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:22,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:22,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:22,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966008676] [2021-11-06 12:00:22,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966008676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:22,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:22,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:00:22,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109620737] [2021-11-06 12:00:22,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:00:22,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:00:22,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:00:22,394 INFO L87 Difference]: Start difference. First operand 495 states and 616 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:22,669 INFO L93 Difference]: Finished difference Result 2611 states and 3230 transitions. [2021-11-06 12:00:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 12:00:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-06 12:00:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:22,678 INFO L225 Difference]: With dead ends: 2611 [2021-11-06 12:00:22,678 INFO L226 Difference]: Without dead ends: 2125 [2021-11-06 12:00:22,679 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-06 12:00:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2021-11-06 12:00:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 493. [2021-11-06 12:00:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 487 states have (on average 1.2525667351129364) internal successors, (610), 492 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 610 transitions. [2021-11-06 12:00:22,722 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 610 transitions. Word has length 46 [2021-11-06 12:00:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:22,723 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 610 transitions. [2021-11-06 12:00:22,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 610 transitions. [2021-11-06 12:00:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 12:00:22,727 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:22,727 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:22,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 12:00:22,727 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:22,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2143426174, now seen corresponding path program 1 times [2021-11-06 12:00:22,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:22,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028001018] [2021-11-06 12:00:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:22,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:22,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:22,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028001018] [2021-11-06 12:00:22,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028001018] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:22,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:22,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:00:22,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362254390] [2021-11-06 12:00:22,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:00:22,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:00:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:22,824 INFO L87 Difference]: Start difference. First operand 493 states and 610 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:23,081 INFO L93 Difference]: Finished difference Result 2570 states and 3159 transitions. [2021-11-06 12:00:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:00:23,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 12:00:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:23,088 INFO L225 Difference]: With dead ends: 2570 [2021-11-06 12:00:23,088 INFO L226 Difference]: Without dead ends: 2316 [2021-11-06 12:00:23,089 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:00:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2021-11-06 12:00:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 505. [2021-11-06 12:00:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 499 states have (on average 1.2464929859719438) internal successors, (622), 504 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 622 transitions. [2021-11-06 12:00:23,155 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 622 transitions. Word has length 51 [2021-11-06 12:00:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:23,156 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 622 transitions. [2021-11-06 12:00:23,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 622 transitions. [2021-11-06 12:00:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 12:00:23,157 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:23,158 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:23,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 12:00:23,158 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1471482752, now seen corresponding path program 1 times [2021-11-06 12:00:23,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:23,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66695715] [2021-11-06 12:00:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:23,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:23,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:23,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66695715] [2021-11-06 12:00:23,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66695715] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:23,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:23,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:00:23,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935830087] [2021-11-06 12:00:23,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:00:23,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:00:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:23,248 INFO L87 Difference]: Start difference. First operand 505 states and 622 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:23,309 INFO L93 Difference]: Finished difference Result 1054 states and 1298 transitions. [2021-11-06 12:00:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:00:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 12:00:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:23,311 INFO L225 Difference]: With dead ends: 1054 [2021-11-06 12:00:23,311 INFO L226 Difference]: Without dead ends: 558 [2021-11-06 12:00:23,312 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-11-06 12:00:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 346. [2021-11-06 12:00:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 340 states have (on average 1.2352941176470589) internal successors, (420), 345 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 420 transitions. [2021-11-06 12:00:23,338 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 420 transitions. Word has length 51 [2021-11-06 12:00:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:23,338 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 420 transitions. [2021-11-06 12:00:23,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 420 transitions. [2021-11-06 12:00:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 12:00:23,339 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:23,339 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:23,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 12:00:23,339 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:23,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -934513600, now seen corresponding path program 1 times [2021-11-06 12:00:23,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:23,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267176262] [2021-11-06 12:00:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:23,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:23,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:23,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267176262] [2021-11-06 12:00:23,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267176262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:23,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:23,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:00:23,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934717313] [2021-11-06 12:00:23,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:00:23,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:23,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:00:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:23,417 INFO L87 Difference]: Start difference. First operand 346 states and 420 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:23,532 INFO L93 Difference]: Finished difference Result 615 states and 744 transitions. [2021-11-06 12:00:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:00:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 12:00:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:23,535 INFO L225 Difference]: With dead ends: 615 [2021-11-06 12:00:23,535 INFO L226 Difference]: Without dead ends: 611 [2021-11-06 12:00:23,536 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-11-06 12:00:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2021-11-06 12:00:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 580 states have (on average 1.2379310344827585) internal successors, (718), 585 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 718 transitions. [2021-11-06 12:00:23,604 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 718 transitions. Word has length 51 [2021-11-06 12:00:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:23,605 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 718 transitions. [2021-11-06 12:00:23,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 718 transitions. [2021-11-06 12:00:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:00:23,606 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:23,606 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 12:00:23,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 12:00:23,607 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash 259265857, now seen corresponding path program 1 times [2021-11-06 12:00:23,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:23,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589631587] [2021-11-06 12:00:23,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:23,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:23,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:23,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589631587] [2021-11-06 12:00:23,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589631587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:23,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:23,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:00:23,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14208328] [2021-11-06 12:00:23,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:00:23,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:00:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:23,678 INFO L87 Difference]: Start difference. First operand 586 states and 718 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:23,797 INFO L93 Difference]: Finished difference Result 1203 states and 1465 transitions. [2021-11-06 12:00:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:00:23,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-06 12:00:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:23,800 INFO L225 Difference]: With dead ends: 1203 [2021-11-06 12:00:23,800 INFO L226 Difference]: Without dead ends: 605 [2021-11-06 12:00:23,801 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:00:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-11-06 12:00:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 541. [2021-11-06 12:00:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 535 states have (on average 1.2411214953271028) internal successors, (664), 540 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 664 transitions. [2021-11-06 12:00:23,872 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 664 transitions. Word has length 52 [2021-11-06 12:00:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:23,873 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 664 transitions. [2021-11-06 12:00:23,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 664 transitions. [2021-11-06 12:00:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 12:00:23,873 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:23,873 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:23,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 12:00:23,874 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -489258623, now seen corresponding path program 1 times [2021-11-06 12:00:23,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:23,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78747168] [2021-11-06 12:00:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:23,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:23,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:23,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78747168] [2021-11-06 12:00:23,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78747168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:23,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:23,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:00:23,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250115507] [2021-11-06 12:00:23,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:00:23,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:00:23,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:00:23,943 INFO L87 Difference]: Start difference. First operand 541 states and 664 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:24,129 INFO L93 Difference]: Finished difference Result 1578 states and 1914 transitions. [2021-11-06 12:00:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 12:00:24,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-06 12:00:24,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:24,132 INFO L225 Difference]: With dead ends: 1578 [2021-11-06 12:00:24,133 INFO L226 Difference]: Without dead ends: 1071 [2021-11-06 12:00:24,133 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-06 12:00:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-11-06 12:00:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 539. [2021-11-06 12:00:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 533 states have (on average 1.2345215759849906) internal successors, (658), 538 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 658 transitions. [2021-11-06 12:00:24,192 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 658 transitions. Word has length 58 [2021-11-06 12:00:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:24,192 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 658 transitions. [2021-11-06 12:00:24,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 658 transitions. [2021-11-06 12:00:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 12:00:24,193 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:24,193 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:24,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 12:00:24,193 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:24,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:24,193 INFO L85 PathProgramCache]: Analyzing trace with hash 123879707, now seen corresponding path program 1 times [2021-11-06 12:00:24,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:24,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013904851] [2021-11-06 12:00:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:24,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:24,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:24,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013904851] [2021-11-06 12:00:24,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013904851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:24,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:24,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:00:24,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394579989] [2021-11-06 12:00:24,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:00:24,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:24,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:00:24,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:24,278 INFO L87 Difference]: Start difference. First operand 539 states and 658 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:24,351 INFO L93 Difference]: Finished difference Result 1073 states and 1300 transitions. [2021-11-06 12:00:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:00:24,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 12:00:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:24,353 INFO L225 Difference]: With dead ends: 1073 [2021-11-06 12:00:24,353 INFO L226 Difference]: Without dead ends: 568 [2021-11-06 12:00:24,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-06 12:00:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 511. [2021-11-06 12:00:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 505 states have (on average 1.2118811881188118) internal successors, (612), 510 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 612 transitions. [2021-11-06 12:00:24,403 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 612 transitions. Word has length 59 [2021-11-06 12:00:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:24,403 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 612 transitions. [2021-11-06 12:00:24,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 612 transitions. [2021-11-06 12:00:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 12:00:24,404 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:24,404 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:24,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 12:00:24,405 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:24,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2029608918, now seen corresponding path program 1 times [2021-11-06 12:00:24,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:24,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120839179] [2021-11-06 12:00:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:24,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:24,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:24,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120839179] [2021-11-06 12:00:24,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120839179] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:24,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:24,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:00:24,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410193455] [2021-11-06 12:00:24,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:00:24,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:00:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:24,536 INFO L87 Difference]: Start difference. First operand 511 states and 612 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:24,618 INFO L93 Difference]: Finished difference Result 1016 states and 1217 transitions. [2021-11-06 12:00:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:00:24,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 12:00:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:24,621 INFO L225 Difference]: With dead ends: 1016 [2021-11-06 12:00:24,621 INFO L226 Difference]: Without dead ends: 511 [2021-11-06 12:00:24,622 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:00:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-11-06 12:00:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2021-11-06 12:00:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 505 states have (on average 1.2099009900990099) internal successors, (611), 510 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 611 transitions. [2021-11-06 12:00:24,679 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 611 transitions. Word has length 61 [2021-11-06 12:00:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:24,679 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 611 transitions. [2021-11-06 12:00:24,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 611 transitions. [2021-11-06 12:00:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 12:00:24,692 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:24,692 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:24,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 12:00:24,692 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2070283668, now seen corresponding path program 1 times [2021-11-06 12:00:24,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:24,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665027725] [2021-11-06 12:00:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:24,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:24,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:24,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665027725] [2021-11-06 12:00:24,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665027725] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:24,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:24,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:00:24,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848046961] [2021-11-06 12:00:24,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:00:24,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:00:24,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:24,794 INFO L87 Difference]: Start difference. First operand 511 states and 611 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:24,947 INFO L93 Difference]: Finished difference Result 1408 states and 1689 transitions. [2021-11-06 12:00:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:00:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 12:00:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:24,950 INFO L225 Difference]: With dead ends: 1408 [2021-11-06 12:00:24,950 INFO L226 Difference]: Without dead ends: 1083 [2021-11-06 12:00:24,951 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-11-06 12:00:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 880. [2021-11-06 12:00:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 874 states have (on average 1.2185354691075514) internal successors, (1065), 879 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1065 transitions. [2021-11-06 12:00:25,027 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1065 transitions. Word has length 61 [2021-11-06 12:00:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:25,028 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1065 transitions. [2021-11-06 12:00:25,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1065 transitions. [2021-11-06 12:00:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 12:00:25,030 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:25,030 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:25,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 12:00:25,031 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:25,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1960369742, now seen corresponding path program 1 times [2021-11-06 12:00:25,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:25,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089660425] [2021-11-06 12:00:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:25,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:25,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:25,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089660425] [2021-11-06 12:00:25,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089660425] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:25,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:25,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:00:25,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024473110] [2021-11-06 12:00:25,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:00:25,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:00:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:25,101 INFO L87 Difference]: Start difference. First operand 880 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:25,157 INFO L93 Difference]: Finished difference Result 1323 states and 1591 transitions. [2021-11-06 12:00:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:00:25,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 12:00:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:25,159 INFO L225 Difference]: With dead ends: 1323 [2021-11-06 12:00:25,159 INFO L226 Difference]: Without dead ends: 520 [2021-11-06 12:00:25,161 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-11-06 12:00:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 499. [2021-11-06 12:00:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 493 states have (on average 1.206896551724138) internal successors, (595), 498 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 595 transitions. [2021-11-06 12:00:25,200 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 595 transitions. Word has length 67 [2021-11-06 12:00:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:25,200 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 595 transitions. [2021-11-06 12:00:25,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 595 transitions. [2021-11-06 12:00:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 12:00:25,201 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:25,201 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:25,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 12:00:25,202 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1965673074, now seen corresponding path program 1 times [2021-11-06 12:00:25,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:25,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829367008] [2021-11-06 12:00:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:25,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:25,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:25,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829367008] [2021-11-06 12:00:25,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829367008] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:25,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:25,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:00:25,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002220063] [2021-11-06 12:00:25,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:00:25,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:25,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:00:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:25,301 INFO L87 Difference]: Start difference. First operand 499 states and 595 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:25,409 INFO L93 Difference]: Finished difference Result 828 states and 984 transitions. [2021-11-06 12:00:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:00:25,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 12:00:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:25,412 INFO L225 Difference]: With dead ends: 828 [2021-11-06 12:00:25,412 INFO L226 Difference]: Without dead ends: 821 [2021-11-06 12:00:25,413 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-11-06 12:00:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 738. [2021-11-06 12:00:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 732 states have (on average 1.215846994535519) internal successors, (890), 737 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 890 transitions. [2021-11-06 12:00:25,470 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 890 transitions. Word has length 67 [2021-11-06 12:00:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:25,470 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 890 transitions. [2021-11-06 12:00:25,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 890 transitions. [2021-11-06 12:00:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-06 12:00:25,471 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:25,471 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:25,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 12:00:25,471 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:25,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash 495831049, now seen corresponding path program 1 times [2021-11-06 12:00:25,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:25,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342820100] [2021-11-06 12:00:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:25,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:25,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:25,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342820100] [2021-11-06 12:00:25,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342820100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:25,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:25,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:00:25,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709526788] [2021-11-06 12:00:25,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:00:25,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:25,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:00:25,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:25,539 INFO L87 Difference]: Start difference. First operand 738 states and 890 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:25,630 INFO L93 Difference]: Finished difference Result 848 states and 1022 transitions. [2021-11-06 12:00:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:00:25,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-11-06 12:00:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:25,633 INFO L225 Difference]: With dead ends: 848 [2021-11-06 12:00:25,633 INFO L226 Difference]: Without dead ends: 839 [2021-11-06 12:00:25,633 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-06 12:00:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 742. [2021-11-06 12:00:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 736 states have (on average 1.2092391304347827) internal successors, (890), 741 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 890 transitions. [2021-11-06 12:00:25,694 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 890 transitions. Word has length 68 [2021-11-06 12:00:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:25,694 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 890 transitions. [2021-11-06 12:00:25,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 890 transitions. [2021-11-06 12:00:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 12:00:25,695 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:25,695 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:25,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 12:00:25,696 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:25,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1259237824, now seen corresponding path program 1 times [2021-11-06 12:00:25,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:25,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831389173] [2021-11-06 12:00:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:25,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:25,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:25,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831389173] [2021-11-06 12:00:25,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831389173] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:00:25,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072190708] [2021-11-06 12:00:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:25,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 12:00:25,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:00:25,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 12:00:25,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 12:00:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:26,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:00:26,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:00:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:26,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072190708] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:26,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 12:00:26,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-06 12:00:26,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504834402] [2021-11-06 12:00:26,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:00:26,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:26,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:00:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:26,179 INFO L87 Difference]: Start difference. First operand 742 states and 890 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:26,222 INFO L93 Difference]: Finished difference Result 1044 states and 1254 transitions. [2021-11-06 12:00:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:00:26,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-06 12:00:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:26,223 INFO L225 Difference]: With dead ends: 1044 [2021-11-06 12:00:26,224 INFO L226 Difference]: Without dead ends: 379 [2021-11-06 12:00:26,224 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-11-06 12:00:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2021-11-06 12:00:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 340 states have (on average 1.1794117647058824) internal successors, (401), 343 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 401 transitions. [2021-11-06 12:00:26,253 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 401 transitions. Word has length 72 [2021-11-06 12:00:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:26,254 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 401 transitions. [2021-11-06 12:00:26,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 401 transitions. [2021-11-06 12:00:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 12:00:26,254 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:26,255 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:26,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 12:00:26,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-06 12:00:26,472 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1340649389, now seen corresponding path program 1 times [2021-11-06 12:00:26,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:26,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624128776] [2021-11-06 12:00:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:26,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:26,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:26,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624128776] [2021-11-06 12:00:26,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624128776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:26,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:26,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:00:26,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044123502] [2021-11-06 12:00:26,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:00:26,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:00:26,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:26,555 INFO L87 Difference]: Start difference. First operand 344 states and 401 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:26,594 INFO L93 Difference]: Finished difference Result 572 states and 667 transitions. [2021-11-06 12:00:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:00:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 12:00:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:26,595 INFO L225 Difference]: With dead ends: 572 [2021-11-06 12:00:26,595 INFO L226 Difference]: Without dead ends: 270 [2021-11-06 12:00:26,596 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:00:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-06 12:00:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-11-06 12:00:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 266 states have (on average 1.150375939849624) internal successors, (306), 269 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 306 transitions. [2021-11-06 12:00:26,628 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 306 transitions. Word has length 81 [2021-11-06 12:00:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:26,629 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 306 transitions. [2021-11-06 12:00:26,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 306 transitions. [2021-11-06 12:00:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-06 12:00:26,629 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:26,630 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:26,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 12:00:26,630 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1965874040, now seen corresponding path program 1 times [2021-11-06 12:00:26,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:26,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785414662] [2021-11-06 12:00:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:26,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:26,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:26,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785414662] [2021-11-06 12:00:26,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785414662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:26,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:26,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:00:26,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820528772] [2021-11-06 12:00:26,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:00:26,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:26,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:00:26,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:26,812 INFO L87 Difference]: Start difference. First operand 270 states and 306 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:26,872 INFO L93 Difference]: Finished difference Result 272 states and 307 transitions. [2021-11-06 12:00:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:00:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-06 12:00:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:26,874 INFO L225 Difference]: With dead ends: 272 [2021-11-06 12:00:26,874 INFO L226 Difference]: Without dead ends: 222 [2021-11-06 12:00:26,874 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:00:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-06 12:00:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2021-11-06 12:00:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.1240875912408759) internal successors, (154), 137 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2021-11-06 12:00:26,888 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 83 [2021-11-06 12:00:26,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:26,889 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2021-11-06 12:00:26,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2021-11-06 12:00:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 12:00:26,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:00:26,889 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 12:00:26,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 12:00:26,890 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 12:00:26,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:00:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2143833696, now seen corresponding path program 1 times [2021-11-06 12:00:26,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:00:26,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578409094] [2021-11-06 12:00:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:00:26,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:00:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:00:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:00:26,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:00:26,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578409094] [2021-11-06 12:00:26,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578409094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:00:26,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:00:26,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:00:26,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070648383] [2021-11-06 12:00:26,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:00:26,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:00:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:00:26,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:00:26,956 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:00:27,012 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2021-11-06 12:00:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:00:27,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-06 12:00:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:00:27,013 INFO L225 Difference]: With dead ends: 138 [2021-11-06 12:00:27,013 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 12:00:27,013 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:00:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 12:00:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 12:00:27,014 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) [2021-11-06 12:00:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 12:00:27,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-11-06 12:00:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:00:27,014 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 12:00:27,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:00:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 12:00:27,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 12:00:27,016 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:00:27,016 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:00:27,017 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:00:27,017 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:00:27,017 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:00:27,017 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:00:27,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 12:00:27,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 12:00:27,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:27,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:28,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:29,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:30,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:30,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:30,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:30,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:30,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:30,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:00:36,278 INFO L853 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-06 12:00:36,278 INFO L857 garLoopResultBuilder]: For program point L4098-1(lines 4097 4116) no Hoare annotation was computed. [2021-11-06 12:00:36,279 INFO L853 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 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.offset ULTIMATE.start_usb_free_coherent_~addr.base))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (< (* 18446744073709551616 .cse5) .cse6) (<= (+ .cse5 1) 0))))) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)))) [2021-11-06 12:00:36,279 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,279 INFO L853 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2021-11-06 12:00:36,279 INFO L853 garLoopResultBuilder]: At program point L4264-1(lines 1 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.offset ULTIMATE.start_usb_free_coherent_~addr.base))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0))))) [2021-11-06 12:00:36,279 INFO L857 garLoopResultBuilder]: For program point L4264(lines 4264 4266) no Hoare annotation was computed. [2021-11-06 12:00:36,279 INFO L857 garLoopResultBuilder]: For program point L4099-1(lines 4097 4116) no Hoare annotation was computed. [2021-11-06 12:00:36,279 INFO L857 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-11-06 12:00:36,279 INFO L857 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-11-06 12:00:36,280 INFO L853 garLoopResultBuilder]: At program point L3439-1(lines 3433 3441) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,280 INFO L853 garLoopResultBuilder]: At program point L3439(lines 3433 3441) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,280 INFO L853 garLoopResultBuilder]: At program point L4233(lines 4008 4011) the Hoare annotation is: (let ((.cse9 (= 0 ~res_kbtab_probe_3~0)) (.cse10 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse3 (not .cse10)) (.cse6 (not .cse9)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse6 (let ((.cse8 (+ ULTIMATE.start_usb_free_coherent_~addr.offset ULTIMATE.start_usb_free_coherent_~addr.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (< (* 18446744073709551616 .cse7) .cse8) (<= (+ .cse7 1) 0))))) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse6) (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse9 .cse2 .cse10 (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1))))) [2021-11-06 12:00:36,280 INFO L857 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-11-06 12:00:36,280 INFO L857 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-11-06 12:00:36,280 INFO L853 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse9 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse4 (not .cse9)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse6 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (< (* 18446744073709551616 .cse5) .cse6) (<= (+ .cse5 1) 0)))) (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse8 (+ ULTIMATE.start_usb_free_coherent_~addr.offset ULTIMATE.start_usb_free_coherent_~addr.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (< (* 18446744073709551616 .cse7) .cse8) (<= (+ .cse7 1) 0))))) (and .cse0 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse1 .cse3 .cse9 (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1))))) [2021-11-06 12:00:36,280 INFO L853 garLoopResultBuilder]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,282 INFO L857 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-11-06 12:00:36,282 INFO L853 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)) [2021-11-06 12:00:36,282 INFO L857 garLoopResultBuilder]: For program point L4203-4(line 4203) no Hoare annotation was computed. [2021-11-06 12:00:36,282 INFO L857 garLoopResultBuilder]: For program point L4203-2(line 4203) no Hoare annotation was computed. [2021-11-06 12:00:36,282 INFO L857 garLoopResultBuilder]: For program point L4203-8(line 4203) no Hoare annotation was computed. [2021-11-06 12:00:36,282 INFO L857 garLoopResultBuilder]: For program point L4203-6(line 4203) no Hoare annotation was computed. [2021-11-06 12:00:36,282 INFO L853 garLoopResultBuilder]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,282 INFO L853 garLoopResultBuilder]: At program point L3411-1(lines 3405 3413) 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 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse1 .cse2 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0) .cse3))) [2021-11-06 12:00:36,283 INFO L853 garLoopResultBuilder]: At program point L3411(lines 3405 3413) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse4 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 (= |ULTIMATE.start___kmalloc_#res.offset| 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= |ULTIMATE.start_kzalloc_#res.base| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.base| 0) .cse4 (= |ULTIMATE.start_kzalloc_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) (and .cse0 (= 0 ~res_kbtab_probe_3~0) (not .cse4) .cse1 .cse2 .cse3))) [2021-11-06 12:00:36,283 INFO L853 garLoopResultBuilder]: At program point L4204-1(lines 4201 4205) 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 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse1 .cse2 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0) .cse3))) [2021-11-06 12:00:36,283 INFO L853 garLoopResultBuilder]: At program point L4204-2(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse4 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= 0 ~res_kbtab_probe_3~0) (not .cse4) .cse1 .cse2 .cse3))) [2021-11-06 12:00:36,283 INFO L853 garLoopResultBuilder]: At program point L4204(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse4 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= 0 ~res_kbtab_probe_3~0) (not .cse4) .cse1 .cse2 .cse3))) [2021-11-06 12:00:36,283 INFO L853 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 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) [2021-11-06 12:00:36,283 INFO L853 garLoopResultBuilder]: At program point L4204-3(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (<= ~ldv_coherent_state~0 1)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) (not .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)))) [2021-11-06 12:00:36,283 INFO L853 garLoopResultBuilder]: At program point L4204-4(lines 4201 4205) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,284 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,285 INFO L857 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-11-06 12:00:36,285 INFO L857 garLoopResultBuilder]: For program point L4106-2(lines 4106 4111) no Hoare annotation was computed. [2021-11-06 12:00:36,285 INFO L857 garLoopResultBuilder]: For program point L4073(line 4073) no Hoare annotation was computed. [2021-11-06 12:00:36,285 INFO L857 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-11-06 12:00:36,285 INFO L853 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 0)) [2021-11-06 12:00:36,285 INFO L853 garLoopResultBuilder]: At program point L4239(lines 4238 4240) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse0 (= ~ldv_coherent_state~0 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) (not .cse1) .cse2 .cse3 .cse4 (not .cse5)) (and .cse5 .cse0 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) .cse2 .cse3 .cse4 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)))) [2021-11-06 12:00:36,285 INFO L853 garLoopResultBuilder]: At program point L4239-1(lines 4238 4240) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse6 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (<= ~ldv_coherent_state~0 1)) (.cse0 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0))) (or (and .cse0 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse1 (= 0 ~res_kbtab_probe_3~0) (not .cse6) .cse2 .cse3 .cse4 .cse5 (not .cse0)))) [2021-11-06 12:00:36,285 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,286 INFO L853 garLoopResultBuilder]: At program point L3513(lines 3512 3514) 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 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse1 .cse2 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0) .cse3))) [2021-11-06 12:00:36,286 INFO L853 garLoopResultBuilder]: At program point L4207(lines 4206 4208) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse4 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.base| 0) .cse4 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= 0 ~res_kbtab_probe_3~0) (not .cse4) .cse1 .cse2 .cse3))) [2021-11-06 12:00:36,286 INFO L853 garLoopResultBuilder]: At program point L4207-1(lines 4206 4208) 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 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse1 .cse2 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0) .cse3))) [2021-11-06 12:00:36,286 INFO L853 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (and (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (<= ~ldv_coherent_state~0 1) (not (= ULTIMATE.start_kbtab_probe_~error~0 0))) [2021-11-06 12:00:36,286 INFO L853 garLoopResultBuilder]: At program point L4174-1(lines 4150 4179) the Hoare annotation is: (and (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,286 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,286 INFO L853 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-11-06 12:00:36,286 INFO L857 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-11-06 12:00:36,287 INFO L857 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-11-06 12:00:36,287 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,287 INFO L853 garLoopResultBuilder]: At program point L4210(lines 4209 4211) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,287 INFO L857 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-11-06 12:00:36,287 INFO L857 garLoopResultBuilder]: For program point L4046(lines 1 4266) no Hoare annotation was computed. [2021-11-06 12:00:36,287 INFO L857 garLoopResultBuilder]: For program point L4046-2(lines 1 4266) no Hoare annotation was computed. [2021-11-06 12:00:36,287 INFO L857 garLoopResultBuilder]: For program point L4046-1(lines 1 4266) no Hoare annotation was computed. [2021-11-06 12:00:36,287 INFO L857 garLoopResultBuilder]: For program point L4046-4(lines 4190 4195) no Hoare annotation was computed. [2021-11-06 12:00:36,288 INFO L857 garLoopResultBuilder]: For program point L4046-3(lines 1 4266) no Hoare annotation was computed. [2021-11-06 12:00:36,288 INFO L853 garLoopResultBuilder]: At program point L4046-5(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-11-06 12:00:36,288 INFO L853 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse7 (<= ~ldv_coherent_state~0 1)) (.cse8 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse12 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)) (.cse9 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse6 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (< (* 18446744073709551616 .cse5) .cse6) (<= (+ .cse5 1) 0)))) .cse7 .cse8 .cse9 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.offset ULTIMATE.start_usb_free_coherent_~addr.base))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))) (and (<= 1 ~ldv_urb_state~0) .cse0 .cse1 (not (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) .cse3 (not .cse8) .cse4 .cse7 (<= ~ldv_urb_state~0 1) (not .cse12) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0))) (and (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse12 .cse9))) [2021-11-06 12:00:36,288 INFO L857 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-11-06 12:00:36,288 INFO L857 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-11-06 12:00:36,288 INFO L857 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-11-06 12:00:36,288 INFO L853 garLoopResultBuilder]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,288 INFO L853 garLoopResultBuilder]: At program point L4214(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,288 INFO L853 garLoopResultBuilder]: At program point L4214-1(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,289 INFO L853 garLoopResultBuilder]: At program point L4214-2(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,289 INFO L857 garLoopResultBuilder]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,289 INFO L857 garLoopResultBuilder]: For program point L4049(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,289 INFO L857 garLoopResultBuilder]: For program point L4049-3(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,289 INFO L857 garLoopResultBuilder]: For program point L4049-2(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,289 INFO L857 garLoopResultBuilder]: For program point L4049-5(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,290 INFO L857 garLoopResultBuilder]: For program point L4049-4(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,290 INFO L857 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-11-06 12:00:36,290 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-06 12:00:36,290 INFO L853 garLoopResultBuilder]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (not (= ULTIMATE.start_kbtab_probe_~error~0 0))) [2021-11-06 12:00:36,290 INFO L857 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-11-06 12:00:36,290 INFO L857 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-11-06 12:00:36,290 INFO L853 garLoopResultBuilder]: At program point L4117-1(lines 4093 4122) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.offset ULTIMATE.start_usb_free_coherent_~addr.base))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0))))) [2021-11-06 12:00:36,290 INFO L853 garLoopResultBuilder]: At program point L4117(lines 4093 4122) 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 0)) (.cse3 (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.offset ULTIMATE.start_usb_free_coherent_~addr.base))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0)))))) (or (and .cse0 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse3) (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse3))) [2021-11-06 12:00:36,290 INFO L857 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-11-06 12:00:36,291 INFO L857 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-11-06 12:00:36,291 INFO L857 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-11-06 12:00:36,291 INFO L857 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-11-06 12:00:36,291 INFO L853 garLoopResultBuilder]: At program point L4250(lines 4184 4189) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-06 12:00:36,291 INFO L857 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-11-06 12:00:36,291 INFO L857 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-11-06 12:00:36,291 INFO L857 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-11-06 12:00:36,291 INFO L853 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1) (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_init_~retval~1) (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0))))) [2021-11-06 12:00:36,291 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-06 12:00:36,292 INFO L853 garLoopResultBuilder]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (not (= ULTIMATE.start_kbtab_probe_~error~0 0))) [2021-11-06 12:00:36,292 INFO L853 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 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.offset ULTIMATE.start_usb_free_coherent_~addr.base))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (< (* 18446744073709551616 .cse5) .cse6) (<= (+ .cse5 1) 0))))) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)))) [2021-11-06 12:00:36,292 INFO L853 garLoopResultBuilder]: At program point L4154-2loopEntry(lines 4154 4173) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,292 INFO L853 garLoopResultBuilder]: At program point L3923(lines 3909 3925) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) .cse1 (or (< 0 ULTIMATE.start_kbtab_init_~retval~1) (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0))) (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1))) [2021-11-06 12:00:36,292 INFO L853 garLoopResultBuilder]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,292 INFO L853 garLoopResultBuilder]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,292 INFO L857 garLoopResultBuilder]: For program point L4155-1(lines 4154 4173) no Hoare annotation was computed. [2021-11-06 12:00:36,292 INFO L857 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-11-06 12:00:36,293 INFO L853 garLoopResultBuilder]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse8 (= ~ldv_coherent_state~0 0)) (.cse9 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse10 (= |ULTIMATE.start_usb_alloc_coherent_#res.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0)) (.cse5 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base 0)) (.cse11 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0))) (or (and (<= 1 ~ldv_coherent_state~0) .cse0 (not .cse1) (not .cse2) .cse3 .cse4 .cse5 (<= ~ldv_coherent_state~0 1) (not .cse6) (not .cse7)) (and .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse3 .cse4 .cse1 .cse5 .cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse11) (and .cse7 .cse8 .cse9 .cse10 .cse0 .cse3 .cse4 .cse1 .cse5 (let ((.cse13 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse12 (div .cse13 18446744073709551616))) (or (< (* 18446744073709551616 .cse12) .cse13) (<= (+ .cse12 1) 0)))) .cse2 .cse11) (and .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) .cse3 .cse4 .cse1 .cse5 .cse2 .cse6 .cse11))) [2021-11-06 12:00:36,293 INFO L857 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-11-06 12:00:36,293 INFO L857 garLoopResultBuilder]: For program point L4156-1(lines 4154 4173) no Hoare annotation was computed. [2021-11-06 12:00:36,293 INFO L853 garLoopResultBuilder]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,293 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-06 12:00:36,293 INFO L860 garLoopResultBuilder]: At program point L4058(lines 4058 4059) the Hoare annotation is: true [2021-11-06 12:00:36,293 INFO L860 garLoopResultBuilder]: At program point L4058-2(lines 4058 4059) the Hoare annotation is: true [2021-11-06 12:00:36,293 INFO L860 garLoopResultBuilder]: At program point L4058-1(lines 4058 4059) the Hoare annotation is: true [2021-11-06 12:00:36,293 INFO L860 garLoopResultBuilder]: At program point L4058-3(lines 4058 4059) the Hoare annotation is: true [2021-11-06 12:00:36,294 INFO L853 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2021-11-06 12:00:36,294 INFO L853 garLoopResultBuilder]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,294 INFO L853 garLoopResultBuilder]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,294 INFO L857 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-11-06 12:00:36,294 INFO L853 garLoopResultBuilder]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (and (= ~ldv_coherent_state~0 0) .cse0 (= ~ldv_urb_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2021-11-06 12:00:36,294 INFO L853 garLoopResultBuilder]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (and (= ~ldv_coherent_state~0 0) .cse0 (= ~ldv_urb_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2021-11-06 12:00:36,294 INFO L853 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (<= ~ldv_coherent_state~0 1))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) .cse5 (not (= ULTIMATE.start_kbtab_probe_~error~0 0))) (and (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)))) [2021-11-06 12:00:36,294 INFO L853 garLoopResultBuilder]: At program point L3401-1(lines 3394 3403) 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 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse1 .cse2 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0) .cse3))) [2021-11-06 12:00:36,295 INFO L853 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse4 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and .cse0 (= |ULTIMATE.start___kmalloc_#res.offset| 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.base| 0) .cse4 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) (and .cse0 (= 0 ~res_kbtab_probe_3~0) (not .cse4) .cse1 .cse2 .cse3))) [2021-11-06 12:00:36,295 INFO L853 garLoopResultBuilder]: At program point L4227(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,295 INFO L853 garLoopResultBuilder]: At program point L4227-1(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,295 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-06 12:00:36,295 INFO L853 garLoopResultBuilder]: At program point L4227-2(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1)) [2021-11-06 12:00:36,295 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-06 12:00:36,295 INFO L853 garLoopResultBuilder]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (not (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (= ~ldv_urb_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0))) [2021-11-06 12:00:36,295 INFO L857 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-11-06 12:00:36,296 INFO L857 garLoopResultBuilder]: For program point L4130(line 4130) no Hoare annotation was computed. [2021-11-06 12:00:36,296 INFO L857 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-11-06 12:00:36,296 INFO L853 garLoopResultBuilder]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (<= ~ldv_coherent_state~0 1))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) .cse5 (not (= ULTIMATE.start_kbtab_probe_~error~0 0))) (and (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)))) [2021-11-06 12:00:36,296 INFO L857 garLoopResultBuilder]: For program point L4163-2(lines 4163 4168) no Hoare annotation was computed. [2021-11-06 12:00:36,296 INFO L853 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (and (= ~ldv_coherent_state~0 0) .cse0 (= ~ldv_urb_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2021-11-06 12:00:36,296 INFO L853 garLoopResultBuilder]: At program point L4097-2loopEntry(lines 4097 4116) the Hoare annotation is: (and (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,297 INFO L853 garLoopResultBuilder]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) [2021-11-06 12:00:36,297 INFO L857 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-11-06 12:00:36,299 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:00:36,300 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 12:00:36,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:00:36 BoogieIcfgContainer [2021-11-06 12:00:36,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 12:00:36,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 12:00:36,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 12:00:36,341 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 12:00:36,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:00:20" (3/4) ... [2021-11-06 12:00:36,344 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-06 12:00:36,361 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2021-11-06 12:00:36,362 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2021-11-06 12:00:36,363 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-06 12:00:36,364 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-06 12:00:36,365 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 12:00:36,389 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0 && (1 <= \result || \result + 1 <= 0)) && ldv_urb_state == 0) && (0 < retval || retval + 1 <= 0)) || ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) [2021-11-06 12:00:36,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-11-06 12:00:36,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-11-06 12:00:36,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-11-06 12:00:36,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) [2021-11-06 12:00:36,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && \result == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) [2021-11-06 12:00:36,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_coherent_state == 0 && \result == 0) && \result == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) [2021-11-06 12:00:36,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_coherent_state == 0 && \result == 0) && \result == 0) && \result == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) [2021-11-06 12:00:36,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver [2021-11-06 12:00:36,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) [2021-11-06 12:00:36,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) [2021-11-06 12:00:36,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && !(error == 0)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0)) || ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) [2021-11-06 12:00:36,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && !(\result == 0)) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && !(arbitrary_memory == 0)) && !(\result == 0)) || (((((((((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && arbitrary_memory == 0) && \result == 0)) || (((((((((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && error + 12 <= 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && \result == 0)) || (((((((((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && arbitrary_memory == 0) && \result == 0) [2021-11-06 12:00:36,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && !(error == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && !(0 == res_kbtab_probe_3))) || ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) [2021-11-06 12:00:36,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) [2021-11-06 12:00:36,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && !(\result == 0)) || (((((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) [2021-11-06 12:00:36,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && !(\result == 0) [2021-11-06 12:00:36,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_coherent_state <= 1) && \result == 0) && \result == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && !(arbitrary_memory == 0)) && !(\result == 0))) || ((((((((arbitrary_memory == 0 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && \result == 0) && arbitrary_memory == 0) && \result == 0) [2021-11-06 12:00:36,395 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) || ((((((1 <= ldv_coherent_state && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && \result == 0) && \result == 0) [2021-11-06 12:00:36,395 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && \result == 0) && \result == 0) || (((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && !(\result == 0)) [2021-11-06 12:00:36,501 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-06 12:00:36,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 12:00:36,502 INFO L168 Benchmark]: Toolchain (without parser) took 17659.71 ms. Allocated memory was 125.8 MB in the beginning and 604.0 MB in the end (delta: 478.2 MB). Free memory was 92.4 MB in the beginning and 485.3 MB in the end (delta: -392.9 MB). Peak memory consumption was 85.7 MB. Max. memory is 16.1 GB. [2021-11-06 12:00:36,502 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 96.5 MB. Free memory is still 56.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:00:36,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.91 ms. Allocated memory is still 125.8 MB. Free memory was 92.4 MB in the beginning and 82.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 48.6 MB. Max. memory is 16.1 GB. [2021-11-06 12:00:36,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.86 ms. Allocated memory is still 125.8 MB. Free memory was 82.9 MB in the beginning and 76.7 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-06 12:00:36,503 INFO L168 Benchmark]: Boogie Preprocessor took 87.90 ms. Allocated memory is still 125.8 MB. Free memory was 76.7 MB in the beginning and 71.0 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-06 12:00:36,503 INFO L168 Benchmark]: RCFGBuilder took 914.11 ms. Allocated memory was 125.8 MB in the beginning and 178.3 MB in the end (delta: 52.4 MB). Free memory was 71.0 MB in the beginning and 89.6 MB in the end (delta: -18.6 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. [2021-11-06 12:00:36,504 INFO L168 Benchmark]: TraceAbstraction took 15681.45 ms. Allocated memory was 178.3 MB in the beginning and 604.0 MB in the end (delta: 425.7 MB). Free memory was 88.6 MB in the beginning and 548.7 MB in the end (delta: -460.1 MB). Peak memory consumption was 319.9 MB. Max. memory is 16.1 GB. [2021-11-06 12:00:36,504 INFO L168 Benchmark]: Witness Printer took 159.95 ms. Allocated memory is still 604.0 MB. Free memory was 548.7 MB in the beginning and 485.3 MB in the end (delta: 63.4 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.1 GB. [2021-11-06 12:00:36,505 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.16 ms. Allocated memory is still 96.5 MB. Free memory is still 56.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 718.91 ms. Allocated memory is still 125.8 MB. Free memory was 92.4 MB in the beginning and 82.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 48.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.86 ms. Allocated memory is still 125.8 MB. Free memory was 82.9 MB in the beginning and 76.7 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 87.90 ms. Allocated memory is still 125.8 MB. Free memory was 76.7 MB in the beginning and 71.0 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 914.11 ms. Allocated memory was 125.8 MB in the beginning and 178.3 MB in the end (delta: 52.4 MB). Free memory was 71.0 MB in the beginning and 89.6 MB in the end (delta: -18.6 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15681.45 ms. Allocated memory was 178.3 MB in the beginning and 604.0 MB in the end (delta: 425.7 MB). Free memory was 88.6 MB in the beginning and 548.7 MB in the end (delta: -460.1 MB). Peak memory consumption was 319.9 MB. Max. memory is 16.1 GB. * Witness Printer took 159.95 ms. Allocated memory is still 604.0 MB. Free memory was 548.7 MB in the beginning and 485.3 MB in the end (delta: 63.4 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.1 GB. * 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 - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4583 SDtfs, 5585 SDslu, 9173 SDs, 0 SdLazy, 748 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=880occurred in iteration=14, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 8386 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 207 NumberOfFragments, 2556 HoareAnnotationTreeSize, 68 FomulaSimplifications, 587755580 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 68 FomulaSimplificationsInter, 2953730 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1220 ConstructedInterpolants, 0 QuantifiedInterpolants, 2527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 13/16 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 6 specifications checked. All of them hold - InvariantResult [Line: 3782]: 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) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && !(error == 0)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0)) || ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) - InvariantResult [Line: 3433]: Loop Invariant Derived loop invariant: ((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((((((((ldv_coherent_state == 0 && \result == 0) && \result == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) || ((((((1 <= ldv_coherent_state && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && \result == 0) && \result == 0) - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && !(\result == 0)) || (((((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_coherent_state <= 1) && !(error == 0)) || ((((((arbitrary_memory == 0 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && arbitrary_memory == 0) - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4184]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: (((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_coherent_state <= 1) && !(error == 0)) || ((((((arbitrary_memory == 0 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && arbitrary_memory == 0) - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - 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: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 4206]: 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) || (((((ldv_coherent_state == 0 && kbtab == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) && error + 12 <= 0) - InvariantResult [Line: 3405]: Loop Invariant Derived loop invariant: (((((((((((ldv_coherent_state == 0 && \result == 0) && \result == 0) && \result == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 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: 4093]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && arbitrary_memory == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && !(error == 0)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 3405]: 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) || (((((ldv_coherent_state == 0 && kbtab == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) && error + 12 <= 0) - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && !(error == 0) - 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: 4201]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 3433]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && (0 < retval || retval + 1 <= 0)) - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) || (((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 Derived loop invariant: ((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && !(\result == 0) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && \result == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) || (((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 4008]: Loop Invariant Derived loop invariant: ((((((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && !(error == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && !(0 == res_kbtab_probe_3))) || ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) - InvariantResult [Line: 4124]: Loop Invariant Derived loop invariant: ((((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_coherent_state <= 1) && \result == 0) && \result == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && !(arbitrary_memory == 0)) && !(\result == 0))) || ((((((((arbitrary_memory == 0 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && \result == 0) && arbitrary_memory == 0) && \result == 0) - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && \result == 0) && \result == 0) || (((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && !(\result == 0)) - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && !(error == 0) - InvariantResult [Line: 4219]: 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) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && !(error == 0)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: (((((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && !(\result == 0)) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && !(arbitrary_memory == 0)) && !(\result == 0)) || (((((((((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && arbitrary_memory == 0) && \result == 0)) || (((((((((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && error + 12 <= 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && \result == 0)) || (((((((((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && arbitrary_memory == 0) && \result == 0) - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 3394]: 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) || (((((ldv_coherent_state == 0 && kbtab == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) && error + 12 <= 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 3909]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && (1 <= \result || \result + 1 <= 0)) && ldv_urb_state == 0) && (0 < retval || retval + 1 <= 0)) || ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3793]: 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) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && !(error == 0)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: ((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_coherent_state <= 1) && !(error == 0) - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver - InvariantResult [Line: 4201]: 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) || (((((ldv_coherent_state == 0 && kbtab == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) && error + 12 <= 0) - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: (((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1 - 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) || (((((ldv_coherent_state == 0 && kbtab == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) && error + 12 <= 0) RESULT: Ultimate proved your program to be correct! [2021-11-06 12:00:36,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE