./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 bfd0d9ac 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 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-bfd0d9a [2021-11-01 11:20:14,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-01 11:20:14,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-01 11:20:14,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-01 11:20:14,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-01 11:20:14,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-01 11:20:14,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-01 11:20:14,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-01 11:20:14,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-01 11:20:14,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-01 11:20:14,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-01 11:20:14,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-01 11:20:14,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-01 11:20:14,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-01 11:20:14,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-01 11:20:14,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-01 11:20:14,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-01 11:20:14,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-01 11:20:14,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-01 11:20:14,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-01 11:20:14,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-01 11:20:14,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-01 11:20:14,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-01 11:20:14,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-01 11:20:14,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-01 11:20:14,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-01 11:20:14,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-01 11:20:14,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-01 11:20:14,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-01 11:20:14,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-01 11:20:14,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-01 11:20:14,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-01 11:20:14,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-01 11:20:14,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-01 11:20:14,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-01 11:20:14,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-01 11:20:14,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-01 11:20:14,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-01 11:20:14,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-01 11:20:14,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-01 11:20:14,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-01 11:20:14,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-01 11:20:14,891 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-01 11:20:14,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-01 11:20:14,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-01 11:20:14,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-01 11:20:14,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-01 11:20:14,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-01 11:20:14,894 INFO L138 SettingsManager]: * Use SBE=true [2021-11-01 11:20:14,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-01 11:20:14,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-01 11:20:14,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-01 11:20:14,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-01 11:20:14,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-01 11:20:14,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-01 11:20:14,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-01 11:20:14,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-01 11:20:14,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-01 11:20:14,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-01 11:20:14,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-01 11:20:14,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-01 11:20:14,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 11:20:14,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-01 11:20:14,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-01 11:20:14,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-01 11:20:14,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-01 11:20:14,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-01 11:20:14,898 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-01 11:20:14,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-01 11:20:14,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-01 11:20:14,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-01 11:20:14,899 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-01 11:20:15,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-01 11:20:15,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-01 11:20:15,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-01 11:20:15,154 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-01 11:20:15,155 INFO L275 PluginConnector]: CDTParser initialized [2021-11-01 11:20:15,156 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-01 11:20:15,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184603c69/456d0103ffc04cb292b65efd9ef6cf90/FLAG5372e816d [2021-11-01 11:20:15,843 INFO L306 CDTParser]: Found 1 translation units. [2021-11-01 11:20:15,845 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-01 11:20:15,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184603c69/456d0103ffc04cb292b65efd9ef6cf90/FLAG5372e816d [2021-11-01 11:20:16,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184603c69/456d0103ffc04cb292b65efd9ef6cf90 [2021-11-01 11:20:16,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-01 11:20:16,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-01 11:20:16,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-01 11:20:16,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-01 11:20:16,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-01 11:20:16,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 11:20:16" (1/1) ... [2021-11-01 11:20:16,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b1a697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:16, skipping insertion in model container [2021-11-01 11:20:16,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 11:20:16" (1/1) ... [2021-11-01 11:20:16,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-01 11:20:16,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-01 11:20:16,818 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-01 11:20:16,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 11:20:16,896 INFO L203 MainTranslator]: Completed pre-run [2021-11-01 11:20:17,099 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-01 11:20:17,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 11:20:17,144 INFO L208 MainTranslator]: Completed translation [2021-11-01 11:20:17,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17 WrapperNode [2021-11-01 11:20:17,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-01 11:20:17,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-01 11:20:17,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-01 11:20:17,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-01 11:20:17,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-01 11:20:17,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-01 11:20:17,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-01 11:20:17,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-01 11:20:17,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-01 11:20:17,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-01 11:20:17,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-01 11:20:17,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-01 11:20:17,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (1/1) ... [2021-11-01 11:20:17,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 11:20:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 11:20:17,389 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-01 11:20:17,412 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-01 11:20:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-01 11:20:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-01 11:20:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-01 11:20:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-01 11:20:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-01 11:20:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-01 11:20:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-01 11:20:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-01 11:20:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-01 11:20:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-01 11:20:17,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-01 11:20:17,766 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-01 11:20:18,332 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-11-01 11:20:18,332 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-11-01 11:20:18,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-01 11:20:18,339 INFO L299 CfgBuilder]: Removed 135 assume(true) statements. [2021-11-01 11:20:18,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 11:20:18 BoogieIcfgContainer [2021-11-01 11:20:18,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-01 11:20:18,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-01 11:20:18,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-01 11:20:18,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-01 11:20:18,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 11:20:16" (1/3) ... [2021-11-01 11:20:18,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f84684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 11:20:18, skipping insertion in model container [2021-11-01 11:20:18,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 11:20:17" (2/3) ... [2021-11-01 11:20:18,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f84684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 11:20:18, skipping insertion in model container [2021-11-01 11:20:18,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 11:20:18" (3/3) ... [2021-11-01 11:20:18,348 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-11-01 11:20:18,353 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-01 11:20:18,353 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-01 11:20:18,392 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-01 11:20:18,397 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-01 11:20:18,398 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-01 11:20:18,422 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-01 11:20:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-01 11:20:18,426 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:18,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 11:20:18,428 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-01 11:20:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1802508012, now seen corresponding path program 1 times [2021-11-01 11:20:18,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:18,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034672761] [2021-11-01 11:20:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:18,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:18,834 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-01 11:20:18,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:18,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034672761] [2021-11-01 11:20:18,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034672761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:18,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:18,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 11:20:18,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135026128] [2021-11-01 11:20:18,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 11:20:18,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:18,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 11:20:18,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:18,873 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-01 11:20:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:19,705 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2021-11-01 11:20:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 11:20:19,708 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-01 11:20:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:19,717 INFO L225 Difference]: With dead ends: 360 [2021-11-01 11:20:19,718 INFO L226 Difference]: Without dead ends: 226 [2021-11-01 11:20:19,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.70ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:19,723 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 144 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 634.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.85ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 752.73ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:19,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 10 Invalid, 343 Unknown, 0 Unchecked, 5.85ms Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 752.73ms Time] [2021-11-01 11:20:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-01 11:20:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2021-11-01 11:20:19,767 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-01 11:20:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 273 transitions. [2021-11-01 11:20:19,770 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 273 transitions. Word has length 11 [2021-11-01 11:20:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:19,771 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 273 transitions. [2021-11-01 11:20:19,771 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-01 11:20:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 273 transitions. [2021-11-01 11:20:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-01 11:20:19,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:19,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 11:20:19,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-01 11:20:19,773 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-01 11:20:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 43172304, now seen corresponding path program 1 times [2021-11-01 11:20:19,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:19,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743907607] [2021-11-01 11:20:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:19,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:19,850 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-01 11:20:19,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:19,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743907607] [2021-11-01 11:20:19,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743907607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:19,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:19,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 11:20:19,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494935706] [2021-11-01 11:20:19,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 11:20:19,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:19,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 11:20:19,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:19,854 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-01 11:20:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:20,344 INFO L93 Difference]: Finished difference Result 630 states and 792 transitions. [2021-11-01 11:20:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 11:20:20,344 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-01 11:20:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:20,347 INFO L225 Difference]: With dead ends: 630 [2021-11-01 11:20:20,347 INFO L226 Difference]: Without dead ends: 418 [2021-11-01 11:20:20,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.98ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:20,349 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 379.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.62ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 452.40ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:20,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 287 Unknown, 0 Unchecked, 2.62ms Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 452.40ms Time] [2021-11-01 11:20:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-01 11:20:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 404. [2021-11-01 11:20:20,373 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-01 11:20:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 510 transitions. [2021-11-01 11:20:20,375 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 510 transitions. Word has length 12 [2021-11-01 11:20:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:20,376 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 510 transitions. [2021-11-01 11:20:20,376 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-01 11:20:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 510 transitions. [2021-11-01 11:20:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-01 11:20:20,377 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:20,377 INFO L514 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-01 11:20:20,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-01 11:20:20,378 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-01 11:20:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash -803172382, now seen corresponding path program 1 times [2021-11-01 11:20:20,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:20,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102237941] [2021-11-01 11:20:20,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:20,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:20,509 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-01 11:20:20,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:20,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102237941] [2021-11-01 11:20:20,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102237941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:20,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:20,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 11:20:20,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129915982] [2021-11-01 11:20:20,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 11:20:20,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 11:20:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:20,512 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-01 11:20:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:20,833 INFO L93 Difference]: Finished difference Result 835 states and 1069 transitions. [2021-11-01 11:20:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 11:20:20,834 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-01 11:20:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:20,836 INFO L225 Difference]: With dead ends: 835 [2021-11-01 11:20:20,836 INFO L226 Difference]: Without dead ends: 439 [2021-11-01 11:20:20,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.90ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:20,839 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 256.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 300.78ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:20,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 202 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 300.78ms Time] [2021-11-01 11:20:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-01 11:20:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-11-01 11:20:20,880 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-01 11:20:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 556 transitions. [2021-11-01 11:20:20,883 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 556 transitions. Word has length 28 [2021-11-01 11:20:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:20,884 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 556 transitions. [2021-11-01 11:20:20,884 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-01 11:20:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 556 transitions. [2021-11-01 11:20:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-01 11:20:20,887 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:20,887 INFO L514 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-01 11:20:20,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-01 11:20:20,887 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-01 11:20:20,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash 225824829, now seen corresponding path program 1 times [2021-11-01 11:20:20,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:20,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990033836] [2021-11-01 11:20:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:20,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:21,071 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-01 11:20:21,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:21,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990033836] [2021-11-01 11:20:21,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990033836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:21,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:21,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-01 11:20:21,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563937455] [2021-11-01 11:20:21,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-01 11:20:21,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-01 11:20:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-01 11:20:21,074 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-01 11:20:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:23,084 INFO L93 Difference]: Finished difference Result 2659 states and 3328 transitions. [2021-11-01 11:20:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-01 11:20:23,085 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-01 11:20:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:23,093 INFO L225 Difference]: With dead ends: 2659 [2021-11-01 11:20:23,093 INFO L226 Difference]: Without dead ends: 2229 [2021-11-01 11:20:23,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 133.34ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-01 11:20:23,096 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1180 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1502.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.92ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1766.30ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:23,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1180 Valid, 0 Invalid, 1524 Unknown, 0 Unchecked, 8.92ms Time], IncrementalHoareTripleChecker [13 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1766.30ms Time] [2021-11-01 11:20:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2021-11-01 11:20:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 483. [2021-11-01 11:20:23,149 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-01 11:20:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 604 transitions. [2021-11-01 11:20:23,151 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 604 transitions. Word has length 46 [2021-11-01 11:20:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:23,151 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 604 transitions. [2021-11-01 11:20:23,152 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-01 11:20:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 604 transitions. [2021-11-01 11:20:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-01 11:20:23,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:23,158 INFO L514 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-01 11:20:23,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-01 11:20:23,158 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-01 11:20:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 248457083, now seen corresponding path program 1 times [2021-11-01 11:20:23,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:23,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118624383] [2021-11-01 11:20:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:23,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:23,284 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-01 11:20:23,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:23,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118624383] [2021-11-01 11:20:23,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118624383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:23,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:23,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 11:20:23,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055754532] [2021-11-01 11:20:23,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 11:20:23,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 11:20:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:23,287 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-01 11:20:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:24,635 INFO L93 Difference]: Finished difference Result 2506 states and 3100 transitions. [2021-11-01 11:20:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 11:20:24,636 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-01 11:20:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:24,644 INFO L225 Difference]: With dead ends: 2506 [2021-11-01 11:20:24,644 INFO L226 Difference]: Without dead ends: 2257 [2021-11-01 11:20:24,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 45.33ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-01 11:20:24,649 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 854 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1007.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.84ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1177.55ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:24,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [854 Valid, 0 Invalid, 1071 Unknown, 0 Unchecked, 5.84ms Time], IncrementalHoareTripleChecker [8 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 1177.55ms Time] [2021-11-01 11:20:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2021-11-01 11:20:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 495. [2021-11-01 11:20:24,695 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-01 11:20:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 616 transitions. [2021-11-01 11:20:24,697 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 616 transitions. Word has length 46 [2021-11-01 11:20:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:24,698 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 616 transitions. [2021-11-01 11:20:24,698 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-01 11:20:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 616 transitions. [2021-11-01 11:20:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-01 11:20:24,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:24,701 INFO L514 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-01 11:20:24,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-01 11:20:24,704 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-01 11:20:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1031406595, now seen corresponding path program 1 times [2021-11-01 11:20:24,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:24,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343274707] [2021-11-01 11:20:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:24,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:24,819 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-01 11:20:24,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:24,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343274707] [2021-11-01 11:20:24,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343274707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:24,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:24,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-01 11:20:24,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351259582] [2021-11-01 11:20:24,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-01 11:20:24,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:24,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-01 11:20:24,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-01 11:20:24,822 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-01 11:20:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:27,527 INFO L93 Difference]: Finished difference Result 2611 states and 3230 transitions. [2021-11-01 11:20:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-01 11:20:27,528 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-01 11:20:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:27,535 INFO L225 Difference]: With dead ends: 2611 [2021-11-01 11:20:27,536 INFO L226 Difference]: Without dead ends: 2125 [2021-11-01 11:20:27,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 63.56ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-01 11:20:27,538 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 580 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2150.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.29ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2472.26ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:27,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 0 Invalid, 2718 Unknown, 0 Unchecked, 9.29ms Time], IncrementalHoareTripleChecker [10 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 2472.26ms Time] [2021-11-01 11:20:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2021-11-01 11:20:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 493. [2021-11-01 11:20:27,585 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-01 11:20:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 610 transitions. [2021-11-01 11:20:27,587 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 610 transitions. Word has length 46 [2021-11-01 11:20:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:27,588 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 610 transitions. [2021-11-01 11:20:27,588 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-01 11:20:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 610 transitions. [2021-11-01 11:20:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-01 11:20:27,589 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:27,589 INFO L514 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-01 11:20:27,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-01 11:20:27,590 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-01 11:20:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2143426174, now seen corresponding path program 1 times [2021-11-01 11:20:27,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:27,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246641066] [2021-11-01 11:20:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:27,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:27,712 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-01 11:20:27,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:27,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246641066] [2021-11-01 11:20:27,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246641066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:27,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:27,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 11:20:27,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22472818] [2021-11-01 11:20:27,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 11:20:27,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 11:20:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:27,714 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-01 11:20:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:29,045 INFO L93 Difference]: Finished difference Result 2570 states and 3159 transitions. [2021-11-01 11:20:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 11:20:29,045 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-01 11:20:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:29,058 INFO L225 Difference]: With dead ends: 2570 [2021-11-01 11:20:29,058 INFO L226 Difference]: Without dead ends: 2316 [2021-11-01 11:20:29,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 34.69ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-01 11:20:29,064 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 638 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 948.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.40ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1139.22ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:29,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 0 Invalid, 1332 Unknown, 0 Unchecked, 3.40ms Time], IncrementalHoareTripleChecker [6 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1139.22ms Time] [2021-11-01 11:20:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2021-11-01 11:20:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 505. [2021-11-01 11:20:29,119 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-01 11:20:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 622 transitions. [2021-11-01 11:20:29,120 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 622 transitions. Word has length 51 [2021-11-01 11:20:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:29,121 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 622 transitions. [2021-11-01 11:20:29,121 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-01 11:20:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 622 transitions. [2021-11-01 11:20:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-01 11:20:29,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:29,123 INFO L514 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-01 11:20:29,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-01 11:20:29,124 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-01 11:20:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:29,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1471482752, now seen corresponding path program 1 times [2021-11-01 11:20:29,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:29,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714183382] [2021-11-01 11:20:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:29,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:29,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-01 11:20:29,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:29,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714183382] [2021-11-01 11:20:29,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714183382] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:29,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:29,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 11:20:29,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138654227] [2021-11-01 11:20:29,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 11:20:29,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:29,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 11:20:29,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:29,237 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-01 11:20:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:29,810 INFO L93 Difference]: Finished difference Result 1054 states and 1298 transitions. [2021-11-01 11:20:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 11:20:29,811 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-01 11:20:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:29,813 INFO L225 Difference]: With dead ends: 1054 [2021-11-01 11:20:29,813 INFO L226 Difference]: Without dead ends: 558 [2021-11-01 11:20:29,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.23ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:29,815 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 448.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 522.28ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:29,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 585 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 522.28ms Time] [2021-11-01 11:20:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-11-01 11:20:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 346. [2021-11-01 11:20:29,847 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-01 11:20:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 420 transitions. [2021-11-01 11:20:29,848 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 420 transitions. Word has length 51 [2021-11-01 11:20:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:29,849 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 420 transitions. [2021-11-01 11:20:29,849 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-01 11:20:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 420 transitions. [2021-11-01 11:20:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-01 11:20:29,850 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:29,850 INFO L514 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-01 11:20:29,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-01 11:20:29,850 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-01 11:20:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash -934513600, now seen corresponding path program 1 times [2021-11-01 11:20:29,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:29,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586719831] [2021-11-01 11:20:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:29,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:29,923 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-01 11:20:29,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:29,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586719831] [2021-11-01 11:20:29,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586719831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:29,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:29,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 11:20:29,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378241872] [2021-11-01 11:20:29,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 11:20:29,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 11:20:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:29,926 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-01 11:20:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:30,586 INFO L93 Difference]: Finished difference Result 615 states and 744 transitions. [2021-11-01 11:20:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 11:20:30,586 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-01 11:20:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:30,588 INFO L225 Difference]: With dead ends: 615 [2021-11-01 11:20:30,589 INFO L226 Difference]: Without dead ends: 611 [2021-11-01 11:20:30,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.10ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:30,589 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 513.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.54ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 596.59ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:30,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 502 Unknown, 0 Unchecked, 2.54ms Time], IncrementalHoareTripleChecker [4 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 596.59ms Time] [2021-11-01 11:20:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-11-01 11:20:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2021-11-01 11:20:30,643 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-01 11:20:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 718 transitions. [2021-11-01 11:20:30,645 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 718 transitions. Word has length 51 [2021-11-01 11:20:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:30,645 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 718 transitions. [2021-11-01 11:20:30,645 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-01 11:20:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 718 transitions. [2021-11-01 11:20:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-01 11:20:30,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:30,646 INFO L514 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-01 11:20:30,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-01 11:20:30,647 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-01 11:20:30,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash 259265857, now seen corresponding path program 1 times [2021-11-01 11:20:30,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:30,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183615164] [2021-11-01 11:20:30,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:30,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:30,715 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-01 11:20:30,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:30,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183615164] [2021-11-01 11:20:30,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183615164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:30,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:30,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 11:20:30,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250035423] [2021-11-01 11:20:30,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 11:20:30,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 11:20:30,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:30,718 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-01 11:20:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:31,325 INFO L93 Difference]: Finished difference Result 1203 states and 1465 transitions. [2021-11-01 11:20:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-01 11:20:31,326 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-01 11:20:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:31,327 INFO L225 Difference]: With dead ends: 1203 [2021-11-01 11:20:31,327 INFO L226 Difference]: Without dead ends: 605 [2021-11-01 11:20:31,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.77ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-01 11:20:31,329 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 463.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.99ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 534.35ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:31,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 530 Unknown, 0 Unchecked, 0.99ms Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 534.35ms Time] [2021-11-01 11:20:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-11-01 11:20:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 541. [2021-11-01 11:20:31,377 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-01 11:20:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 664 transitions. [2021-11-01 11:20:31,378 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 664 transitions. Word has length 52 [2021-11-01 11:20:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:31,379 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 664 transitions. [2021-11-01 11:20:31,379 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-01 11:20:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 664 transitions. [2021-11-01 11:20:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-01 11:20:31,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:31,380 INFO L514 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-01 11:20:31,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-01 11:20:31,380 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-01 11:20:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash -489258623, now seen corresponding path program 1 times [2021-11-01 11:20:31,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:31,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324128832] [2021-11-01 11:20:31,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:31,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:31,455 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-01 11:20:31,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:31,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324128832] [2021-11-01 11:20:31,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324128832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:31,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:31,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-01 11:20:31,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670417292] [2021-11-01 11:20:31,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-01 11:20:31,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-01 11:20:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-01 11:20:31,458 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-01 11:20:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:32,702 INFO L93 Difference]: Finished difference Result 1578 states and 1914 transitions. [2021-11-01 11:20:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-01 11:20:32,703 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-01 11:20:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:32,706 INFO L225 Difference]: With dead ends: 1578 [2021-11-01 11:20:32,706 INFO L226 Difference]: Without dead ends: 1071 [2021-11-01 11:20:32,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 51.03ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-01 11:20:32,708 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 645 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 966.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.66ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1122.48ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:32,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 0 Invalid, 1474 Unknown, 0 Unchecked, 2.66ms Time], IncrementalHoareTripleChecker [10 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1122.48ms Time] [2021-11-01 11:20:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-11-01 11:20:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 539. [2021-11-01 11:20:32,763 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-01 11:20:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 658 transitions. [2021-11-01 11:20:32,764 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 658 transitions. Word has length 58 [2021-11-01 11:20:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:32,765 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 658 transitions. [2021-11-01 11:20:32,765 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-01 11:20:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 658 transitions. [2021-11-01 11:20:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-01 11:20:32,766 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:32,766 INFO L514 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-01 11:20:32,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-01 11:20:32,766 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-01 11:20:32,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash 123879707, now seen corresponding path program 1 times [2021-11-01 11:20:32,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:32,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825253309] [2021-11-01 11:20:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:32,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:32,845 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-01 11:20:32,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:32,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825253309] [2021-11-01 11:20:32,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825253309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:32,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:32,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 11:20:32,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553287424] [2021-11-01 11:20:32,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 11:20:32,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:32,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 11:20:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:32,847 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-01 11:20:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:33,692 INFO L93 Difference]: Finished difference Result 1073 states and 1300 transitions. [2021-11-01 11:20:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 11:20:33,693 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-01 11:20:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:33,695 INFO L225 Difference]: With dead ends: 1073 [2021-11-01 11:20:33,695 INFO L226 Difference]: Without dead ends: 568 [2021-11-01 11:20:33,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.37ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:33,696 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 636.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.75ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 745.90ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:33,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 388 Unknown, 0 Unchecked, 0.75ms Time], IncrementalHoareTripleChecker [2 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 745.90ms Time] [2021-11-01 11:20:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-01 11:20:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 511. [2021-11-01 11:20:33,753 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-01 11:20:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 612 transitions. [2021-11-01 11:20:33,754 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 612 transitions. Word has length 59 [2021-11-01 11:20:33,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:33,755 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 612 transitions. [2021-11-01 11:20:33,755 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-01 11:20:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 612 transitions. [2021-11-01 11:20:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-01 11:20:33,756 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:33,756 INFO L514 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-01 11:20:33,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-01 11:20:33,756 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-01 11:20:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2029608918, now seen corresponding path program 1 times [2021-11-01 11:20:33,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:33,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526459764] [2021-11-01 11:20:33,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:33,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:33,898 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-01 11:20:33,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:33,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526459764] [2021-11-01 11:20:33,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526459764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:33,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:33,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 11:20:33,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067679773] [2021-11-01 11:20:33,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 11:20:33,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 11:20:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:33,900 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-01 11:20:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:34,671 INFO L93 Difference]: Finished difference Result 1016 states and 1217 transitions. [2021-11-01 11:20:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 11:20:34,671 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-01 11:20:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:34,673 INFO L225 Difference]: With dead ends: 1016 [2021-11-01 11:20:34,673 INFO L226 Difference]: Without dead ends: 511 [2021-11-01 11:20:34,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.63ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-01 11:20:34,674 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 614.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.87ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 693.63ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:34,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 579 Unknown, 0 Unchecked, 0.87ms Time], IncrementalHoareTripleChecker [0 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 693.63ms Time] [2021-11-01 11:20:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-11-01 11:20:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2021-11-01 11:20:34,727 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-01 11:20:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 611 transitions. [2021-11-01 11:20:34,729 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 611 transitions. Word has length 61 [2021-11-01 11:20:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:34,729 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 611 transitions. [2021-11-01 11:20:34,729 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-01 11:20:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 611 transitions. [2021-11-01 11:20:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-01 11:20:34,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:34,730 INFO L514 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-01 11:20:34,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-01 11:20:34,731 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-01 11:20:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2070283668, now seen corresponding path program 1 times [2021-11-01 11:20:34,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:34,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956591469] [2021-11-01 11:20:34,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:34,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:34,837 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-01 11:20:34,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:34,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956591469] [2021-11-01 11:20:34,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956591469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:34,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:34,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 11:20:34,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214259886] [2021-11-01 11:20:34,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 11:20:34,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:34,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 11:20:34,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:34,839 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-01 11:20:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:35,565 INFO L93 Difference]: Finished difference Result 1408 states and 1689 transitions. [2021-11-01 11:20:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 11:20:35,566 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-01 11:20:35,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:35,569 INFO L225 Difference]: With dead ends: 1408 [2021-11-01 11:20:35,569 INFO L226 Difference]: Without dead ends: 1083 [2021-11-01 11:20:35,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.68ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:35,571 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 508.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.02ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 589.48ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:35,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 502 Unknown, 0 Unchecked, 1.02ms Time], IncrementalHoareTripleChecker [4 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 589.48ms Time] [2021-11-01 11:20:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-11-01 11:20:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 880. [2021-11-01 11:20:35,663 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-01 11:20:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1065 transitions. [2021-11-01 11:20:35,665 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1065 transitions. Word has length 61 [2021-11-01 11:20:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:35,665 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1065 transitions. [2021-11-01 11:20:35,665 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-01 11:20:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1065 transitions. [2021-11-01 11:20:35,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-01 11:20:35,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:35,666 INFO L514 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-01 11:20:35,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-01 11:20:35,667 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-01 11:20:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:35,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1960369742, now seen corresponding path program 1 times [2021-11-01 11:20:35,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:35,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116248635] [2021-11-01 11:20:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:35,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:35,764 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-01 11:20:35,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:35,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116248635] [2021-11-01 11:20:35,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116248635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:35,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:35,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 11:20:35,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243733656] [2021-11-01 11:20:35,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 11:20:35,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 11:20:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:35,766 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-01 11:20:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:36,363 INFO L93 Difference]: Finished difference Result 1323 states and 1591 transitions. [2021-11-01 11:20:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 11:20:36,363 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-01 11:20:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:36,365 INFO L225 Difference]: With dead ends: 1323 [2021-11-01 11:20:36,365 INFO L226 Difference]: Without dead ends: 520 [2021-11-01 11:20:36,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.24ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:36,367 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 470.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 537.12ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:36,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 467 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 537.12ms Time] [2021-11-01 11:20:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-11-01 11:20:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 499. [2021-11-01 11:20:36,417 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-01 11:20:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 595 transitions. [2021-11-01 11:20:36,419 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 595 transitions. Word has length 67 [2021-11-01 11:20:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:36,419 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 595 transitions. [2021-11-01 11:20:36,419 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-01 11:20:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 595 transitions. [2021-11-01 11:20:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-01 11:20:36,420 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:36,420 INFO L514 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-01 11:20:36,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-01 11:20:36,420 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-01 11:20:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:36,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1965673074, now seen corresponding path program 1 times [2021-11-01 11:20:36,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:36,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835978233] [2021-11-01 11:20:36,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:36,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:36,507 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-01 11:20:36,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:36,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835978233] [2021-11-01 11:20:36,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835978233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:36,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:36,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 11:20:36,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540518112] [2021-11-01 11:20:36,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 11:20:36,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:36,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 11:20:36,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:36,509 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-01 11:20:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:37,174 INFO L93 Difference]: Finished difference Result 828 states and 984 transitions. [2021-11-01 11:20:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 11:20:37,174 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-01 11:20:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:37,177 INFO L225 Difference]: With dead ends: 828 [2021-11-01 11:20:37,177 INFO L226 Difference]: Without dead ends: 821 [2021-11-01 11:20:37,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.24ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:37,178 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 489.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.81ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 573.87ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:37,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 0.81ms Time], IncrementalHoareTripleChecker [6 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 573.87ms Time] [2021-11-01 11:20:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-11-01 11:20:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 738. [2021-11-01 11:20:37,252 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-01 11:20:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 890 transitions. [2021-11-01 11:20:37,253 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 890 transitions. Word has length 67 [2021-11-01 11:20:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:37,254 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 890 transitions. [2021-11-01 11:20:37,254 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-01 11:20:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 890 transitions. [2021-11-01 11:20:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-01 11:20:37,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:37,255 INFO L514 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-01 11:20:37,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-01 11:20:37,255 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-01 11:20:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash 495831049, now seen corresponding path program 1 times [2021-11-01 11:20:37,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:37,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563321373] [2021-11-01 11:20:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:37,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:37,337 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-01 11:20:37,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:37,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563321373] [2021-11-01 11:20:37,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563321373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:37,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:37,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 11:20:37,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780216910] [2021-11-01 11:20:37,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 11:20:37,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:37,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 11:20:37,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:37,339 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-01 11:20:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:37,869 INFO L93 Difference]: Finished difference Result 848 states and 1022 transitions. [2021-11-01 11:20:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 11:20:37,870 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-01 11:20:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:37,872 INFO L225 Difference]: With dead ends: 848 [2021-11-01 11:20:37,872 INFO L226 Difference]: Without dead ends: 839 [2021-11-01 11:20:37,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.18ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:37,874 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 371.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 438.57ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:37,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 322 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [3 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 438.57ms Time] [2021-11-01 11:20:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-01 11:20:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 742. [2021-11-01 11:20:37,952 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-01 11:20:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 890 transitions. [2021-11-01 11:20:37,954 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 890 transitions. Word has length 68 [2021-11-01 11:20:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:37,954 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 890 transitions. [2021-11-01 11:20:37,954 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-01 11:20:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 890 transitions. [2021-11-01 11:20:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-01 11:20:37,955 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:37,955 INFO L514 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-01 11:20:37,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-01 11:20:37,956 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-01 11:20:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1259237824, now seen corresponding path program 1 times [2021-11-01 11:20:37,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:37,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246443751] [2021-11-01 11:20:37,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:37,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:38,077 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-01 11:20:38,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:38,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246443751] [2021-11-01 11:20:38,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246443751] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-01 11:20:38,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363871716] [2021-11-01 11:20:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:38,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 11:20:38,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 11:20:38,083 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-01 11:20:38,095 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-01 11:20:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:38,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-01 11:20:38,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 11:20:38,597 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-01 11:20:38,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 11:20:38,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363871716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:38,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-01 11:20:38,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-01 11:20:38,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023785448] [2021-11-01 11:20:38,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 11:20:38,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:38,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 11:20:38,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:38,599 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-01 11:20:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:39,069 INFO L93 Difference]: Finished difference Result 1044 states and 1254 transitions. [2021-11-01 11:20:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 11:20:39,070 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-01 11:20:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:39,071 INFO L225 Difference]: With dead ends: 1044 [2021-11-01 11:20:39,071 INFO L226 Difference]: Without dead ends: 379 [2021-11-01 11:20:39,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:39,073 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 373.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.65ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 422.09ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:39,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 261 Unknown, 0 Unchecked, 0.65ms Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 422.09ms Time] [2021-11-01 11:20:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-11-01 11:20:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2021-11-01 11:20:39,109 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-01 11:20:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 401 transitions. [2021-11-01 11:20:39,110 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 401 transitions. Word has length 72 [2021-11-01 11:20:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:39,111 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 401 transitions. [2021-11-01 11:20:39,111 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-01 11:20:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 401 transitions. [2021-11-01 11:20:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-01 11:20:39,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:39,112 INFO L514 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-01 11:20:39,143 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-01 11:20:39,318 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-01 11:20:39,319 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-01 11:20:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1340649389, now seen corresponding path program 1 times [2021-11-01 11:20:39,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:39,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694193854] [2021-11-01 11:20:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:39,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:39,412 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-01 11:20:39,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:39,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694193854] [2021-11-01 11:20:39,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694193854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:39,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:39,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 11:20:39,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483664158] [2021-11-01 11:20:39,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 11:20:39,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 11:20:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:39,414 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-01 11:20:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:40,045 INFO L93 Difference]: Finished difference Result 572 states and 667 transitions. [2021-11-01 11:20:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 11:20:40,046 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-01 11:20:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:40,047 INFO L225 Difference]: With dead ends: 572 [2021-11-01 11:20:40,047 INFO L226 Difference]: Without dead ends: 270 [2021-11-01 11:20:40,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.57ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 11:20:40,048 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 514.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.57ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 587.01ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:40,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 310 Unknown, 0 Unchecked, 0.57ms Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 587.01ms Time] [2021-11-01 11:20:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-01 11:20:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-11-01 11:20:40,079 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-01 11:20:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 306 transitions. [2021-11-01 11:20:40,080 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 306 transitions. Word has length 81 [2021-11-01 11:20:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:40,081 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 306 transitions. [2021-11-01 11:20:40,081 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-01 11:20:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 306 transitions. [2021-11-01 11:20:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-01 11:20:40,081 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:40,082 INFO L514 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-01 11:20:40,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-01 11:20:40,082 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-01 11:20:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1965874040, now seen corresponding path program 1 times [2021-11-01 11:20:40,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:40,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125981612] [2021-11-01 11:20:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:40,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:40,354 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-01 11:20:40,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:40,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125981612] [2021-11-01 11:20:40,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125981612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:40,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:40,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 11:20:40,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238545776] [2021-11-01 11:20:40,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 11:20:40,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:40,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 11:20:40,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:40,356 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-01 11:20:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:40,915 INFO L93 Difference]: Finished difference Result 272 states and 307 transitions. [2021-11-01 11:20:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 11:20:40,916 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-01 11:20:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:40,917 INFO L225 Difference]: With dead ends: 272 [2021-11-01 11:20:40,917 INFO L226 Difference]: Without dead ends: 222 [2021-11-01 11:20:40,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.96ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 11:20:40,918 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 468.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.54ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 527.74ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:40,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 320 Unknown, 0 Unchecked, 0.54ms Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 527.74ms Time] [2021-11-01 11:20:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-01 11:20:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2021-11-01 11:20:40,937 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-01 11:20:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2021-11-01 11:20:40,938 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 83 [2021-11-01 11:20:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:40,938 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2021-11-01 11:20:40,938 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-01 11:20:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2021-11-01 11:20:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-01 11:20:40,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 11:20:40,940 INFO L514 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-01 11:20:40,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-01 11:20:40,940 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-01 11:20:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 11:20:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2143833696, now seen corresponding path program 1 times [2021-11-01 11:20:40,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 11:20:40,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721055443] [2021-11-01 11:20:40,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 11:20:40,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 11:20:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 11:20:41,028 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-01 11:20:41,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 11:20:41,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721055443] [2021-11-01 11:20:41,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721055443] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 11:20:41,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 11:20:41,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 11:20:41,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860619131] [2021-11-01 11:20:41,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 11:20:41,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 11:20:41,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 11:20:41,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 11:20:41,032 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-01 11:20:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 11:20:41,533 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2021-11-01 11:20:41,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 11:20:41,533 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-01 11:20:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 11:20:41,533 INFO L225 Difference]: With dead ends: 138 [2021-11-01 11:20:41,533 INFO L226 Difference]: Without dead ends: 0 [2021-11-01 11:20:41,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.56ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-01 11:20:41,534 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 418.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.64ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 474.92ms IncrementalHoareTripleChecker+Time [2021-11-01 11:20:41,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 402 Unknown, 0 Unchecked, 0.64ms Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 474.92ms Time] [2021-11-01 11:20:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-01 11:20:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-01 11:20:41,535 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-01 11:20:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-01 11:20:41,535 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-11-01 11:20:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 11:20:41,536 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-01 11:20:41,536 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-01 11:20:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-01 11:20:41,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-01 11:20:41,538 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-01 11:20:41,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-01 11:20:41,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-11-01 11:20:41,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-11-01 11:20:41,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-11-01 11:20:41,539 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-01 11:20:41,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-01 11:20:41,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-01 11:20:41,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:41,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:42,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:43,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:44,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:45,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 11:20:52,105 INFO L854 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-01 11:20:52,106 INFO L858 garLoopResultBuilder]: For program point L4098-1(lines 4097 4116) no Hoare annotation was computed. [2021-11-01 11:20:52,106 INFO L854 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-01 11:20:52,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,106 INFO L854 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-01 11:20:52,106 INFO L854 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-01 11:20:52,107 INFO L858 garLoopResultBuilder]: For program point L4264(lines 4264 4266) no Hoare annotation was computed. [2021-11-01 11:20:52,107 INFO L858 garLoopResultBuilder]: For program point L4099-1(lines 4097 4116) no Hoare annotation was computed. [2021-11-01 11:20:52,107 INFO L858 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-11-01 11:20:52,107 INFO L858 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-11-01 11:20:52,107 INFO L854 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-01 11:20:52,107 INFO L854 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-01 11:20:52,107 INFO L854 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-01 11:20:52,108 INFO L858 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-11-01 11:20:52,108 INFO L858 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-11-01 11:20:52,108 INFO L854 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-01 11:20:52,108 INFO L854 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-01 11:20:52,108 INFO L858 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-11-01 11:20:52,109 INFO L854 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-01 11:20:52,109 INFO L858 garLoopResultBuilder]: For program point L4203-4(line 4203) no Hoare annotation was computed. [2021-11-01 11:20:52,109 INFO L858 garLoopResultBuilder]: For program point L4203-2(line 4203) no Hoare annotation was computed. [2021-11-01 11:20:52,109 INFO L858 garLoopResultBuilder]: For program point L4203-8(line 4203) no Hoare annotation was computed. [2021-11-01 11:20:52,109 INFO L858 garLoopResultBuilder]: For program point L4203-6(line 4203) no Hoare annotation was computed. [2021-11-01 11:20:52,109 INFO L854 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-01 11:20:52,109 INFO L854 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-01 11:20:52,110 INFO L854 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-01 11:20:52,110 INFO L854 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-01 11:20:52,110 INFO L854 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-01 11:20:52,110 INFO L854 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-01 11:20:52,110 INFO L854 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-01 11:20:52,110 INFO L854 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-01 11:20:52,111 INFO L854 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-01 11:20:52,111 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,111 INFO L858 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-11-01 11:20:52,111 INFO L858 garLoopResultBuilder]: For program point L4106-2(lines 4106 4111) no Hoare annotation was computed. [2021-11-01 11:20:52,111 INFO L858 garLoopResultBuilder]: For program point L4073(line 4073) no Hoare annotation was computed. [2021-11-01 11:20:52,111 INFO L858 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-11-01 11:20:52,111 INFO L854 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-01 11:20:52,112 INFO L854 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-01 11:20:52,112 INFO L854 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-01 11:20:52,112 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,112 INFO L854 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-01 11:20:52,112 INFO L854 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-01 11:20:52,112 INFO L854 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-01 11:20:52,113 INFO L854 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-01 11:20:52,113 INFO L854 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-01 11:20:52,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,113 INFO L854 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-11-01 11:20:52,113 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-11-01 11:20:52,113 INFO L858 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-11-01 11:20:52,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,114 INFO L854 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-01 11:20:52,114 INFO L858 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-11-01 11:20:52,114 INFO L858 garLoopResultBuilder]: For program point L4046(lines 1 4266) no Hoare annotation was computed. [2021-11-01 11:20:52,114 INFO L858 garLoopResultBuilder]: For program point L4046-2(lines 1 4266) no Hoare annotation was computed. [2021-11-01 11:20:52,114 INFO L858 garLoopResultBuilder]: For program point L4046-1(lines 1 4266) no Hoare annotation was computed. [2021-11-01 11:20:52,114 INFO L858 garLoopResultBuilder]: For program point L4046-4(lines 4190 4195) no Hoare annotation was computed. [2021-11-01 11:20:52,114 INFO L858 garLoopResultBuilder]: For program point L4046-3(lines 1 4266) no Hoare annotation was computed. [2021-11-01 11:20:52,115 INFO L854 garLoopResultBuilder]: At program point L4046-5(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-11-01 11:20:52,115 INFO L854 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-01 11:20:52,115 INFO L858 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-11-01 11:20:52,115 INFO L858 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-11-01 11:20:52,115 INFO L858 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-11-01 11:20:52,115 INFO L854 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-01 11:20:52,115 INFO L854 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-01 11:20:52,116 INFO L854 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-01 11:20:52,116 INFO L854 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-01 11:20:52,116 INFO L858 garLoopResultBuilder]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,116 INFO L858 garLoopResultBuilder]: For program point L4049(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,116 INFO L858 garLoopResultBuilder]: For program point L4049-3(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,116 INFO L858 garLoopResultBuilder]: For program point L4049-2(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,116 INFO L858 garLoopResultBuilder]: For program point L4049-5(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,117 INFO L858 garLoopResultBuilder]: For program point L4049-4(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,117 INFO L858 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-11-01 11:20:52,117 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-01 11:20:52,117 INFO L854 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-01 11:20:52,117 INFO L858 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-11-01 11:20:52,117 INFO L858 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-11-01 11:20:52,117 INFO L854 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-01 11:20:52,118 INFO L854 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-01 11:20:52,118 INFO L858 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-11-01 11:20:52,118 INFO L858 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-11-01 11:20:52,118 INFO L858 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-11-01 11:20:52,118 INFO L858 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-11-01 11:20:52,118 INFO L854 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-01 11:20:52,118 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-11-01 11:20:52,119 INFO L858 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-11-01 11:20:52,119 INFO L858 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-11-01 11:20:52,119 INFO L854 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-01 11:20:52,119 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-01 11:20:52,119 INFO L854 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-01 11:20:52,119 INFO L854 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-01 11:20:52,119 INFO L854 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-01 11:20:52,120 INFO L854 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-01 11:20:52,120 INFO L854 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-01 11:20:52,120 INFO L854 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-01 11:20:52,120 INFO L858 garLoopResultBuilder]: For program point L4155-1(lines 4154 4173) no Hoare annotation was computed. [2021-11-01 11:20:52,120 INFO L858 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-11-01 11:20:52,120 INFO L854 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-01 11:20:52,121 INFO L858 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-11-01 11:20:52,121 INFO L858 garLoopResultBuilder]: For program point L4156-1(lines 4154 4173) no Hoare annotation was computed. [2021-11-01 11:20:52,121 INFO L854 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-01 11:20:52,121 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-01 11:20:52,121 INFO L861 garLoopResultBuilder]: At program point L4058(lines 4058 4059) the Hoare annotation is: true [2021-11-01 11:20:52,121 INFO L861 garLoopResultBuilder]: At program point L4058-2(lines 4058 4059) the Hoare annotation is: true [2021-11-01 11:20:52,121 INFO L861 garLoopResultBuilder]: At program point L4058-1(lines 4058 4059) the Hoare annotation is: true [2021-11-01 11:20:52,122 INFO L861 garLoopResultBuilder]: At program point L4058-3(lines 4058 4059) the Hoare annotation is: true [2021-11-01 11:20:52,122 INFO L854 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-01 11:20:52,122 INFO L854 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-01 11:20:52,122 INFO L854 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-01 11:20:52,122 INFO L858 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-11-01 11:20:52,122 INFO L854 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-01 11:20:52,122 INFO L854 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-01 11:20:52,123 INFO L854 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-01 11:20:52,123 INFO L854 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-01 11:20:52,123 INFO L854 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-01 11:20:52,123 INFO L854 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-01 11:20:52,123 INFO L854 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-01 11:20:52,124 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-01 11:20:52,124 INFO L854 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-01 11:20:52,124 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-01 11:20:52,124 INFO L854 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-01 11:20:52,124 INFO L858 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-11-01 11:20:52,124 INFO L858 garLoopResultBuilder]: For program point L4130(line 4130) no Hoare annotation was computed. [2021-11-01 11:20:52,124 INFO L858 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-11-01 11:20:52,125 INFO L854 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-01 11:20:52,125 INFO L858 garLoopResultBuilder]: For program point L4163-2(lines 4163 4168) no Hoare annotation was computed. [2021-11-01 11:20:52,125 INFO L854 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-01 11:20:52,125 INFO L854 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-01 11:20:52,125 INFO L854 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-01 11:20:52,125 INFO L858 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-11-01 11:20:52,128 INFO L732 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-01 11:20:52,130 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-01 11:20:52,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 11:20:52 BoogieIcfgContainer [2021-11-01 11:20:52,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-01 11:20:52,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-01 11:20:52,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-01 11:20:52,187 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-01 11:20:52,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 11:20:18" (3/4) ... [2021-11-01 11:20:52,190 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-01 11:20:52,217 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2021-11-01 11:20:52,222 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2021-11-01 11:20:52,223 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-01 11:20:52,225 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-01 11:20:52,226 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-01 11:20:52,254 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-01 11:20:52,255 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-01 11:20:52,255 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-01 11:20:52,255 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-01 11:20:52,255 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-01 11:20:52,257 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-01 11:20:52,257 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-01 11:20:52,258 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-01 11:20:52,258 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-01 11:20:52,258 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-01 11:20:52,258 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-01 11:20:52,258 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-01 11:20:52,258 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-01 11:20:52,258 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-01 11:20:52,258 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-01 11:20:52,259 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-01 11:20:52,259 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-01 11:20:52,259 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-01 11:20:52,259 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-01 11:20:52,260 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-01 11:20:52,260 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-01 11:20:52,260 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-01 11:20:52,260 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-01 11:20:52,260 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-01 11:20:52,260 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-01 11:20:52,260 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-01 11:20:52,261 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-01 11:20:52,261 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-01 11:20:52,429 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-01 11:20:52,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-01 11:20:52,430 INFO L158 Benchmark]: Toolchain (without parser) took 36372.66ms. Allocated memory was 94.4MB in the beginning and 390.1MB in the end (delta: 295.7MB). Free memory was 63.6MB in the beginning and 162.9MB in the end (delta: -99.3MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. [2021-11-01 11:20:52,431 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 94.4MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-01 11:20:52,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1085.37ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 63.5MB in the beginning and 71.1MB in the end (delta: -7.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2021-11-01 11:20:52,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.28ms. Allocated memory is still 121.6MB. Free memory was 71.1MB in the beginning and 64.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-01 11:20:52,435 INFO L158 Benchmark]: Boogie Preprocessor took 92.96ms. Allocated memory is still 121.6MB. Free memory was 64.8MB in the beginning and 59.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-01 11:20:52,435 INFO L158 Benchmark]: RCFGBuilder took 987.66ms. Allocated memory was 121.6MB in the beginning and 186.6MB in the end (delta: 65.0MB). Free memory was 59.1MB in the beginning and 131.4MB in the end (delta: -72.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2021-11-01 11:20:52,435 INFO L158 Benchmark]: TraceAbstraction took 33844.15ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 130.4MB in the beginning and 226.4MB in the end (delta: -96.0MB). Peak memory consumption was 224.0MB. Max. memory is 16.1GB. [2021-11-01 11:20:52,436 INFO L158 Benchmark]: Witness Printer took 242.61ms. Allocated memory is still 390.1MB. Free memory was 226.4MB in the beginning and 162.9MB in the end (delta: 63.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2021-11-01 11:20:52,444 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 94.4MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1085.37ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 63.5MB in the beginning and 71.1MB in the end (delta: -7.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.28ms. Allocated memory is still 121.6MB. Free memory was 71.1MB in the beginning and 64.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.96ms. Allocated memory is still 121.6MB. Free memory was 64.8MB in the beginning and 59.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 987.66ms. Allocated memory was 121.6MB in the beginning and 186.6MB in the end (delta: 65.0MB). Free memory was 59.1MB in the beginning and 131.4MB in the end (delta: -72.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33844.15ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 130.4MB in the beginning and 226.4MB in the end (delta: -96.0MB). Peak memory consumption was 224.0MB. Max. memory is 16.1GB. * Witness Printer took 242.61ms. Allocated memory is still 390.1MB. Free memory was 226.4MB in the beginning and 162.9MB in the end (delta: 63.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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: 33739.59ms, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 36.89ms, AutomataDifference: 18622.43ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 10565.48ms, InitialAbstractionConstructionTime: 12.80ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5585 SdHoareTripleChecker+Valid, 16427.28ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5585 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 14138.59ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9173 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14494 IncrementalHoareTripleChecker+Invalid, 14583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 6 mSDtfsCounter, 14494 mSolverCounterSat, 51.31ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 476.10ms Time, 0.00ms 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.00ms DumpTime, AutomataMinimizationStatistics: 990.60ms AutomataMinimizationTime, 21 MinimizatonAttempts, 8386 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 207 NumberOfFragments, 2556 HoareAnnotationTreeSize, 68 FomulaSimplifications, 587755580 FormulaSimplificationTreeSizeReduction, 4324.98ms HoareSimplificationTime, 68 FomulaSimplificationsInter, 2953730 FormulaSimplificationTreeSizeReductionInter, 6216.36ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 170.98ms SsaConstructionTime, 1004.03ms SatisfiabilityAnalysisTime, 1690.49ms InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1220 ConstructedInterpolants, 0 QuantifiedInterpolants, 2527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1134 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-01 11:20:52,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...