./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 4d014703 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 14:24:28,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 14:24:28,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 14:24:28,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 14:24:28,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 14:24:28,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 14:24:28,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 14:24:28,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 14:24:28,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 14:24:28,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 14:24:28,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 14:24:28,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 14:24:28,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 14:24:28,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 14:24:28,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 14:24:28,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 14:24:28,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 14:24:28,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 14:24:28,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 14:24:28,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 14:24:28,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 14:24:28,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 14:24:28,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 14:24:28,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 14:24:28,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 14:24:28,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 14:24:28,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 14:24:28,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 14:24:28,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 14:24:28,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 14:24:28,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 14:24:28,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 14:24:28,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 14:24:28,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 14:24:28,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 14:24:28,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 14:24:28,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 14:24:28,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 14:24:28,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 14:24:28,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 14:24:28,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 14:24:28,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 14:24:28,260 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 14:24:28,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 14:24:28,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 14:24:28,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 14:24:28,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 14:24:28,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 14:24:28,263 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 14:24:28,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 14:24:28,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 14:24:28,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 14:24:28,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 14:24:28,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 14:24:28,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 14:24:28,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 14:24:28,264 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 14:24:28,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 14:24:28,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 14:24:28,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 14:24:28,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 14:24:28,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:24:28,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 14:24:28,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 14:24:28,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 14:24:28,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 14:24:28,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 14:24:28,266 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 14:24:28,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 14:24:28,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 14:24:28,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 14:24:28,267 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-02 14:24:28,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 14:24:28,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 14:24:28,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 14:24:28,447 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 14:24:28,448 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 14:24:28,449 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-02 14:24:28,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe845f12/2bd80d8c32e84773ae2e63bf290edac0/FLAG347f88aac [2021-11-02 14:24:29,024 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 14:24:29,024 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-02 14:24:29,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe845f12/2bd80d8c32e84773ae2e63bf290edac0/FLAG347f88aac [2021-11-02 14:24:29,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe845f12/2bd80d8c32e84773ae2e63bf290edac0 [2021-11-02 14:24:29,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 14:24:29,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 14:24:29,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 14:24:29,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 14:24:29,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 14:24:29,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:24:29" (1/1) ... [2021-11-02 14:24:29,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e23dd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:29, skipping insertion in model container [2021-11-02 14:24:29,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:24:29" (1/1) ... [2021-11-02 14:24:29,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 14:24:29,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 14:24:29,857 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-02 14:24:29,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:24:29,919 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 14:24:30,046 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-02 14:24:30,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:24:30,082 INFO L208 MainTranslator]: Completed translation [2021-11-02 14:24:30,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30 WrapperNode [2021-11-02 14:24:30,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 14:24:30,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 14:24:30,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 14:24:30,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 14:24:30,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 14:24:30,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 14:24:30,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 14:24:30,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 14:24:30,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 14:24:30,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 14:24:30,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 14:24:30,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 14:24:30,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (1/1) ... [2021-11-02 14:24:30,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:24:30,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:24:30,308 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-02 14:24:30,343 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-02 14:24:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 14:24:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 14:24:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 14:24:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 14:24:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 14:24:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 14:24:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 14:24:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 14:24:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 14:24:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 14:24:30,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 14:24:30,571 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 14:24:30,951 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-11-02 14:24:30,951 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-11-02 14:24:30,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 14:24:30,961 INFO L299 CfgBuilder]: Removed 135 assume(true) statements. [2021-11-02 14:24:30,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:24:30 BoogieIcfgContainer [2021-11-02 14:24:30,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 14:24:30,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 14:24:30,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 14:24:30,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 14:24:30,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 02:24:29" (1/3) ... [2021-11-02 14:24:30,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb73058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:24:30, skipping insertion in model container [2021-11-02 14:24:30,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:24:30" (2/3) ... [2021-11-02 14:24:30,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb73058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:24:30, skipping insertion in model container [2021-11-02 14:24:30,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:24:30" (3/3) ... [2021-11-02 14:24:30,969 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-11-02 14:24:30,975 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 14:24:30,976 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-02 14:24:31,019 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 14:24:31,026 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-02 14:24:31,026 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-02 14:24:31,044 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-02 14:24:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 14:24:31,048 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:31,048 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:24:31,049 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-02 14:24:31,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1802508012, now seen corresponding path program 1 times [2021-11-02 14:24:31,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:31,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611059894] [2021-11-02 14:24:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:31,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:31,417 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-02 14:24:31,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:31,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611059894] [2021-11-02 14:24:31,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611059894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:31,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:31,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 14:24:31,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502532941] [2021-11-02 14:24:31,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:24:31,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:24:31,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:31,443 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-02 14:24:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:32,028 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2021-11-02 14:24:32,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:24:32,030 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-02 14:24:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:32,038 INFO L225 Difference]: With dead ends: 360 [2021-11-02 14:24:32,038 INFO L226 Difference]: Without dead ends: 226 [2021-11-02 14:24:32,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.87ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:32,043 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 144 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 461.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.19ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 537.84ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:32,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 10 Invalid, 343 Unknown, 0 Unchecked, 3.19ms Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 537.84ms Time] [2021-11-02 14:24:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-02 14:24:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2021-11-02 14:24:32,091 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-02 14:24:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 273 transitions. [2021-11-02 14:24:32,096 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 273 transitions. Word has length 11 [2021-11-02 14:24:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:32,097 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 273 transitions. [2021-11-02 14:24:32,097 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-02 14:24:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 273 transitions. [2021-11-02 14:24:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-02 14:24:32,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:32,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:24:32,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 14:24:32,099 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-02 14:24:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash 43172304, now seen corresponding path program 1 times [2021-11-02 14:24:32,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:32,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571348177] [2021-11-02 14:24:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:32,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:32,160 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-02 14:24:32,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:32,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571348177] [2021-11-02 14:24:32,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571348177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:32,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:32,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 14:24:32,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625786138] [2021-11-02 14:24:32,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:24:32,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:32,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:24:32,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:32,163 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-02 14:24:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:32,579 INFO L93 Difference]: Finished difference Result 630 states and 792 transitions. [2021-11-02 14:24:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:24:32,580 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-02 14:24:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:32,582 INFO L225 Difference]: With dead ends: 630 [2021-11-02 14:24:32,582 INFO L226 Difference]: Without dead ends: 418 [2021-11-02 14:24:32,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.66ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:32,584 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 332.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.11ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 390.23ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:32,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 287 Unknown, 0 Unchecked, 2.11ms Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 390.23ms Time] [2021-11-02 14:24:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-02 14:24:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 404. [2021-11-02 14:24:32,603 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-02 14:24:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 510 transitions. [2021-11-02 14:24:32,604 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 510 transitions. Word has length 12 [2021-11-02 14:24:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:32,605 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 510 transitions. [2021-11-02 14:24:32,605 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-02 14:24:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 510 transitions. [2021-11-02 14:24:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 14:24:32,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:32,606 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-02 14:24:32,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 14:24:32,607 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-02 14:24:32,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash -803172382, now seen corresponding path program 1 times [2021-11-02 14:24:32,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:32,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084854767] [2021-11-02 14:24:32,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:32,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:32,700 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-02 14:24:32,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:32,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084854767] [2021-11-02 14:24:32,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084854767] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:32,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:32,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:24:32,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009130391] [2021-11-02 14:24:32,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:24:32,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:32,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:24:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:32,704 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-02 14:24:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:33,030 INFO L93 Difference]: Finished difference Result 835 states and 1069 transitions. [2021-11-02 14:24:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:24:33,031 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-02 14:24:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:33,032 INFO L225 Difference]: With dead ends: 835 [2021-11-02 14:24:33,033 INFO L226 Difference]: Without dead ends: 439 [2021-11-02 14:24:33,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.63ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:33,034 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 237.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.64ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 308.21ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:33,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 202 Unknown, 0 Unchecked, 0.64ms Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 308.21ms Time] [2021-11-02 14:24:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-02 14:24:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-11-02 14:24:33,058 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-02 14:24:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 556 transitions. [2021-11-02 14:24:33,061 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 556 transitions. Word has length 28 [2021-11-02 14:24:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:33,062 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 556 transitions. [2021-11-02 14:24:33,062 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-02 14:24:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 556 transitions. [2021-11-02 14:24:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 14:24:33,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:33,064 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-02 14:24:33,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 14:24:33,065 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-02 14:24:33,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 225824829, now seen corresponding path program 1 times [2021-11-02 14:24:33,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:33,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584326617] [2021-11-02 14:24:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:33,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:33,230 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-02 14:24:33,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:33,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584326617] [2021-11-02 14:24:33,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584326617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:33,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:33,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 14:24:33,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119578063] [2021-11-02 14:24:33,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 14:24:33,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:33,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 14:24:33,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:24:33,233 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-02 14:24:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:34,946 INFO L93 Difference]: Finished difference Result 2659 states and 3328 transitions. [2021-11-02 14:24:34,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 14:24:34,947 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-02 14:24:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:34,953 INFO L225 Difference]: With dead ends: 2659 [2021-11-02 14:24:34,954 INFO L226 Difference]: Without dead ends: 2229 [2021-11-02 14:24:34,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 102.61ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-02 14:24:34,964 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1180 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1299.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.80ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1507.00ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:34,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1180 Valid, 0 Invalid, 1524 Unknown, 0 Unchecked, 10.80ms Time], IncrementalHoareTripleChecker [13 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1507.00ms Time] [2021-11-02 14:24:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2021-11-02 14:24:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 483. [2021-11-02 14:24:35,010 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-02 14:24:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 604 transitions. [2021-11-02 14:24:35,011 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 604 transitions. Word has length 46 [2021-11-02 14:24:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:35,012 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 604 transitions. [2021-11-02 14:24:35,012 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-02 14:24:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 604 transitions. [2021-11-02 14:24:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 14:24:35,018 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:35,019 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-02 14:24:35,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 14:24:35,019 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-02 14:24:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash 248457083, now seen corresponding path program 1 times [2021-11-02 14:24:35,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:35,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510767451] [2021-11-02 14:24:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:35,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:35,084 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-02 14:24:35,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:35,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510767451] [2021-11-02 14:24:35,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510767451] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:35,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:35,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:24:35,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796750233] [2021-11-02 14:24:35,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:24:35,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:35,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:24:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:35,086 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-02 14:24:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:36,179 INFO L93 Difference]: Finished difference Result 2506 states and 3100 transitions. [2021-11-02 14:24:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 14:24:36,180 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-02 14:24:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:36,186 INFO L225 Difference]: With dead ends: 2506 [2021-11-02 14:24:36,186 INFO L226 Difference]: Without dead ends: 2257 [2021-11-02 14:24:36,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 33.56ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 14:24:36,188 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 854 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 833.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.33ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 969.88ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:36,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [854 Valid, 0 Invalid, 1071 Unknown, 0 Unchecked, 4.33ms Time], IncrementalHoareTripleChecker [8 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 969.88ms Time] [2021-11-02 14:24:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2021-11-02 14:24:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 495. [2021-11-02 14:24:36,216 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-02 14:24:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 616 transitions. [2021-11-02 14:24:36,218 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 616 transitions. Word has length 46 [2021-11-02 14:24:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:36,218 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 616 transitions. [2021-11-02 14:24:36,218 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-02 14:24:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 616 transitions. [2021-11-02 14:24:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 14:24:36,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:36,219 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-02 14:24:36,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 14:24:36,219 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-02 14:24:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:36,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1031406595, now seen corresponding path program 1 times [2021-11-02 14:24:36,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:36,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479664367] [2021-11-02 14:24:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:36,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:36,286 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-02 14:24:36,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:36,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479664367] [2021-11-02 14:24:36,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479664367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:36,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:36,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 14:24:36,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250135691] [2021-11-02 14:24:36,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 14:24:36,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 14:24:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:24:36,288 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-02 14:24:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:38,569 INFO L93 Difference]: Finished difference Result 2611 states and 3230 transitions. [2021-11-02 14:24:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 14:24:38,570 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-02 14:24:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:38,575 INFO L225 Difference]: With dead ends: 2611 [2021-11-02 14:24:38,575 INFO L226 Difference]: Without dead ends: 2125 [2021-11-02 14:24:38,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 54.71ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-02 14:24:38,577 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 580 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1796.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.09ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2071.22ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:38,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 0 Invalid, 2718 Unknown, 0 Unchecked, 8.09ms Time], IncrementalHoareTripleChecker [10 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 2071.22ms Time] [2021-11-02 14:24:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2021-11-02 14:24:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 493. [2021-11-02 14:24:38,620 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-02 14:24:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 610 transitions. [2021-11-02 14:24:38,621 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 610 transitions. Word has length 46 [2021-11-02 14:24:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:38,621 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 610 transitions. [2021-11-02 14:24:38,622 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-02 14:24:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 610 transitions. [2021-11-02 14:24:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 14:24:38,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:38,623 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-02 14:24:38,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 14:24:38,623 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-02 14:24:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2143426174, now seen corresponding path program 1 times [2021-11-02 14:24:38,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:38,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318939672] [2021-11-02 14:24:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:38,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:38,689 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-02 14:24:38,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:38,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318939672] [2021-11-02 14:24:38,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318939672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:38,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:38,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:24:38,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095828681] [2021-11-02 14:24:38,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:24:38,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:38,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:24:38,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:38,691 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-02 14:24:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:39,904 INFO L93 Difference]: Finished difference Result 2570 states and 3159 transitions. [2021-11-02 14:24:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 14:24:39,904 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-02 14:24:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:39,911 INFO L225 Difference]: With dead ends: 2570 [2021-11-02 14:24:39,911 INFO L226 Difference]: Without dead ends: 2316 [2021-11-02 14:24:39,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 31.41ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 14:24:39,914 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 638 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 868.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.19ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1025.25ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:39,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 0 Invalid, 1332 Unknown, 0 Unchecked, 3.19ms Time], IncrementalHoareTripleChecker [6 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1025.25ms Time] [2021-11-02 14:24:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2021-11-02 14:24:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 505. [2021-11-02 14:24:39,956 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-02 14:24:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 622 transitions. [2021-11-02 14:24:39,957 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 622 transitions. Word has length 51 [2021-11-02 14:24:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:39,957 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 622 transitions. [2021-11-02 14:24:39,957 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-02 14:24:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 622 transitions. [2021-11-02 14:24:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 14:24:39,959 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:39,959 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-02 14:24:39,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 14:24:39,959 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-02 14:24:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1471482752, now seen corresponding path program 1 times [2021-11-02 14:24:39,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:39,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471080290] [2021-11-02 14:24:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:39,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:40,068 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-02 14:24:40,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:40,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471080290] [2021-11-02 14:24:40,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471080290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:40,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:40,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:24:40,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083176372] [2021-11-02 14:24:40,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:24:40,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:40,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:24:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:40,071 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-02 14:24:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:40,609 INFO L93 Difference]: Finished difference Result 1054 states and 1298 transitions. [2021-11-02 14:24:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:24:40,610 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-02 14:24:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:40,613 INFO L225 Difference]: With dead ends: 1054 [2021-11-02 14:24:40,613 INFO L226 Difference]: Without dead ends: 558 [2021-11-02 14:24:40,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.78ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:40,614 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 418.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.85ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 485.74ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:40,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 585 Unknown, 0 Unchecked, 0.85ms Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 485.74ms Time] [2021-11-02 14:24:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-11-02 14:24:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 346. [2021-11-02 14:24:40,660 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-02 14:24:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 420 transitions. [2021-11-02 14:24:40,661 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 420 transitions. Word has length 51 [2021-11-02 14:24:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:40,661 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 420 transitions. [2021-11-02 14:24:40,661 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-02 14:24:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 420 transitions. [2021-11-02 14:24:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 14:24:40,662 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:40,664 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-02 14:24:40,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 14:24:40,664 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-02 14:24:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash -934513600, now seen corresponding path program 1 times [2021-11-02 14:24:40,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:40,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472521293] [2021-11-02 14:24:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:40,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:40,752 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-02 14:24:40,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:40,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472521293] [2021-11-02 14:24:40,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472521293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:40,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:40,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:24:40,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502205626] [2021-11-02 14:24:40,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:24:40,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:40,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:24:40,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:40,755 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-02 14:24:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:41,309 INFO L93 Difference]: Finished difference Result 615 states and 744 transitions. [2021-11-02 14:24:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:24:41,310 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-02 14:24:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:41,312 INFO L225 Difference]: With dead ends: 615 [2021-11-02 14:24:41,312 INFO L226 Difference]: Without dead ends: 611 [2021-11-02 14:24:41,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.31ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:41,313 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 425.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.70ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 496.89ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:41,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 502 Unknown, 0 Unchecked, 1.70ms Time], IncrementalHoareTripleChecker [4 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 496.89ms Time] [2021-11-02 14:24:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-11-02 14:24:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2021-11-02 14:24:41,353 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-02 14:24:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 718 transitions. [2021-11-02 14:24:41,354 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 718 transitions. Word has length 51 [2021-11-02 14:24:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:41,354 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 718 transitions. [2021-11-02 14:24:41,355 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-02 14:24:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 718 transitions. [2021-11-02 14:24:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-02 14:24:41,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:41,355 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-02 14:24:41,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 14:24:41,356 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-02 14:24:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash 259265857, now seen corresponding path program 1 times [2021-11-02 14:24:41,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:41,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046789076] [2021-11-02 14:24:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:41,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:41,410 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-02 14:24:41,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:41,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046789076] [2021-11-02 14:24:41,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046789076] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:41,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:41,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:24:41,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810555663] [2021-11-02 14:24:41,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:24:41,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:41,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:24:41,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:41,412 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-02 14:24:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:41,964 INFO L93 Difference]: Finished difference Result 1203 states and 1465 transitions. [2021-11-02 14:24:41,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 14:24:41,965 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-02 14:24:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:41,966 INFO L225 Difference]: With dead ends: 1203 [2021-11-02 14:24:41,967 INFO L226 Difference]: Without dead ends: 605 [2021-11-02 14:24:41,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.47ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:24:41,968 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 416.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.92ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 485.63ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:41,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 530 Unknown, 0 Unchecked, 0.92ms Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 485.63ms Time] [2021-11-02 14:24:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-11-02 14:24:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 541. [2021-11-02 14:24:42,006 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-02 14:24:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 664 transitions. [2021-11-02 14:24:42,007 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 664 transitions. Word has length 52 [2021-11-02 14:24:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:42,007 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 664 transitions. [2021-11-02 14:24:42,007 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-02 14:24:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 664 transitions. [2021-11-02 14:24:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-02 14:24:42,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:42,008 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-02 14:24:42,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 14:24:42,008 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-02 14:24:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash -489258623, now seen corresponding path program 1 times [2021-11-02 14:24:42,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:42,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202127182] [2021-11-02 14:24:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:42,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:42,073 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-02 14:24:42,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:42,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202127182] [2021-11-02 14:24:42,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202127182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:42,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:42,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 14:24:42,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963433552] [2021-11-02 14:24:42,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 14:24:42,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 14:24:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:24:42,075 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-02 14:24:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:43,380 INFO L93 Difference]: Finished difference Result 1578 states and 1914 transitions. [2021-11-02 14:24:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 14:24:43,381 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-02 14:24:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:43,384 INFO L225 Difference]: With dead ends: 1578 [2021-11-02 14:24:43,384 INFO L226 Difference]: Without dead ends: 1071 [2021-11-02 14:24:43,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 47.04ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-02 14:24:43,386 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 645 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 973.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.59ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1150.64ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:43,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 0 Invalid, 1474 Unknown, 0 Unchecked, 3.59ms Time], IncrementalHoareTripleChecker [10 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1150.64ms Time] [2021-11-02 14:24:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-11-02 14:24:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 539. [2021-11-02 14:24:43,438 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-02 14:24:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 658 transitions. [2021-11-02 14:24:43,440 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 658 transitions. Word has length 58 [2021-11-02 14:24:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:43,440 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 658 transitions. [2021-11-02 14:24:43,440 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-02 14:24:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 658 transitions. [2021-11-02 14:24:43,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-02 14:24:43,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:43,443 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-02 14:24:43,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 14:24:43,443 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-02 14:24:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash 123879707, now seen corresponding path program 1 times [2021-11-02 14:24:43,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:43,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261454092] [2021-11-02 14:24:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:43,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:43,528 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-02 14:24:43,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:43,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261454092] [2021-11-02 14:24:43,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261454092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:43,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:43,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:24:43,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797306529] [2021-11-02 14:24:43,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:24:43,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:43,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:24:43,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:43,530 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-02 14:24:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:44,167 INFO L93 Difference]: Finished difference Result 1073 states and 1300 transitions. [2021-11-02 14:24:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:24:44,167 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-02 14:24:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:44,169 INFO L225 Difference]: With dead ends: 1073 [2021-11-02 14:24:44,169 INFO L226 Difference]: Without dead ends: 568 [2021-11-02 14:24:44,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.97ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:44,171 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 480.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.61ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 562.48ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:44,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 388 Unknown, 0 Unchecked, 0.61ms Time], IncrementalHoareTripleChecker [2 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 562.48ms Time] [2021-11-02 14:24:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-02 14:24:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 511. [2021-11-02 14:24:44,232 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-02 14:24:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 612 transitions. [2021-11-02 14:24:44,233 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 612 transitions. Word has length 59 [2021-11-02 14:24:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:44,233 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 612 transitions. [2021-11-02 14:24:44,233 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-02 14:24:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 612 transitions. [2021-11-02 14:24:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 14:24:44,234 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:44,234 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-02 14:24:44,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 14:24:44,234 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-02 14:24:44,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2029608918, now seen corresponding path program 1 times [2021-11-02 14:24:44,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:44,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273179208] [2021-11-02 14:24:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:44,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:44,342 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-02 14:24:44,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:44,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273179208] [2021-11-02 14:24:44,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273179208] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:44,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:44,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:24:44,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998639860] [2021-11-02 14:24:44,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:24:44,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:44,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:24:44,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:44,344 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-02 14:24:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:44,950 INFO L93 Difference]: Finished difference Result 1016 states and 1217 transitions. [2021-11-02 14:24:44,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:24:44,950 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-02 14:24:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:44,952 INFO L225 Difference]: With dead ends: 1016 [2021-11-02 14:24:44,952 INFO L226 Difference]: Without dead ends: 511 [2021-11-02 14:24:44,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.26ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:24:44,953 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 466.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.68ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 544.31ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:44,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 579 Unknown, 0 Unchecked, 0.68ms Time], IncrementalHoareTripleChecker [0 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 544.31ms Time] [2021-11-02 14:24:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-11-02 14:24:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2021-11-02 14:24:44,991 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-02 14:24:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 611 transitions. [2021-11-02 14:24:44,992 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 611 transitions. Word has length 61 [2021-11-02 14:24:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:44,992 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 611 transitions. [2021-11-02 14:24:44,992 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-02 14:24:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 611 transitions. [2021-11-02 14:24:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 14:24:44,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:44,993 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-02 14:24:44,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 14:24:44,993 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-02 14:24:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2070283668, now seen corresponding path program 1 times [2021-11-02 14:24:44,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:44,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759505174] [2021-11-02 14:24:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:44,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:45,090 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-02 14:24:45,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:45,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759505174] [2021-11-02 14:24:45,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759505174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:45,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:45,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:24:45,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536184252] [2021-11-02 14:24:45,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:24:45,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:45,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:24:45,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:45,092 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-02 14:24:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:45,627 INFO L93 Difference]: Finished difference Result 1408 states and 1689 transitions. [2021-11-02 14:24:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:24:45,627 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-02 14:24:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:45,630 INFO L225 Difference]: With dead ends: 1408 [2021-11-02 14:24:45,630 INFO L226 Difference]: Without dead ends: 1083 [2021-11-02 14:24:45,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.54ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:45,631 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 379.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.66ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 441.98ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:45,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 502 Unknown, 0 Unchecked, 0.66ms Time], IncrementalHoareTripleChecker [4 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 441.98ms Time] [2021-11-02 14:24:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-11-02 14:24:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 880. [2021-11-02 14:24:45,708 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-02 14:24:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1065 transitions. [2021-11-02 14:24:45,709 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1065 transitions. Word has length 61 [2021-11-02 14:24:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:45,709 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1065 transitions. [2021-11-02 14:24:45,709 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-02 14:24:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1065 transitions. [2021-11-02 14:24:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-02 14:24:45,710 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:45,710 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-02 14:24:45,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 14:24:45,710 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-02 14:24:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1960369742, now seen corresponding path program 1 times [2021-11-02 14:24:45,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:45,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941775566] [2021-11-02 14:24:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:45,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:45,769 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-02 14:24:45,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:45,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941775566] [2021-11-02 14:24:45,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941775566] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:45,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:45,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:24:45,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290037338] [2021-11-02 14:24:45,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:24:45,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:24:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:45,771 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-02 14:24:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:46,221 INFO L93 Difference]: Finished difference Result 1323 states and 1591 transitions. [2021-11-02 14:24:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:24:46,221 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-02 14:24:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:46,223 INFO L225 Difference]: With dead ends: 1323 [2021-11-02 14:24:46,223 INFO L226 Difference]: Without dead ends: 520 [2021-11-02 14:24:46,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.89ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:46,224 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 345.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.58ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 398.58ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:46,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 467 Unknown, 0 Unchecked, 0.58ms Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 398.58ms Time] [2021-11-02 14:24:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-11-02 14:24:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 499. [2021-11-02 14:24:46,261 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-02 14:24:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 595 transitions. [2021-11-02 14:24:46,261 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 595 transitions. Word has length 67 [2021-11-02 14:24:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:46,262 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 595 transitions. [2021-11-02 14:24:46,262 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-02 14:24:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 595 transitions. [2021-11-02 14:24:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-02 14:24:46,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:46,262 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-02 14:24:46,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 14:24:46,263 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-02 14:24:46,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:46,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1965673074, now seen corresponding path program 1 times [2021-11-02 14:24:46,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:46,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227476581] [2021-11-02 14:24:46,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:46,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:46,339 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-02 14:24:46,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:46,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227476581] [2021-11-02 14:24:46,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227476581] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:46,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:46,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:24:46,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459823996] [2021-11-02 14:24:46,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:24:46,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:46,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:24:46,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:46,343 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-02 14:24:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:46,871 INFO L93 Difference]: Finished difference Result 828 states and 984 transitions. [2021-11-02 14:24:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:24:46,871 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-02 14:24:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:46,873 INFO L225 Difference]: With dead ends: 828 [2021-11-02 14:24:46,873 INFO L226 Difference]: Without dead ends: 821 [2021-11-02 14:24:46,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.51ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:46,874 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 394.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 458.23ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:46,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [6 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 458.23ms Time] [2021-11-02 14:24:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-11-02 14:24:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 738. [2021-11-02 14:24:46,925 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-02 14:24:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 890 transitions. [2021-11-02 14:24:46,926 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 890 transitions. Word has length 67 [2021-11-02 14:24:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:46,927 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 890 transitions. [2021-11-02 14:24:46,927 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-02 14:24:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 890 transitions. [2021-11-02 14:24:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-02 14:24:46,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:46,928 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-02 14:24:46,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 14:24:46,928 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-02 14:24:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 495831049, now seen corresponding path program 1 times [2021-11-02 14:24:46,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:46,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164559313] [2021-11-02 14:24:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:46,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:46,986 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-02 14:24:46,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:46,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164559313] [2021-11-02 14:24:46,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164559313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:46,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:46,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:24:46,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809845582] [2021-11-02 14:24:46,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:24:46,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:46,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:24:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:46,988 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-02 14:24:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:47,364 INFO L93 Difference]: Finished difference Result 848 states and 1022 transitions. [2021-11-02 14:24:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:24:47,365 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-02 14:24:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:47,367 INFO L225 Difference]: With dead ends: 848 [2021-11-02 14:24:47,367 INFO L226 Difference]: Without dead ends: 839 [2021-11-02 14:24:47,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.89ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:47,368 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 267.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.54ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 312.02ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:47,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 322 Unknown, 0 Unchecked, 0.54ms Time], IncrementalHoareTripleChecker [3 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 312.02ms Time] [2021-11-02 14:24:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-02 14:24:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 742. [2021-11-02 14:24:47,467 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-02 14:24:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 890 transitions. [2021-11-02 14:24:47,468 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 890 transitions. Word has length 68 [2021-11-02 14:24:47,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:47,468 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 890 transitions. [2021-11-02 14:24:47,468 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-02 14:24:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 890 transitions. [2021-11-02 14:24:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-02 14:24:47,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:47,469 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-02 14:24:47,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 14:24:47,470 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-02 14:24:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1259237824, now seen corresponding path program 1 times [2021-11-02 14:24:47,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:47,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107397116] [2021-11-02 14:24:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:47,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:47,548 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-02 14:24:47,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:47,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107397116] [2021-11-02 14:24:47,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107397116] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 14:24:47,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847221231] [2021-11-02 14:24:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:47,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 14:24:47,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:24:47,551 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-02 14:24:47,568 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-02 14:24:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:47,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 14:24:47,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:24:47,979 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-02 14:24:47,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 14:24:47,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847221231] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:47,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 14:24:47,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-02 14:24:47,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134752189] [2021-11-02 14:24:47,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:24:47,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:24:47,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:47,981 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-02 14:24:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:48,303 INFO L93 Difference]: Finished difference Result 1044 states and 1254 transitions. [2021-11-02 14:24:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:24:48,303 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-02 14:24:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:48,305 INFO L225 Difference]: With dead ends: 1044 [2021-11-02 14:24:48,305 INFO L226 Difference]: Without dead ends: 379 [2021-11-02 14:24:48,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:48,314 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 250.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.45ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 288.30ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:48,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 261 Unknown, 0 Unchecked, 0.45ms Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 288.30ms Time] [2021-11-02 14:24:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-11-02 14:24:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2021-11-02 14:24:48,364 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-02 14:24:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 401 transitions. [2021-11-02 14:24:48,365 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 401 transitions. Word has length 72 [2021-11-02 14:24:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:48,365 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 401 transitions. [2021-11-02 14:24:48,366 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-02 14:24:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 401 transitions. [2021-11-02 14:24:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 14:24:48,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:48,366 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-02 14:24:48,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-02 14:24:48,585 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-02 14:24:48,585 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-02 14:24:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1340649389, now seen corresponding path program 1 times [2021-11-02 14:24:48,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:48,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707361533] [2021-11-02 14:24:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:48,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:48,655 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-02 14:24:48,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:48,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707361533] [2021-11-02 14:24:48,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707361533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:48,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:48,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:24:48,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653131067] [2021-11-02 14:24:48,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:24:48,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:48,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:24:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:48,658 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-02 14:24:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:49,160 INFO L93 Difference]: Finished difference Result 572 states and 667 transitions. [2021-11-02 14:24:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:24:49,160 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-02 14:24:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:49,161 INFO L225 Difference]: With dead ends: 572 [2021-11-02 14:24:49,161 INFO L226 Difference]: Without dead ends: 270 [2021-11-02 14:24:49,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.59ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:24:49,162 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 390.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 449.18ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:49,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 310 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 449.18ms Time] [2021-11-02 14:24:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-02 14:24:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-11-02 14:24:49,186 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-02 14:24:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 306 transitions. [2021-11-02 14:24:49,186 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 306 transitions. Word has length 81 [2021-11-02 14:24:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:49,187 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 306 transitions. [2021-11-02 14:24:49,187 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-02 14:24:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 306 transitions. [2021-11-02 14:24:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-02 14:24:49,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:49,188 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-02 14:24:49,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 14:24:49,188 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-02 14:24:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1965874040, now seen corresponding path program 1 times [2021-11-02 14:24:49,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:49,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494666230] [2021-11-02 14:24:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:49,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:49,395 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-02 14:24:49,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:49,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494666230] [2021-11-02 14:24:49,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494666230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:49,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:49,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:24:49,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286371514] [2021-11-02 14:24:49,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:24:49,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:24:49,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:49,397 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-02 14:24:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:49,799 INFO L93 Difference]: Finished difference Result 272 states and 307 transitions. [2021-11-02 14:24:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:24:49,800 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-02 14:24:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:49,800 INFO L225 Difference]: With dead ends: 272 [2021-11-02 14:24:49,801 INFO L226 Difference]: Without dead ends: 222 [2021-11-02 14:24:49,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.03ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:24:49,802 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 332.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.40ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 375.55ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:49,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 320 Unknown, 0 Unchecked, 0.40ms Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 375.55ms Time] [2021-11-02 14:24:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-02 14:24:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2021-11-02 14:24:49,819 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-02 14:24:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2021-11-02 14:24:49,820 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 83 [2021-11-02 14:24:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:49,820 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2021-11-02 14:24:49,820 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-02 14:24:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2021-11-02 14:24:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-02 14:24:49,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:24:49,821 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-02 14:24:49,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 14:24:49,821 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-02 14:24:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:24:49,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2143833696, now seen corresponding path program 1 times [2021-11-02 14:24:49,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:24:49,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410592616] [2021-11-02 14:24:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:24:49,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:24:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:24:49,894 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-02 14:24:49,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:24:49,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410592616] [2021-11-02 14:24:49,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410592616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:24:49,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:24:49,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:24:49,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322534597] [2021-11-02 14:24:49,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:24:49,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:24:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:24:49,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:24:49,896 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-02 14:24:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:24:50,350 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2021-11-02 14:24:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:24:50,351 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-02 14:24:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:24:50,351 INFO L225 Difference]: With dead ends: 138 [2021-11-02 14:24:50,351 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 14:24:50,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.54ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:24:50,352 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 379.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.53ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 430.53ms IncrementalHoareTripleChecker+Time [2021-11-02 14:24:50,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 402 Unknown, 0 Unchecked, 0.53ms Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 430.53ms Time] [2021-11-02 14:24:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 14:24:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 14:24:50,352 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-02 14:24:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 14:24:50,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-11-02 14:24:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:24:50,353 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 14:24:50,353 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-02 14:24:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 14:24:50,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 14:24:50,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-02 14:24:50,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-02 14:24:50,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-11-02 14:24:50,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-11-02 14:24:50,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-11-02 14:24:50,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-02 14:24:50,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 14:24:50,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 14:24:50,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:50,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:51,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:52,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:53,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 14:24:59,472 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-02 14:24:59,473 INFO L858 garLoopResultBuilder]: For program point L4098-1(lines 4097 4116) no Hoare annotation was computed. [2021-11-02 14:24:59,473 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-02 14:24:59,473 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,475 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-02 14:24:59,475 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-02 14:24:59,475 INFO L858 garLoopResultBuilder]: For program point L4264(lines 4264 4266) no Hoare annotation was computed. [2021-11-02 14:24:59,475 INFO L858 garLoopResultBuilder]: For program point L4099-1(lines 4097 4116) no Hoare annotation was computed. [2021-11-02 14:24:59,476 INFO L858 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-11-02 14:24:59,476 INFO L858 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-11-02 14:24:59,477 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-02 14:24:59,477 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-02 14:24:59,477 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-02 14:24:59,477 INFO L858 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-11-02 14:24:59,478 INFO L858 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-11-02 14:24:59,478 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-02 14:24:59,478 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-02 14:24:59,478 INFO L858 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-11-02 14:24:59,478 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-02 14:24:59,478 INFO L858 garLoopResultBuilder]: For program point L4203-4(line 4203) no Hoare annotation was computed. [2021-11-02 14:24:59,478 INFO L858 garLoopResultBuilder]: For program point L4203-2(line 4203) no Hoare annotation was computed. [2021-11-02 14:24:59,478 INFO L858 garLoopResultBuilder]: For program point L4203-8(line 4203) no Hoare annotation was computed. [2021-11-02 14:24:59,479 INFO L858 garLoopResultBuilder]: For program point L4203-6(line 4203) no Hoare annotation was computed. [2021-11-02 14:24:59,479 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-02 14:24:59,479 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-02 14:24:59,479 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-02 14:24:59,479 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-02 14:24:59,479 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-02 14:24:59,479 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-02 14:24:59,479 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-02 14:24:59,480 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-02 14:24:59,480 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-02 14:24:59,480 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,480 INFO L858 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-11-02 14:24:59,480 INFO L858 garLoopResultBuilder]: For program point L4106-2(lines 4106 4111) no Hoare annotation was computed. [2021-11-02 14:24:59,480 INFO L858 garLoopResultBuilder]: For program point L4073(line 4073) no Hoare annotation was computed. [2021-11-02 14:24:59,480 INFO L858 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-11-02 14:24:59,480 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-02 14:24:59,481 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-02 14:24:59,481 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-02 14:24:59,481 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,481 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-02 14:24:59,481 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-02 14:24:59,481 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-02 14:24:59,481 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-02 14:24:59,482 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-02 14:24:59,482 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,482 INFO L854 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-11-02 14:24:59,482 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-11-02 14:24:59,482 INFO L858 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-11-02 14:24:59,482 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,482 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-02 14:24:59,482 INFO L858 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-11-02 14:24:59,483 INFO L858 garLoopResultBuilder]: For program point L4046(lines 1 4266) no Hoare annotation was computed. [2021-11-02 14:24:59,483 INFO L858 garLoopResultBuilder]: For program point L4046-2(lines 1 4266) no Hoare annotation was computed. [2021-11-02 14:24:59,483 INFO L858 garLoopResultBuilder]: For program point L4046-1(lines 1 4266) no Hoare annotation was computed. [2021-11-02 14:24:59,483 INFO L858 garLoopResultBuilder]: For program point L4046-4(lines 4190 4195) no Hoare annotation was computed. [2021-11-02 14:24:59,483 INFO L858 garLoopResultBuilder]: For program point L4046-3(lines 1 4266) no Hoare annotation was computed. [2021-11-02 14:24:59,483 INFO L854 garLoopResultBuilder]: At program point L4046-5(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-11-02 14:24:59,483 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-02 14:24:59,483 INFO L858 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-11-02 14:24:59,483 INFO L858 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-11-02 14:24:59,484 INFO L858 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-11-02 14:24:59,484 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-02 14:24:59,484 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-02 14:24:59,484 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-02 14:24:59,484 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-02 14:24:59,484 INFO L858 garLoopResultBuilder]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,484 INFO L858 garLoopResultBuilder]: For program point L4049(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,485 INFO L858 garLoopResultBuilder]: For program point L4049-3(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,485 INFO L858 garLoopResultBuilder]: For program point L4049-2(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,485 INFO L858 garLoopResultBuilder]: For program point L4049-5(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,486 INFO L858 garLoopResultBuilder]: For program point L4049-4(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,486 INFO L858 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-11-02 14:24:59,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 14:24:59,486 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-02 14:24:59,486 INFO L858 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-11-02 14:24:59,487 INFO L858 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-11-02 14:24:59,487 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-02 14:24:59,487 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-02 14:24:59,487 INFO L858 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-11-02 14:24:59,488 INFO L858 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-11-02 14:24:59,488 INFO L858 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-11-02 14:24:59,488 INFO L858 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-11-02 14:24:59,488 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-02 14:24:59,488 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-11-02 14:24:59,488 INFO L858 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-11-02 14:24:59,488 INFO L858 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-11-02 14:24:59,488 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-02 14:24:59,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 14:24:59,489 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-02 14:24:59,489 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-02 14:24:59,489 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-02 14:24:59,489 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-02 14:24:59,489 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-02 14:24:59,489 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-02 14:24:59,489 INFO L858 garLoopResultBuilder]: For program point L4155-1(lines 4154 4173) no Hoare annotation was computed. [2021-11-02 14:24:59,489 INFO L858 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-11-02 14:24:59,490 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-02 14:24:59,490 INFO L858 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-11-02 14:24:59,490 INFO L858 garLoopResultBuilder]: For program point L4156-1(lines 4154 4173) no Hoare annotation was computed. [2021-11-02 14:24:59,490 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-02 14:24:59,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 14:24:59,490 INFO L861 garLoopResultBuilder]: At program point L4058(lines 4058 4059) the Hoare annotation is: true [2021-11-02 14:24:59,490 INFO L861 garLoopResultBuilder]: At program point L4058-2(lines 4058 4059) the Hoare annotation is: true [2021-11-02 14:24:59,490 INFO L861 garLoopResultBuilder]: At program point L4058-1(lines 4058 4059) the Hoare annotation is: true [2021-11-02 14:24:59,491 INFO L861 garLoopResultBuilder]: At program point L4058-3(lines 4058 4059) the Hoare annotation is: true [2021-11-02 14:24:59,491 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-02 14:24:59,491 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-02 14:24:59,491 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-02 14:24:59,491 INFO L858 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-11-02 14:24:59,491 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-02 14:24:59,491 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-02 14:24:59,491 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-02 14:24:59,492 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-02 14:24:59,492 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-02 14:24:59,492 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-02 14:24:59,492 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-02 14:24:59,492 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 14:24:59,492 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-02 14:24:59,492 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-02 14:24:59,492 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-02 14:24:59,493 INFO L858 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-11-02 14:24:59,493 INFO L858 garLoopResultBuilder]: For program point L4130(line 4130) no Hoare annotation was computed. [2021-11-02 14:24:59,493 INFO L858 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-11-02 14:24:59,493 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-02 14:24:59,493 INFO L858 garLoopResultBuilder]: For program point L4163-2(lines 4163 4168) no Hoare annotation was computed. [2021-11-02 14:24:59,493 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-02 14:24:59,493 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-02 14:24:59,493 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-02 14:24:59,494 INFO L858 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-11-02 14:24:59,497 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-02 14:24:59,498 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 14:24:59,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 02:24:59 BoogieIcfgContainer [2021-11-02 14:24:59,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 14:24:59,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 14:24:59,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 14:24:59,557 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 14:24:59,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:24:30" (3/4) ... [2021-11-02 14:24:59,560 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 14:24:59,579 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2021-11-02 14:24:59,580 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2021-11-02 14:24:59,581 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-02 14:24:59,582 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-02 14:24:59,583 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 14:24:59,607 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-02 14:24:59,607 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-02 14:24:59,607 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-02 14:24:59,608 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-02 14:24:59,608 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-02 14:24:59,609 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-02 14:24:59,610 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-02 14:24:59,610 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-02 14:24:59,610 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-02 14:24:59,610 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-02 14:24:59,610 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-02 14:24:59,610 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-02 14:24:59,610 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-02 14:24:59,610 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-02 14:24:59,611 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-02 14:24:59,611 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-02 14:24:59,611 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-02 14:24:59,611 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-02 14:24:59,611 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-02 14:24:59,611 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-02 14:24:59,612 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-02 14:24:59,612 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-02 14:24:59,612 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-02 14:24:59,612 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-02 14:24:59,612 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-02 14:24:59,612 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-02 14:24:59,613 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-02 14:24:59,613 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-02 14:24:59,721 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-02 14:24:59,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 14:24:59,722 INFO L158 Benchmark]: Toolchain (without parser) took 30425.19ms. Allocated memory was 176.2MB in the beginning and 497.0MB in the end (delta: 320.9MB). Free memory was 143.1MB in the beginning and 408.8MB in the end (delta: -265.7MB). Peak memory consumption was 301.9MB. Max. memory is 16.1GB. [2021-11-02 14:24:59,723 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 46.5MB in the beginning and 46.4MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 14:24:59,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 785.95ms. Allocated memory is still 176.2MB. Free memory was 143.1MB in the beginning and 95.4MB in the end (delta: 47.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2021-11-02 14:24:59,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.76ms. Allocated memory is still 176.2MB. Free memory was 95.4MB in the beginning and 89.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-02 14:24:59,726 INFO L158 Benchmark]: Boogie Preprocessor took 98.67ms. Allocated memory is still 176.2MB. Free memory was 89.2MB in the beginning and 82.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-02 14:24:59,726 INFO L158 Benchmark]: RCFGBuilder took 685.58ms. Allocated memory is still 176.2MB. Free memory was 82.9MB in the beginning and 130.6MB in the end (delta: -47.7MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2021-11-02 14:24:59,727 INFO L158 Benchmark]: TraceAbstraction took 28592.54ms. Allocated memory was 176.2MB in the beginning and 497.0MB in the end (delta: 320.9MB). Free memory was 129.5MB in the beginning and 177.1MB in the end (delta: -47.6MB). Peak memory consumption was 293.3MB. Max. memory is 16.1GB. [2021-11-02 14:24:59,727 INFO L158 Benchmark]: Witness Printer took 164.89ms. Allocated memory is still 497.0MB. Free memory was 177.1MB in the beginning and 408.8MB in the end (delta: -231.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-02 14:24:59,734 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.18ms. Allocated memory is still 88.1MB. Free memory was 46.5MB in the beginning and 46.4MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 785.95ms. Allocated memory is still 176.2MB. Free memory was 143.1MB in the beginning and 95.4MB in the end (delta: 47.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.76ms. Allocated memory is still 176.2MB. Free memory was 95.4MB in the beginning and 89.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.67ms. Allocated memory is still 176.2MB. Free memory was 89.2MB in the beginning and 82.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 685.58ms. Allocated memory is still 176.2MB. Free memory was 82.9MB in the beginning and 130.6MB in the end (delta: -47.7MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28592.54ms. Allocated memory was 176.2MB in the beginning and 497.0MB in the end (delta: 320.9MB). Free memory was 129.5MB in the beginning and 177.1MB in the end (delta: -47.6MB). Peak memory consumption was 293.3MB. Max. memory is 16.1GB. * Witness Printer took 164.89ms. Allocated memory is still 497.0MB. Free memory was 177.1MB in the beginning and 408.8MB in the end (delta: -231.7MB). Peak memory consumption was 14.7MB. 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: 28479.98ms, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 27.41ms, AutomataDifference: 15570.36ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 9116.64ms, InitialAbstractionConstructionTime: 12.13ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5585 SdHoareTripleChecker+Valid, 13689.68ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5585 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 11750.10ms 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, 44.97ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 387.03ms 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: 873.73ms AutomataMinimizationTime, 21 MinimizatonAttempts, 8386 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 207 NumberOfFragments, 2556 HoareAnnotationTreeSize, 68 FomulaSimplifications, 587755580 FormulaSimplificationTreeSizeReduction, 3318.00ms HoareSimplificationTime, 68 FomulaSimplificationsInter, 2953730 FormulaSimplificationTreeSizeReductionInter, 5774.17ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 142.80ms SsaConstructionTime, 809.14ms SatisfiabilityAnalysisTime, 1318.24ms 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-02 14:24:59,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE