./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer --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 16535637a9f2a86a18ba3e1653b0268771f12039 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:00:07,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:00:07,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:00:07,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:00:07,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:00:07,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:00:07,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:00:07,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:00:07,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:00:07,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:00:07,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:00:07,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:00:07,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:00:07,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:00:07,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:00:07,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:00:07,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:00:07,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:00:07,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:00:07,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:00:07,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:00:07,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:00:07,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:00:07,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:00:07,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:00:07,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:00:07,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:00:07,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:00:07,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:00:07,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:00:07,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:00:07,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:00:07,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:00:07,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:00:07,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:00:07,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:00:07,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:00:07,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:00:07,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:00:07,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:00:07,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:00:07,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-11-30 00:00:07,583 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:00:07,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:00:07,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:00:07,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:00:07,586 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:00:07,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:00:07,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:00:07,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:00:07,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:00:07,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:00:07,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:00:07,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:00:07,589 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:00:07,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:00:07,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:00:07,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:00:07,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:00:07,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:00:07,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:00:07,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:00:07,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:00:07,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:00:07,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:00:07,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:00:07,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:00:07,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:00:07,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 00:00:07,593 INFO L138 SettingsManager]: * To the following directory=dump/ WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer 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 -> 16535637a9f2a86a18ba3e1653b0268771f12039 [2020-11-30 00:00:07,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:00:07,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:00:07,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:00:07,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:00:07,988 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:00:07,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2020-11-30 00:00:08,126 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/data/736144a3f/d32b195c54e840d599d7e142ec90e56b/FLAGaebae6e81 [2020-11-30 00:00:09,234 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:00:09,235 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2020-11-30 00:00:09,294 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/data/736144a3f/d32b195c54e840d599d7e142ec90e56b/FLAGaebae6e81 [2020-11-30 00:00:09,724 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/data/736144a3f/d32b195c54e840d599d7e142ec90e56b [2020-11-30 00:00:09,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:00:09,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:00:09,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:00:09,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:00:09,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:00:09,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:00:09" (1/1) ... [2020-11-30 00:00:09,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71938811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:09, skipping insertion in model container [2020-11-30 00:00:09,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:00:09" (1/1) ... [2020-11-30 00:00:09,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:00:09,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:00:11,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:00:11,165 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:00:11,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:00:11,508 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:00:11,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11 WrapperNode [2020-11-30 00:00:11,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:00:11,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:00:11,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:00:11,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:00:11,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:00:11,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:00:11,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:00:11,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:00:11,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... [2020-11-30 00:00:11,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:00:11,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:00:11,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:00:11,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:00:11,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:00:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 00:00:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:00:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:00:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 00:00:12,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:00:12,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 00:00:12,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:00:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:00:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 00:00:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:00:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:00:12,568 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-30 00:00:16,131 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2020-11-30 00:00:16,131 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2020-11-30 00:00:16,148 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:00:16,148 INFO L298 CfgBuilder]: Removed 147 assume(true) statements. [2020-11-30 00:00:16,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:00:16 BoogieIcfgContainer [2020-11-30 00:00:16,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:00:16,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:00:16,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:00:16,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:00:16,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:00:09" (1/3) ... [2020-11-30 00:00:16,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38759f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:00:16, skipping insertion in model container [2020-11-30 00:00:16,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:11" (2/3) ... [2020-11-30 00:00:16,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38759f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:00:16, skipping insertion in model container [2020-11-30 00:00:16,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:00:16" (3/3) ... [2020-11-30 00:00:16,165 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2020-11-30 00:00:16,178 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:00:16,187 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-30 00:00:16,201 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-30 00:00:16,244 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:00:16,244 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:00:16,244 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:00:16,244 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:00:16,245 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:00:16,245 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:00:16,245 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:00:16,245 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:00:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2020-11-30 00:00:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:00:16,278 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:16,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:16,280 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:16,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1339378701, now seen corresponding path program 1 times [2020-11-30 00:00:16,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:16,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149828857] [2020-11-30 00:00:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:16,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149828857] [2020-11-30 00:00:16,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:16,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:00:16,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989140092] [2020-11-30 00:00:16,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:16,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:16,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:16,902 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2020-11-30 00:00:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:17,056 INFO L93 Difference]: Finished difference Result 398 states and 563 transitions. [2020-11-30 00:00:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:17,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-30 00:00:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:17,094 INFO L225 Difference]: With dead ends: 398 [2020-11-30 00:00:17,094 INFO L226 Difference]: Without dead ends: 246 [2020-11-30 00:00:17,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-11-30 00:00:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2020-11-30 00:00:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-30 00:00:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 285 transitions. [2020-11-30 00:00:17,208 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 285 transitions. Word has length 13 [2020-11-30 00:00:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:17,209 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 285 transitions. [2020-11-30 00:00:17,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 285 transitions. [2020-11-30 00:00:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:00:17,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:17,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:17,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:00:17,211 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1430290095, now seen corresponding path program 1 times [2020-11-30 00:00:17,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:17,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163642027] [2020-11-30 00:00:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:17,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163642027] [2020-11-30 00:00:17,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:17,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:00:17,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138316584] [2020-11-30 00:00:17,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:17,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:17,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:17,434 INFO L87 Difference]: Start difference. First operand 230 states and 285 transitions. Second operand 3 states. [2020-11-30 00:00:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:17,513 INFO L93 Difference]: Finished difference Result 664 states and 826 transitions. [2020-11-30 00:00:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:17,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-30 00:00:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:17,524 INFO L225 Difference]: With dead ends: 664 [2020-11-30 00:00:17,524 INFO L226 Difference]: Without dead ends: 440 [2020-11-30 00:00:17,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-30 00:00:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 416. [2020-11-30 00:00:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-11-30 00:00:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 522 transitions. [2020-11-30 00:00:17,577 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 522 transitions. Word has length 14 [2020-11-30 00:00:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:17,577 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 522 transitions. [2020-11-30 00:00:17,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 522 transitions. [2020-11-30 00:00:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 00:00:17,582 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:17,582 INFO L422 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] [2020-11-30 00:00:17,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:00:17,583 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash 686850099, now seen corresponding path program 1 times [2020-11-30 00:00:17,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:17,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719907076] [2020-11-30 00:00:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:17,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719907076] [2020-11-30 00:00:17,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:17,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:00:17,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064430773] [2020-11-30 00:00:17,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:00:17,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:17,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:00:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:17,813 INFO L87 Difference]: Start difference. First operand 416 states and 522 transitions. Second operand 5 states. [2020-11-30 00:00:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:18,222 INFO L93 Difference]: Finished difference Result 950 states and 1220 transitions. [2020-11-30 00:00:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:00:18,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-11-30 00:00:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:18,230 INFO L225 Difference]: With dead ends: 950 [2020-11-30 00:00:18,230 INFO L226 Difference]: Without dead ends: 541 [2020-11-30 00:00:18,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-11-30 00:00:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 487. [2020-11-30 00:00:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-11-30 00:00:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 623 transitions. [2020-11-30 00:00:18,311 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 623 transitions. Word has length 30 [2020-11-30 00:00:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:18,311 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 623 transitions. [2020-11-30 00:00:18,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:00:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 623 transitions. [2020-11-30 00:00:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 00:00:18,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:18,315 INFO L422 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] [2020-11-30 00:00:18,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:00:18,315 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1666411630, now seen corresponding path program 1 times [2020-11-30 00:00:18,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:18,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866264300] [2020-11-30 00:00:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:18,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866264300] [2020-11-30 00:00:18,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:18,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:00:18,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117347470] [2020-11-30 00:00:18,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:00:18,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:18,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:00:18,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:18,586 INFO L87 Difference]: Start difference. First operand 487 states and 623 transitions. Second operand 7 states. [2020-11-30 00:00:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:19,591 INFO L93 Difference]: Finished difference Result 3003 states and 3805 transitions. [2020-11-30 00:00:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 00:00:19,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-11-30 00:00:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:19,610 INFO L225 Difference]: With dead ends: 3003 [2020-11-30 00:00:19,611 INFO L226 Difference]: Without dead ends: 2525 [2020-11-30 00:00:19,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:00:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2020-11-30 00:00:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 531. [2020-11-30 00:00:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2020-11-30 00:00:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 671 transitions. [2020-11-30 00:00:19,739 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 671 transitions. Word has length 48 [2020-11-30 00:00:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:19,740 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 671 transitions. [2020-11-30 00:00:19,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:00:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2020-11-30 00:00:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 00:00:19,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:19,754 INFO L422 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] [2020-11-30 00:00:19,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:00:19,755 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1941171244, now seen corresponding path program 1 times [2020-11-30 00:00:19,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:19,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480817349] [2020-11-30 00:00:19,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:19,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480817349] [2020-11-30 00:00:19,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:19,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:00:19,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87133483] [2020-11-30 00:00:19,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:00:19,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:19,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:00:19,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:19,946 INFO L87 Difference]: Start difference. First operand 531 states and 671 transitions. Second operand 5 states. [2020-11-30 00:00:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:20,532 INFO L93 Difference]: Finished difference Result 2850 states and 3578 transitions. [2020-11-30 00:00:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:00:20,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-11-30 00:00:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:20,554 INFO L225 Difference]: With dead ends: 2850 [2020-11-30 00:00:20,554 INFO L226 Difference]: Without dead ends: 2571 [2020-11-30 00:00:20,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:00:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2020-11-30 00:00:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 543. [2020-11-30 00:00:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-11-30 00:00:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 683 transitions. [2020-11-30 00:00:20,693 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 683 transitions. Word has length 48 [2020-11-30 00:00:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:20,694 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 683 transitions. [2020-11-30 00:00:20,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:00:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 683 transitions. [2020-11-30 00:00:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 00:00:20,696 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:20,696 INFO L422 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] [2020-11-30 00:00:20,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:00:20,697 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:20,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash 352823342, now seen corresponding path program 1 times [2020-11-30 00:00:20,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:20,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126733268] [2020-11-30 00:00:20,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:20,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126733268] [2020-11-30 00:00:20,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:20,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:00:20,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914306379] [2020-11-30 00:00:20,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:00:20,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:00:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:20,946 INFO L87 Difference]: Start difference. First operand 543 states and 683 transitions. Second operand 7 states. [2020-11-30 00:00:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:21,403 INFO L93 Difference]: Finished difference Result 1188 states and 1485 transitions. [2020-11-30 00:00:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 00:00:21,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-11-30 00:00:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:21,415 INFO L225 Difference]: With dead ends: 1188 [2020-11-30 00:00:21,419 INFO L226 Difference]: Without dead ends: 903 [2020-11-30 00:00:21,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:00:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-11-30 00:00:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 547. [2020-11-30 00:00:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-11-30 00:00:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 687 transitions. [2020-11-30 00:00:21,517 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 687 transitions. Word has length 48 [2020-11-30 00:00:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:21,519 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 687 transitions. [2020-11-30 00:00:21,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:00:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 687 transitions. [2020-11-30 00:00:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-30 00:00:21,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:21,529 INFO L422 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] [2020-11-30 00:00:21,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:00:21,530 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:21,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1556101667, now seen corresponding path program 1 times [2020-11-30 00:00:21,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:21,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024592139] [2020-11-30 00:00:21,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:21,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024592139] [2020-11-30 00:00:21,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:21,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:00:21,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347710178] [2020-11-30 00:00:21,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:00:21,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:00:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:21,754 INFO L87 Difference]: Start difference. First operand 547 states and 687 transitions. Second operand 5 states. [2020-11-30 00:00:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:22,387 INFO L93 Difference]: Finished difference Result 2958 states and 3705 transitions. [2020-11-30 00:00:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:00:22,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-11-30 00:00:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:22,407 INFO L225 Difference]: With dead ends: 2958 [2020-11-30 00:00:22,407 INFO L226 Difference]: Without dead ends: 2671 [2020-11-30 00:00:22,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:00:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2020-11-30 00:00:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 559. [2020-11-30 00:00:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-11-30 00:00:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 699 transitions. [2020-11-30 00:00:22,525 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 699 transitions. Word has length 53 [2020-11-30 00:00:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:22,528 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 699 transitions. [2020-11-30 00:00:22,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:00:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 699 transitions. [2020-11-30 00:00:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-30 00:00:22,531 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:22,532 INFO L422 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] [2020-11-30 00:00:22,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:00:22,532 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 855037089, now seen corresponding path program 1 times [2020-11-30 00:00:22,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:22,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103738654] [2020-11-30 00:00:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:22,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103738654] [2020-11-30 00:00:22,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:22,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:00:22,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580129340] [2020-11-30 00:00:22,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:22,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:22,758 INFO L87 Difference]: Start difference. First operand 559 states and 699 transitions. Second operand 4 states. [2020-11-30 00:00:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:22,895 INFO L93 Difference]: Finished difference Result 1185 states and 1483 transitions. [2020-11-30 00:00:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:22,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-30 00:00:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:22,901 INFO L225 Difference]: With dead ends: 1185 [2020-11-30 00:00:22,901 INFO L226 Difference]: Without dead ends: 635 [2020-11-30 00:00:22,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-11-30 00:00:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 388. [2020-11-30 00:00:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-11-30 00:00:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 479 transitions. [2020-11-30 00:00:22,977 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 479 transitions. Word has length 53 [2020-11-30 00:00:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:22,978 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 479 transitions. [2020-11-30 00:00:22,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 479 transitions. [2020-11-30 00:00:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-30 00:00:22,979 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:22,979 INFO L422 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] [2020-11-30 00:00:22,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:00:22,980 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash -615051935, now seen corresponding path program 1 times [2020-11-30 00:00:22,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:22,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698674389] [2020-11-30 00:00:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:23,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698674389] [2020-11-30 00:00:23,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:23,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:23,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683457349] [2020-11-30 00:00:23,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:23,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:23,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:23,175 INFO L87 Difference]: Start difference. First operand 388 states and 479 transitions. Second operand 4 states. [2020-11-30 00:00:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:25,626 INFO L93 Difference]: Finished difference Result 688 states and 846 transitions. [2020-11-30 00:00:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:25,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-30 00:00:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:25,634 INFO L225 Difference]: With dead ends: 688 [2020-11-30 00:00:25,634 INFO L226 Difference]: Without dead ends: 680 [2020-11-30 00:00:25,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-11-30 00:00:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 646. [2020-11-30 00:00:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-11-30 00:00:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 807 transitions. [2020-11-30 00:00:25,758 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 807 transitions. Word has length 53 [2020-11-30 00:00:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:25,760 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 807 transitions. [2020-11-30 00:00:25,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 807 transitions. [2020-11-30 00:00:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 00:00:25,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:25,766 INFO L422 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] [2020-11-30 00:00:25,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:00:25,766 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash 228612034, now seen corresponding path program 1 times [2020-11-30 00:00:25,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:25,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241476531] [2020-11-30 00:00:25,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:25,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241476531] [2020-11-30 00:00:25,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:25,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:00:25,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148082748] [2020-11-30 00:00:25,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:00:25,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:25,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:00:25,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:25,941 INFO L87 Difference]: Start difference. First operand 646 states and 807 transitions. Second operand 5 states. [2020-11-30 00:00:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:28,201 INFO L93 Difference]: Finished difference Result 1311 states and 1628 transitions. [2020-11-30 00:00:28,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:00:28,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-11-30 00:00:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:28,207 INFO L225 Difference]: With dead ends: 1311 [2020-11-30 00:00:28,207 INFO L226 Difference]: Without dead ends: 653 [2020-11-30 00:00:28,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-11-30 00:00:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 592. [2020-11-30 00:00:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-11-30 00:00:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 739 transitions. [2020-11-30 00:00:28,345 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 739 transitions. Word has length 54 [2020-11-30 00:00:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:28,345 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 739 transitions. [2020-11-30 00:00:28,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:00:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 739 transitions. [2020-11-30 00:00:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-30 00:00:28,346 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:28,346 INFO L422 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] [2020-11-30 00:00:28,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:00:28,347 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:28,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash 351778938, now seen corresponding path program 1 times [2020-11-30 00:00:28,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:28,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326928495] [2020-11-30 00:00:28,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:28,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326928495] [2020-11-30 00:00:28,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:28,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:00:28,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534057811] [2020-11-30 00:00:28,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:00:28,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:28,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:00:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:28,522 INFO L87 Difference]: Start difference. First operand 592 states and 739 transitions. Second operand 7 states. [2020-11-30 00:00:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:28,978 INFO L93 Difference]: Finished difference Result 889 states and 1101 transitions. [2020-11-30 00:00:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 00:00:28,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2020-11-30 00:00:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:28,985 INFO L225 Difference]: With dead ends: 889 [2020-11-30 00:00:28,986 INFO L226 Difference]: Without dead ends: 857 [2020-11-30 00:00:28,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:00:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2020-11-30 00:00:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 596. [2020-11-30 00:00:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2020-11-30 00:00:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2020-11-30 00:00:29,115 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 60 [2020-11-30 00:00:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:29,115 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2020-11-30 00:00:29,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:00:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2020-11-30 00:00:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-30 00:00:29,116 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:29,117 INFO L422 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] [2020-11-30 00:00:29,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:00:29,117 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:29,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:29,118 INFO L82 PathProgramCache]: Analyzing trace with hash -511022652, now seen corresponding path program 1 times [2020-11-30 00:00:29,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:29,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574561545] [2020-11-30 00:00:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:29,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574561545] [2020-11-30 00:00:29,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:29,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:29,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047291840] [2020-11-30 00:00:29,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:29,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:29,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:29,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:29,309 INFO L87 Difference]: Start difference. First operand 596 states and 743 transitions. Second operand 3 states. [2020-11-30 00:00:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:29,493 INFO L93 Difference]: Finished difference Result 1192 states and 1475 transitions. [2020-11-30 00:00:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:29,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-30 00:00:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:29,499 INFO L225 Difference]: With dead ends: 1192 [2020-11-30 00:00:29,499 INFO L226 Difference]: Without dead ends: 633 [2020-11-30 00:00:29,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-11-30 00:00:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 568. [2020-11-30 00:00:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2020-11-30 00:00:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 697 transitions. [2020-11-30 00:00:29,625 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 697 transitions. Word has length 61 [2020-11-30 00:00:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:29,626 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 697 transitions. [2020-11-30 00:00:29,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 697 transitions. [2020-11-30 00:00:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-30 00:00:29,627 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:29,627 INFO L422 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] [2020-11-30 00:00:29,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:00:29,628 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:29,629 INFO L82 PathProgramCache]: Analyzing trace with hash -206387521, now seen corresponding path program 1 times [2020-11-30 00:00:29,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:29,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312656319] [2020-11-30 00:00:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:29,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312656319] [2020-11-30 00:00:29,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:29,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:00:29,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808395018] [2020-11-30 00:00:29,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:00:29,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:29,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:00:29,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:29,940 INFO L87 Difference]: Start difference. First operand 568 states and 697 transitions. Second operand 5 states. [2020-11-30 00:00:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:30,132 INFO L93 Difference]: Finished difference Result 1130 states and 1387 transitions. [2020-11-30 00:00:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:00:30,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-11-30 00:00:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:30,137 INFO L225 Difference]: With dead ends: 1130 [2020-11-30 00:00:30,137 INFO L226 Difference]: Without dead ends: 568 [2020-11-30 00:00:30,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-11-30 00:00:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2020-11-30 00:00:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2020-11-30 00:00:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 696 transitions. [2020-11-30 00:00:30,264 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 696 transitions. Word has length 63 [2020-11-30 00:00:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:30,265 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 696 transitions. [2020-11-30 00:00:30,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:00:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 696 transitions. [2020-11-30 00:00:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-30 00:00:30,266 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:30,266 INFO L422 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] [2020-11-30 00:00:30,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:00:30,267 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:30,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:30,267 INFO L82 PathProgramCache]: Analyzing trace with hash 227341565, now seen corresponding path program 1 times [2020-11-30 00:00:30,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:30,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984982256] [2020-11-30 00:00:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:30,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984982256] [2020-11-30 00:00:30,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:30,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:30,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593686146] [2020-11-30 00:00:30,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:30,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:30,537 INFO L87 Difference]: Start difference. First operand 568 states and 696 transitions. Second operand 4 states. [2020-11-30 00:00:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:32,950 INFO L93 Difference]: Finished difference Result 1566 states and 1928 transitions. [2020-11-30 00:00:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:32,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-30 00:00:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:32,960 INFO L225 Difference]: With dead ends: 1566 [2020-11-30 00:00:32,960 INFO L226 Difference]: Without dead ends: 1208 [2020-11-30 00:00:32,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-11-30 00:00:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 955. [2020-11-30 00:00:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2020-11-30 00:00:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1181 transitions. [2020-11-30 00:00:33,151 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1181 transitions. Word has length 63 [2020-11-30 00:00:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:33,151 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 1181 transitions. [2020-11-30 00:00:33,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1181 transitions. [2020-11-30 00:00:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-30 00:00:33,153 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:33,153 INFO L422 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] [2020-11-30 00:00:33,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:00:33,153 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:33,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1575329075, now seen corresponding path program 1 times [2020-11-30 00:00:33,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:33,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113903297] [2020-11-30 00:00:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:33,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113903297] [2020-11-30 00:00:33,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:33,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:00:33,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365276023] [2020-11-30 00:00:33,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:33,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:33,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:33,313 INFO L87 Difference]: Start difference. First operand 955 states and 1181 transitions. Second operand 4 states. [2020-11-30 00:00:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:33,488 INFO L93 Difference]: Finished difference Result 1443 states and 1773 transitions. [2020-11-30 00:00:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:33,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-11-30 00:00:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:33,494 INFO L225 Difference]: With dead ends: 1443 [2020-11-30 00:00:33,494 INFO L226 Difference]: Without dead ends: 565 [2020-11-30 00:00:33,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-11-30 00:00:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 538. [2020-11-30 00:00:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-11-30 00:00:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 655 transitions. [2020-11-30 00:00:33,596 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 655 transitions. Word has length 69 [2020-11-30 00:00:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:33,597 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 655 transitions. [2020-11-30 00:00:33,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 655 transitions. [2020-11-30 00:00:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-30 00:00:33,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:33,598 INFO L422 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] [2020-11-30 00:00:33,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:00:33,599 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash -773777933, now seen corresponding path program 1 times [2020-11-30 00:00:33,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:33,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579459162] [2020-11-30 00:00:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:33,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579459162] [2020-11-30 00:00:33,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:33,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:33,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189203845] [2020-11-30 00:00:33,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:33,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:33,805 INFO L87 Difference]: Start difference. First operand 538 states and 655 transitions. Second operand 4 states. [2020-11-30 00:00:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:36,074 INFO L93 Difference]: Finished difference Result 897 states and 1088 transitions. [2020-11-30 00:00:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:36,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-11-30 00:00:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:36,081 INFO L225 Difference]: With dead ends: 897 [2020-11-30 00:00:36,082 INFO L226 Difference]: Without dead ends: 884 [2020-11-30 00:00:36,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2020-11-30 00:00:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 795. [2020-11-30 00:00:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-11-30 00:00:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 982 transitions. [2020-11-30 00:00:36,264 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 982 transitions. Word has length 69 [2020-11-30 00:00:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:36,264 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 982 transitions. [2020-11-30 00:00:36,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 982 transitions. [2020-11-30 00:00:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-30 00:00:36,265 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:36,266 INFO L422 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] [2020-11-30 00:00:36,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:00:36,266 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1556043786, now seen corresponding path program 1 times [2020-11-30 00:00:36,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:36,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677837750] [2020-11-30 00:00:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:36,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677837750] [2020-11-30 00:00:36,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:36,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:00:36,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775556034] [2020-11-30 00:00:36,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:36,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:36,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:36,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:36,434 INFO L87 Difference]: Start difference. First operand 795 states and 982 transitions. Second operand 4 states. [2020-11-30 00:00:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:36,643 INFO L93 Difference]: Finished difference Result 939 states and 1158 transitions. [2020-11-30 00:00:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:36,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-11-30 00:00:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:36,650 INFO L225 Difference]: With dead ends: 939 [2020-11-30 00:00:36,650 INFO L226 Difference]: Without dead ends: 926 [2020-11-30 00:00:36,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2020-11-30 00:00:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 799. [2020-11-30 00:00:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-11-30 00:00:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 982 transitions. [2020-11-30 00:00:36,836 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 982 transitions. Word has length 70 [2020-11-30 00:00:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:36,837 INFO L481 AbstractCegarLoop]: Abstraction has 799 states and 982 transitions. [2020-11-30 00:00:36,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 982 transitions. [2020-11-30 00:00:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 00:00:36,838 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:36,839 INFO L422 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, 1, 1] [2020-11-30 00:00:36,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:00:36,839 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1441624065, now seen corresponding path program 1 times [2020-11-30 00:00:36,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:36,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514890091] [2020-11-30 00:00:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:37,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514890091] [2020-11-30 00:00:37,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588737433] [2020-11-30 00:00:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:37,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:00:37,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:37,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:00:37,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-11-30 00:00:37,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392484267] [2020-11-30 00:00:37,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:37,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:37,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:37,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:37,697 INFO L87 Difference]: Start difference. First operand 799 states and 982 transitions. Second operand 4 states. [2020-11-30 00:00:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:37,906 INFO L93 Difference]: Finished difference Result 1154 states and 1428 transitions. [2020-11-30 00:00:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:37,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-30 00:00:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:37,910 INFO L225 Difference]: With dead ends: 1154 [2020-11-30 00:00:37,911 INFO L226 Difference]: Without dead ends: 387 [2020-11-30 00:00:37,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-11-30 00:00:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 355. [2020-11-30 00:00:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-11-30 00:00:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 412 transitions. [2020-11-30 00:00:38,035 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 412 transitions. Word has length 74 [2020-11-30 00:00:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:38,035 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 412 transitions. [2020-11-30 00:00:38,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 412 transitions. [2020-11-30 00:00:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-30 00:00:38,037 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:38,037 INFO L422 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] [2020-11-30 00:00:38,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-11-30 00:00:38,252 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1443427930, now seen corresponding path program 1 times [2020-11-30 00:00:38,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:38,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772212512] [2020-11-30 00:00:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:38,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772212512] [2020-11-30 00:00:38,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:38,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:38,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240346746] [2020-11-30 00:00:38,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:38,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:38,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:38,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:38,524 INFO L87 Difference]: Start difference. First operand 355 states and 412 transitions. Second operand 3 states. [2020-11-30 00:00:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:38,626 INFO L93 Difference]: Finished difference Result 588 states and 682 transitions. [2020-11-30 00:00:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:38,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-11-30 00:00:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:38,629 INFO L225 Difference]: With dead ends: 588 [2020-11-30 00:00:38,629 INFO L226 Difference]: Without dead ends: 278 [2020-11-30 00:00:38,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-11-30 00:00:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2020-11-30 00:00:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-11-30 00:00:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2020-11-30 00:00:38,703 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 83 [2020-11-30 00:00:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:38,704 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2020-11-30 00:00:38,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2020-11-30 00:00:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-30 00:00:38,709 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:38,709 INFO L422 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, 1, 1] [2020-11-30 00:00:38,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 00:00:38,710 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash -736644159, now seen corresponding path program 1 times [2020-11-30 00:00:38,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:38,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143646055] [2020-11-30 00:00:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:39,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143646055] [2020-11-30 00:00:39,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:39,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:39,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986062537] [2020-11-30 00:00:39,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:39,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:39,334 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand 4 states. [2020-11-30 00:00:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:41,711 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2020-11-30 00:00:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:41,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2020-11-30 00:00:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:41,713 INFO L225 Difference]: With dead ends: 282 [2020-11-30 00:00:41,714 INFO L226 Difference]: Without dead ends: 224 [2020-11-30 00:00:41,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-11-30 00:00:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2020-11-30 00:00:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-30 00:00:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2020-11-30 00:00:41,753 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 85 [2020-11-30 00:00:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:41,754 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2020-11-30 00:00:41,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2020-11-30 00:00:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-11-30 00:00:41,755 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:41,756 INFO L422 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, 1, 1] [2020-11-30 00:00:41,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 00:00:41,756 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:00:41,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1558509527, now seen corresponding path program 1 times [2020-11-30 00:00:41,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:41,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451291877] [2020-11-30 00:00:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:42,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451291877] [2020-11-30 00:00:42,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:42,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:00:42,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134704427] [2020-11-30 00:00:42,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:00:42,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:00:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:42,226 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 5 states. [2020-11-30 00:00:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:44,406 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2020-11-30 00:00:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:00:44,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2020-11-30 00:00:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:44,407 INFO L225 Difference]: With dead ends: 140 [2020-11-30 00:00:44,407 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 00:00:44,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 00:00:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 00:00:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 00:00:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 00:00:44,409 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2020-11-30 00:00:44,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:44,410 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:00:44,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:00:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:00:44,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 00:00:44,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 00:00:44,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-30 00:00:45,211 WARN L193 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 149 [2020-11-30 00:00:45,692 WARN L193 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 146 [2020-11-30 00:00:45,945 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 127 [2020-11-30 00:00:46,338 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2020-11-30 00:00:46,456 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 93 [2020-11-30 00:00:47,231 WARN L193 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 150 [2020-11-30 00:00:47,666 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2020-11-30 00:00:48,182 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 152 [2020-11-30 00:00:48,485 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 51 [2020-11-30 00:00:48,885 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 155 [2020-11-30 00:00:49,468 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 141 [2020-11-30 00:00:49,642 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2020-11-30 00:00:49,969 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 117 [2020-11-30 00:00:50,185 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2020-11-30 00:00:50,486 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2020-11-30 00:00:50,660 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 118 [2020-11-30 00:00:50,914 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 137 [2020-11-30 00:00:51,210 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2020-11-30 00:00:51,426 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2020-11-30 00:00:51,551 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2020-11-30 00:00:52,196 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2020-11-30 00:00:52,993 WARN L193 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 67 [2020-11-30 00:00:53,662 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-11-30 00:00:53,840 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2020-11-30 00:00:54,238 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 30 [2020-11-30 00:00:54,784 WARN L193 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2020-11-30 00:00:55,161 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2020-11-30 00:00:55,267 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-11-30 00:00:56,589 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 148 DAG size of output: 54 [2020-11-30 00:00:56,782 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2020-11-30 00:00:57,018 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2020-11-30 00:00:57,290 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2020-11-30 00:00:58,008 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 24 [2020-11-30 00:00:58,354 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-11-30 00:00:58,645 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2020-11-30 00:00:59,500 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2020-11-30 00:00:59,940 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 26 [2020-11-30 00:01:00,709 WARN L193 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 49 [2020-11-30 00:01:01,148 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2020-11-30 00:01:01,634 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2020-11-30 00:01:02,044 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2020-11-30 00:01:02,296 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2020-11-30 00:01:02,499 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 22 [2020-11-30 00:01:02,810 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 22 [2020-11-30 00:01:03,258 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 23 [2020-11-30 00:01:03,709 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2020-11-30 00:01:03,983 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2020-11-30 00:01:04,646 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 34 [2020-11-30 00:01:04,706 INFO L270 CegarLoopResult]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0)) [2020-11-30 00:01:04,706 INFO L274 CegarLoopResult]: For program point L4098-1(lines 4097 4116) no Hoare annotation was computed. [2020-11-30 00:01:04,706 INFO L270 CegarLoopResult]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (<= (+ .cse4 1) 0) (< (* 18446744073709551616 .cse4) .cse5)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0))))) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3))) [2020-11-30 00:01:04,706 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,707 INFO L270 CegarLoopResult]: At program point L3471(lines 3465 3473) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,707 INFO L270 CegarLoopResult]: At program point L4264-1(lines 1 4266) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0))))) [2020-11-30 00:01:04,707 INFO L274 CegarLoopResult]: For program point L4264(lines 4264 4266) no Hoare annotation was computed. [2020-11-30 00:01:04,707 INFO L274 CegarLoopResult]: For program point L4099-1(lines 4097 4116) no Hoare annotation was computed. [2020-11-30 00:01:04,707 INFO L274 CegarLoopResult]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2020-11-30 00:01:04,707 INFO L274 CegarLoopResult]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2020-11-30 00:01:04,707 INFO L270 CegarLoopResult]: At program point L3439-1(lines 3433 3441) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,708 INFO L270 CegarLoopResult]: At program point L3439(lines 3433 3441) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,708 INFO L270 CegarLoopResult]: At program point L4233(lines 4008 4011) the Hoare annotation is: (let ((.cse5 (= ~ldv_urb_state~0 0)) (.cse6 (= ~ldv_coherent_state~0 0)) (.cse0 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 .cse2 .cse3 (= 0 ~res_kbtab_probe_3~0) .cse4 (<= ~ldv_urb_state~0 1)) (and (<= (+ ~res_kbtab_probe_3~0 12) 0) (<= (+ |ULTIMATE.start_kbtab_probe_#res| 12) 0) .cse5 .cse6 .cse0 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse2) (and .cse5 .cse6 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse0 (or (<= 1 ~res_kbtab_probe_3~0) (<= (+ ~res_kbtab_probe_3~0 1) 0)) .cse1 (or (<= (+ |ULTIMATE.start_kbtab_probe_#res| 1) 0) (<= 1 |ULTIMATE.start_kbtab_probe_#res|)) .cse2 .cse3 .cse4 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) (let ((.cse10 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (< (* 18446744073709551616 .cse9) .cse10) (<= (+ .cse9 1) 0))))))) [2020-11-30 00:01:04,708 INFO L274 CegarLoopResult]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2020-11-30 00:01:04,708 INFO L274 CegarLoopResult]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2020-11-30 00:01:04,709 INFO L270 CegarLoopResult]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= 0 ~res_kbtab_probe_3~0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 .cse3 (or (<= (+ |ULTIMATE.start_kbtab_probe_#res| 1) 0) (<= 1 |ULTIMATE.start_kbtab_probe_#res|)) .cse4 .cse5 .cse6 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) .cse9 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))) (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 (<= ~ldv_urb_state~0 1)) (and (<= (+ |ULTIMATE.start_kbtab_probe_#res| 12) 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4))) [2020-11-30 00:01:04,709 INFO L270 CegarLoopResult]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,709 INFO L274 CegarLoopResult]: For program point L4203(line 4203) no Hoare annotation was computed. [2020-11-30 00:01:04,709 INFO L270 CegarLoopResult]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,709 INFO L274 CegarLoopResult]: For program point L4203-4(line 4203) no Hoare annotation was computed. [2020-11-30 00:01:04,710 INFO L274 CegarLoopResult]: For program point L4203-2(line 4203) no Hoare annotation was computed. [2020-11-30 00:01:04,710 INFO L274 CegarLoopResult]: For program point L4203-8(line 4203) no Hoare annotation was computed. [2020-11-30 00:01:04,710 INFO L274 CegarLoopResult]: For program point L4203-6(line 4203) no Hoare annotation was computed. [2020-11-30 00:01:04,710 INFO L270 CegarLoopResult]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,710 INFO L270 CegarLoopResult]: At program point L3411-1(lines 3405 3413) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,710 INFO L270 CegarLoopResult]: At program point L3411(lines 3405 3413) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and (= |ULTIMATE.start_kmalloc_#res.base| 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 (= |ULTIMATE.start_kzalloc_#res.base| 0) (= |ULTIMATE.start_kzalloc_#res.offset| 0) (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,710 INFO L270 CegarLoopResult]: At program point L4204-1(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,710 INFO L270 CegarLoopResult]: At program point L4204-2(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 .cse4))) [2020-11-30 00:01:04,710 INFO L270 CegarLoopResult]: At program point L4204(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,710 INFO L270 CegarLoopResult]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,711 INFO L270 CegarLoopResult]: At program point L4204-3(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,711 INFO L270 CegarLoopResult]: At program point L4204-4(lines 4201 4205) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,711 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,711 INFO L274 CegarLoopResult]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2020-11-30 00:01:04,711 INFO L274 CegarLoopResult]: For program point L4106-2(lines 4106 4111) no Hoare annotation was computed. [2020-11-30 00:01:04,711 INFO L274 CegarLoopResult]: For program point L4073(line 4073) no Hoare annotation was computed. [2020-11-30 00:01:04,711 INFO L274 CegarLoopResult]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2020-11-30 00:01:04,711 INFO L270 CegarLoopResult]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,711 INFO L270 CegarLoopResult]: At program point L4239(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) .cse5))) [2020-11-30 00:01:04,712 INFO L270 CegarLoopResult]: At program point L4239-1(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,712 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,712 INFO L270 CegarLoopResult]: At program point L3513(lines 3512 3514) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,712 INFO L270 CegarLoopResult]: At program point L4207(lines 4206 4208) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,712 INFO L270 CegarLoopResult]: At program point L4207-1(lines 4206 4208) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse1 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse3 .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)))) [2020-11-30 00:01:04,712 INFO L270 CegarLoopResult]: At program point L4174(lines 4150 4179) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,712 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,712 INFO L270 CegarLoopResult]: At program point L4174-1(lines 4150 4179) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,712 INFO L274 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-6(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-7(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-8(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-10(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-11(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-12(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-14(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-15(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-16(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-18(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-19(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point L12-20(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,713 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,714 INFO L274 CegarLoopResult]: For program point L12-22(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,714 INFO L274 CegarLoopResult]: For program point L12-23(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,714 INFO L270 CegarLoopResult]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2020-11-30 00:01:04,714 INFO L274 CegarLoopResult]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2020-11-30 00:01:04,714 INFO L274 CegarLoopResult]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2020-11-30 00:01:04,714 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,714 INFO L270 CegarLoopResult]: At program point L4210(lines 4209 4211) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,714 INFO L274 CegarLoopResult]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2020-11-30 00:01:04,714 INFO L274 CegarLoopResult]: For program point L4046(lines 1 4266) no Hoare annotation was computed. [2020-11-30 00:01:04,715 INFO L274 CegarLoopResult]: For program point L4046-2(lines 1 4266) no Hoare annotation was computed. [2020-11-30 00:01:04,715 INFO L274 CegarLoopResult]: For program point L4046-1(lines 1 4266) no Hoare annotation was computed. [2020-11-30 00:01:04,715 INFO L274 CegarLoopResult]: For program point L4046-4(lines 4190 4195) no Hoare annotation was computed. [2020-11-30 00:01:04,715 INFO L274 CegarLoopResult]: For program point L4046-3(lines 1 4266) no Hoare annotation was computed. [2020-11-30 00:01:04,715 INFO L270 CegarLoopResult]: At program point L4046-5(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2020-11-30 00:01:04,715 INFO L270 CegarLoopResult]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse13 (= 0 ~res_kbtab_probe_3~0)) (.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse6 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse8 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse2 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse10 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (let ((.cse12 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (<= (+ .cse11 1) 0) (< (* 18446744073709551616 .cse11) .cse12)))) .cse13 (let ((.cse15 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse14 (div .cse15 18446744073709551616))) (or (< (* 18446744073709551616 .cse14) .cse15) (<= (+ .cse14 1) 0))))) (and (not .cse0) (<= 1 ~ldv_urb_state~0) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse10 .cse13 (<= ~ldv_urb_state~0 1)) (and .cse0 .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse8 .cse2 .cse9 .cse10))) [2020-11-30 00:01:04,715 INFO L274 CegarLoopResult]: For program point L3981(line 3981) no Hoare annotation was computed. [2020-11-30 00:01:04,715 INFO L274 CegarLoopResult]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2020-11-30 00:01:04,716 INFO L274 CegarLoopResult]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2020-11-30 00:01:04,718 INFO L270 CegarLoopResult]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,718 INFO L270 CegarLoopResult]: At program point L4214(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,719 INFO L270 CegarLoopResult]: At program point L4214-1(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,719 INFO L270 CegarLoopResult]: At program point L4214-2(lines 4213 4215) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,719 INFO L274 CegarLoopResult]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2020-11-30 00:01:04,719 INFO L274 CegarLoopResult]: For program point L4049(line 4049) no Hoare annotation was computed. [2020-11-30 00:01:04,719 INFO L274 CegarLoopResult]: For program point L4049-3(line 4049) no Hoare annotation was computed. [2020-11-30 00:01:04,720 INFO L274 CegarLoopResult]: For program point L4049-2(line 4049) no Hoare annotation was computed. [2020-11-30 00:01:04,720 INFO L274 CegarLoopResult]: For program point L4049-5(line 4049) no Hoare annotation was computed. [2020-11-30 00:01:04,720 INFO L274 CegarLoopResult]: For program point L4049-4(line 4049) no Hoare annotation was computed. [2020-11-30 00:01:04,720 INFO L274 CegarLoopResult]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2020-11-30 00:01:04,720 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-30 00:01:04,721 INFO L270 CegarLoopResult]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,721 INFO L274 CegarLoopResult]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2020-11-30 00:01:04,721 INFO L274 CegarLoopResult]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2020-11-30 00:01:04,721 INFO L270 CegarLoopResult]: At program point L4117-1(lines 4093 4122) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0))))) [2020-11-30 00:01:04,722 INFO L270 CegarLoopResult]: At program point L4117(lines 4093 4122) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse9 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0)))))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) (= 0 ~res_kbtab_probe_3~0) .cse9) (and .cse0 .cse2 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse4 .cse5 .cse6 .cse9))) [2020-11-30 00:01:04,722 INFO L274 CegarLoopResult]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2020-11-30 00:01:04,722 INFO L274 CegarLoopResult]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2020-11-30 00:01:04,731 INFO L274 CegarLoopResult]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2020-11-30 00:01:04,732 INFO L274 CegarLoopResult]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2020-11-30 00:01:04,732 INFO L270 CegarLoopResult]: At program point L4250(lines 4184 4189) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0)) [2020-11-30 00:01:04,732 INFO L274 CegarLoopResult]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2020-11-30 00:01:04,732 INFO L274 CegarLoopResult]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2020-11-30 00:01:04,732 INFO L274 CegarLoopResult]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2020-11-30 00:01:04,733 INFO L270 CegarLoopResult]: At program point L3922(lines 3911 3924) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0))) (or (and (or (< 0 ULTIMATE.start_kbtab_init_~retval~1) (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0)) .cse0 .cse1) (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,733 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-30 00:01:04,733 INFO L270 CegarLoopResult]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,734 INFO L270 CegarLoopResult]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (<= (+ .cse4 1) 0) (< (* 18446744073709551616 .cse4) .cse5)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0))))) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3))) [2020-11-30 00:01:04,734 INFO L270 CegarLoopResult]: At program point L4154-2loopEntry(lines 4154 4173) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,734 INFO L270 CegarLoopResult]: At program point L3923(lines 3909 3925) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) (or (< 0 ULTIMATE.start_kbtab_init_~retval~1) (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0)) .cse0 .cse1))) [2020-11-30 00:01:04,734 INFO L270 CegarLoopResult]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,734 INFO L270 CegarLoopResult]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,734 INFO L274 CegarLoopResult]: For program point L4155-1(lines 4154 4173) no Hoare annotation was computed. [2020-11-30 00:01:04,734 INFO L274 CegarLoopResult]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2020-11-30 00:01:04,735 INFO L270 CegarLoopResult]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse10 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0)) (.cse8 (= |ULTIMATE.start_usb_alloc_coherent_#res.offset| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (= ~ldv_coherent_state~0 0)) (.cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0))) (or (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 (<= 1 ~ldv_coherent_state~0) .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse8 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse3 .cse6 (let ((.cse12 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (<= (+ .cse11 1) 0) (< (* 18446744073709551616 .cse11) .cse12)))) .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base 0) .cse4 .cse5 .cse6 .cse3))) [2020-11-30 00:01:04,735 INFO L274 CegarLoopResult]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2020-11-30 00:01:04,735 INFO L274 CegarLoopResult]: For program point L4156-1(lines 4154 4173) no Hoare annotation was computed. [2020-11-30 00:01:04,735 INFO L270 CegarLoopResult]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,735 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-30 00:01:04,735 INFO L277 CegarLoopResult]: At program point L4058(lines 4058 4059) the Hoare annotation is: true [2020-11-30 00:01:04,735 INFO L277 CegarLoopResult]: At program point L4058-2(lines 4058 4059) the Hoare annotation is: true [2020-11-30 00:01:04,735 INFO L277 CegarLoopResult]: At program point L4058-1(lines 4058 4059) the Hoare annotation is: true [2020-11-30 00:01:04,736 INFO L277 CegarLoopResult]: At program point L4058-3(lines 4058 4059) the Hoare annotation is: true [2020-11-30 00:01:04,736 INFO L270 CegarLoopResult]: At program point L4257(lines 4256 4258) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,736 INFO L270 CegarLoopResult]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,736 INFO L270 CegarLoopResult]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,736 INFO L274 CegarLoopResult]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2020-11-30 00:01:04,736 INFO L270 CegarLoopResult]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse1 (<= 1 ~ldv_urb_state~0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse8 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~ldv_urb_state~0 1)) (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))))) [2020-11-30 00:01:04,737 INFO L270 CegarLoopResult]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse1 (<= 1 ~ldv_urb_state~0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse8 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~ldv_urb_state~0 1)) (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))))) [2020-11-30 00:01:04,737 INFO L270 CegarLoopResult]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (<= ~ldv_coherent_state~0 1)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse3 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse5 .cse6 .cse7))) [2020-11-30 00:01:04,737 INFO L270 CegarLoopResult]: At program point L3401-1(lines 3394 3403) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-11-30 00:01:04,737 INFO L270 CegarLoopResult]: At program point L3401(lines 3394 3403) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and (= |ULTIMATE.start_kmalloc_#res.base| 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)))) [2020-11-30 00:01:04,737 INFO L270 CegarLoopResult]: At program point L4227(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,737 INFO L270 CegarLoopResult]: At program point L4227-1(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,737 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-30 00:01:04,737 INFO L270 CegarLoopResult]: At program point L4227-2(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,738 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-30 00:01:04,738 INFO L270 CegarLoopResult]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,738 INFO L274 CegarLoopResult]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2020-11-30 00:01:04,738 INFO L274 CegarLoopResult]: For program point L4130(line 4130) no Hoare annotation was computed. [2020-11-30 00:01:04,738 INFO L274 CegarLoopResult]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2020-11-30 00:01:04,738 INFO L270 CegarLoopResult]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (<= ~ldv_coherent_state~0 1)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse3 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse5 .cse6 .cse7))) [2020-11-30 00:01:04,738 INFO L274 CegarLoopResult]: For program point L4163-2(lines 4163 4168) no Hoare annotation was computed. [2020-11-30 00:01:04,738 INFO L270 CegarLoopResult]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse3 (<= 1 ~ldv_urb_state~0)) (.cse4 (<= 1 ~ldv_coherent_state~0)) (.cse5 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse10 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse6 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse0 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 ULTIMATE.start_main_~tmp___8~3))) (.cse8 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) .cse0 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse1) (and .cse2 .cse3 (<= ~ldv_coherent_state~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~ldv_urb_state~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1) (and .cse5 .cse10 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1 (let ((.cse12 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (< (* 18446744073709551616 .cse11) .cse12) (<= (+ .cse11 1) 0))))))) [2020-11-30 00:01:04,739 INFO L270 CegarLoopResult]: At program point L4097-2loopEntry(lines 4097 4116) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2020-11-30 00:01:04,739 INFO L270 CegarLoopResult]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-11-30 00:01:04,739 INFO L274 CegarLoopResult]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2020-11-30 00:01:04,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:01:04 BoogieIcfgContainer [2020-11-30 00:01:04,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:01:04,896 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:01:04,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:01:04,896 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:01:04,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:00:16" (3/4) ... [2020-11-30 00:01:04,904 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 00:01:04,944 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2020-11-30 00:01:04,947 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2020-11-30 00:01:04,950 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-11-30 00:01:04,952 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-11-30 00:01:04,955 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 00:01:05,010 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) || ((((1 <= \result || \result + 1 <= 0) && (0 < retval || retval + 1 <= 0)) && ldv_urb_state == 0) && ldv_coherent_state == 0) [2020-11-30 00:01:05,010 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-11-30 00:01:05,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-11-30 00:01:05,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || ((((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-11-30 00:01:05,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) [2020-11-30 00:01:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2020-11-30 00:01:05,018 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,018 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2020-11-30 00:01:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) [2020-11-30 00:01:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) [2020-11-30 00:01:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && kbtab == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) [2020-11-30 00:01:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2020-11-30 00:01:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2020-11-30 00:01:05,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 [2020-11-30 00:01:05,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || (((((\result + 12 <= 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2020-11-30 00:01:05,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && error + 12 <= 0) && !(\result == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || (((((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) [2020-11-30 00:01:05,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || ((((((res_kbtab_probe_3 + 12 <= 0 && \result + 12 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && (1 <= res_kbtab_probe_3 || res_kbtab_probe_3 + 1 <= 0)) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-11-30 00:01:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2020-11-30 00:01:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && 0 == res_kbtab_probe_3) || (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) [2020-11-30 00:01:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3 [2020-11-30 00:01:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((((!(\result == 0) && 1 <= ldv_urb_state) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1)) || (((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) [2020-11-30 00:01:05,023 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) [2020-11-30 00:01:05,023 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) || (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,023 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) || ((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) [2020-11-30 00:01:05,023 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) [2020-11-30 00:01:05,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-11-30 00:01:05,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,026 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,026 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,026 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,027 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,027 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,027 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,027 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2020-11-30 00:01:05,028 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,028 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-11-30 00:01:05,317 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7979aae9-f58f-47bd-8f16-0550ca247232/bin/uautomizer/witness.graphml [2020-11-30 00:01:05,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:01:05,319 INFO L168 Benchmark]: Toolchain (without parser) took 55590.28 ms. Allocated memory was 83.9 MB in the beginning and 545.3 MB in the end (delta: 461.4 MB). Free memory was 46.0 MB in the beginning and 401.6 MB in the end (delta: -355.6 MB). Peak memory consumption was 106.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:01:05,320 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 83.9 MB. Free memory was 59.0 MB in the beginning and 58.9 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:01:05,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1773.99 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 45.8 MB in the beginning and 65.6 MB in the end (delta: -19.8 MB). Peak memory consumption was 28.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:01:05,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 210.56 ms. Allocated memory is still 100.7 MB. Free memory was 65.6 MB in the beginning and 59.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:01:05,321 INFO L168 Benchmark]: Boogie Preprocessor took 183.67 ms. Allocated memory is still 100.7 MB. Free memory was 59.3 MB in the beginning and 53.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:01:05,322 INFO L168 Benchmark]: RCFGBuilder took 4244.54 ms. Allocated memory was 100.7 MB in the beginning and 142.6 MB in the end (delta: 41.9 MB). Free memory was 53.5 MB in the beginning and 86.0 MB in the end (delta: -32.5 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:01:05,322 INFO L168 Benchmark]: TraceAbstraction took 48738.72 ms. Allocated memory was 142.6 MB in the beginning and 545.3 MB in the end (delta: 402.7 MB). Free memory was 86.0 MB in the beginning and 464.5 MB in the end (delta: -378.5 MB). Peak memory consumption was 318.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:01:05,323 INFO L168 Benchmark]: Witness Printer took 422.13 ms. Allocated memory is still 545.3 MB. Free memory was 464.5 MB in the beginning and 401.6 MB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:01:05,327 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.89 ms. Allocated memory is still 83.9 MB. Free memory was 59.0 MB in the beginning and 58.9 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1773.99 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 45.8 MB in the beginning and 65.6 MB in the end (delta: -19.8 MB). Peak memory consumption was 28.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 210.56 ms. Allocated memory is still 100.7 MB. Free memory was 65.6 MB in the beginning and 59.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 183.67 ms. Allocated memory is still 100.7 MB. Free memory was 59.3 MB in the beginning and 53.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4244.54 ms. Allocated memory was 100.7 MB in the beginning and 142.6 MB in the end (delta: 41.9 MB). Free memory was 53.5 MB in the beginning and 86.0 MB in the end (delta: -32.5 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 48738.72 ms. Allocated memory was 142.6 MB in the beginning and 545.3 MB in the end (delta: 402.7 MB). Free memory was 86.0 MB in the beginning and 464.5 MB in the end (delta: -378.5 MB). Peak memory consumption was 318.7 MB. Max. memory is 16.1 GB. * Witness Printer took 422.13 ms. Allocated memory is still 545.3 MB. Free memory was 464.5 MB in the beginning and 401.6 MB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: ((((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || (((((\result + 12 <= 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: (((((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && error + 12 <= 0) && !(\result == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || (((((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) || ((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4129]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || ((((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && 0 == res_kbtab_probe_3) || (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4184]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 && ldv_coherent_state == 0 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3433]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && kbtab == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: ((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: (((0 < retval || retval + 1 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) || ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4008]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || ((((((res_kbtab_probe_3 + 12 <= 0 && \result + 12 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && (1 <= res_kbtab_probe_3 || res_kbtab_probe_3 + 1 <= 0)) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) || (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3433]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 && ldv_coherent_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3405]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4124]: Loop Invariant Derived loop invariant: ((((((((((((((\result == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((((!(\result == 0) && 1 <= ldv_urb_state) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1)) || (((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) - InvariantResult [Line: 3909]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) || ((((1 <= \result || \result + 1 <= 0) && (0 < retval || retval + 1 <= 0)) && ldv_urb_state == 0) && ldv_coherent_state == 0) - InvariantResult [Line: 3405]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.1s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4599 SDtfs, 5959 SDslu, 8253 SDs, 0 SdLazy, 715 SolverSat, 93 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=955occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 7864 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 222 NumberOfFragments, 3416 HoareAnnotationTreeSize, 68 FomulaSimplifications, 61795123 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 68 FomulaSimplificationsInter, 402356 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1286 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 178274 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1148 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...