./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/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_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 135d8703ed0e2c3b82e17a2ab2579540cc3a8330 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:57:49,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:49,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:49,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:49,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:49,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:49,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:49,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:49,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:49,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:49,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:49,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:49,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:49,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:49,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:49,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:49,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:49,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:49,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:49,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:49,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:49,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:49,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:49,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:49,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:49,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:49,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:49,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:49,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:49,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:49,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:49,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:49,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:49,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:49,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:49,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:49,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:49,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:49,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:49,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:49,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:49,385 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-25 08:57:49,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:49,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:49,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:49,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:49,410 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:49,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:49,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:57:49,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:49,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:57:49,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:57:49,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:57:49,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:49,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:49,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:57:49,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:49,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:49,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:57:49,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:57:49,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:49,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:49,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:57:49,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:57:49,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:57:49,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:57:49,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:57:49,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:57:49,414 INFO L138 SettingsManager]: * To the following directory=dump/ 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_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/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(__VERIFIER_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 -> 135d8703ed0e2c3b82e17a2ab2579540cc3a8330 [2019-11-25 08:57:49,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:49,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:49,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:49,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:49,564 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:49,565 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-25 08:57:49,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/data/3b2926a55/09147c6868e941b995d040ba398a2d23/FLAG4871f0df5 [2019-11-25 08:57:50,279 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:50,280 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-25 08:57:50,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/data/3b2926a55/09147c6868e941b995d040ba398a2d23/FLAG4871f0df5 [2019-11-25 08:57:50,437 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/data/3b2926a55/09147c6868e941b995d040ba398a2d23 [2019-11-25 08:57:50,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:50,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:50,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:50,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:50,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:50,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:50" (1/1) ... [2019-11-25 08:57:50,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0fdede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:50, skipping insertion in model container [2019-11-25 08:57:50,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:50" (1/1) ... [2019-11-25 08:57:50,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:50,540 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:51,392 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-25 08:57:51,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:51,447 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:51,614 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-25 08:57:51,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:51,680 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:51,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51 WrapperNode [2019-11-25 08:57:51,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:51,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:51,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:51,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:51,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:51,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:51,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:51,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:51,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... [2019-11-25 08:57:51,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:51,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:51,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:51,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:51,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/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 [2019-11-25 08:57:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:57:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:57:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:57:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:57:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 08:57:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:57:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 08:57:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:57:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-25 08:57:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:51,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:57:52,271 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:57:53,237 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-25 08:57:53,237 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-25 08:57:53,239 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:57:53,239 INFO L284 CfgBuilder]: Removed 125 assume(true) statements. [2019-11-25 08:57:53,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:53 BoogieIcfgContainer [2019-11-25 08:57:53,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:57:53,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:57:53,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:57:53,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:57:53,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:57:50" (1/3) ... [2019-11-25 08:57:53,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d295ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:53, skipping insertion in model container [2019-11-25 08:57:53,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:51" (2/3) ... [2019-11-25 08:57:53,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d295ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:53, skipping insertion in model container [2019-11-25 08:57:53,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:53" (3/3) ... [2019-11-25 08:57:53,249 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-25 08:57:53,258 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:57:53,265 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-25 08:57:53,275 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-25 08:57:53,302 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:57:53,303 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:57:53,303 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:57:53,303 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:57:53,303 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:57:53,303 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:57:53,304 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:57:53,304 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:57:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2019-11-25 08:57:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:57:53,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:53,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:53,334 INFO L410 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]=== [2019-11-25 08:57:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1802506892, now seen corresponding path program 1 times [2019-11-25 08:57:53,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:53,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017469214] [2019-11-25 08:57:53,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:53,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017469214] [2019-11-25 08:57:53,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:53,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:53,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976987223] [2019-11-25 08:57:53,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:53,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:53,766 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-11-25 08:57:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:53,891 INFO L93 Difference]: Finished difference Result 330 states and 464 transitions. [2019-11-25 08:57:53,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:53,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-25 08:57:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:53,914 INFO L225 Difference]: With dead ends: 330 [2019-11-25 08:57:53,914 INFO L226 Difference]: Without dead ends: 206 [2019-11-25 08:57:53,918 INFO L630 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 [2019-11-25 08:57:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-25 08:57:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2019-11-25 08:57:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-25 08:57:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2019-11-25 08:57:54,001 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 11 [2019-11-25 08:57:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:54,002 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2019-11-25 08:57:54,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2019-11-25 08:57:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:57:54,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:54,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:54,003 INFO L410 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]=== [2019-11-25 08:57:54,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash 43137549, now seen corresponding path program 1 times [2019-11-25 08:57:54,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:54,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860747792] [2019-11-25 08:57:54,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:54,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860747792] [2019-11-25 08:57:54,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:54,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:54,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436813579] [2019-11-25 08:57:54,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:54,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:54,144 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2019-11-25 08:57:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:54,202 INFO L93 Difference]: Finished difference Result 570 states and 702 transitions. [2019-11-25 08:57:54,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:54,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-25 08:57:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:54,207 INFO L225 Difference]: With dead ends: 570 [2019-11-25 08:57:54,207 INFO L226 Difference]: Without dead ends: 378 [2019-11-25 08:57:54,211 INFO L630 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 [2019-11-25 08:57:54,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-25 08:57:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 364. [2019-11-25 08:57:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-25 08:57:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2019-11-25 08:57:54,256 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 12 [2019-11-25 08:57:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:54,256 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2019-11-25 08:57:54,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2019-11-25 08:57:54,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:57:54,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:54,259 INFO L410 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] [2019-11-25 08:57:54,259 INFO L410 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]=== [2019-11-25 08:57:54,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1530198110, now seen corresponding path program 1 times [2019-11-25 08:57:54,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:54,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702367612] [2019-11-25 08:57:54,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:54,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702367612] [2019-11-25 08:57:54,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:54,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:57:54,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063376360] [2019-11-25 08:57:54,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:57:54,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:57:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:54,378 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 5 states. [2019-11-25 08:57:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:54,494 INFO L93 Difference]: Finished difference Result 842 states and 1072 transitions. [2019-11-25 08:57:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:57:54,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-25 08:57:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:54,497 INFO L225 Difference]: With dead ends: 842 [2019-11-25 08:57:54,498 INFO L226 Difference]: Without dead ends: 485 [2019-11-25 08:57:54,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:57:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-25 08:57:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 435. [2019-11-25 08:57:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-25 08:57:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 551 transitions. [2019-11-25 08:57:54,518 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 551 transitions. Word has length 26 [2019-11-25 08:57:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:54,518 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 551 transitions. [2019-11-25 08:57:54,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:57:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 551 transitions. [2019-11-25 08:57:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:57:54,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:54,521 INFO L410 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] [2019-11-25 08:57:54,521 INFO L410 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]=== [2019-11-25 08:57:54,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1132452938, now seen corresponding path program 1 times [2019-11-25 08:57:54,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:54,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119218819] [2019-11-25 08:57:54,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:54,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119218819] [2019-11-25 08:57:54,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:54,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:57:54,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844188045] [2019-11-25 08:57:54,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:57:54,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:54,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:57:54,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:57:54,649 INFO L87 Difference]: Start difference. First operand 435 states and 551 transitions. Second operand 6 states. [2019-11-25 08:57:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:54,778 INFO L93 Difference]: Finished difference Result 940 states and 1185 transitions. [2019-11-25 08:57:54,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:57:54,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-25 08:57:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:54,785 INFO L225 Difference]: With dead ends: 940 [2019-11-25 08:57:54,785 INFO L226 Difference]: Without dead ends: 715 [2019-11-25 08:57:54,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-25 08:57:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 439. [2019-11-25 08:57:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-11-25 08:57:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 555 transitions. [2019-11-25 08:57:54,813 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 555 transitions. Word has length 40 [2019-11-25 08:57:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:54,813 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 555 transitions. [2019-11-25 08:57:54,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:57:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 555 transitions. [2019-11-25 08:57:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:57:54,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:54,821 INFO L410 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] [2019-11-25 08:57:54,821 INFO L410 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]=== [2019-11-25 08:57:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1468132655, now seen corresponding path program 1 times [2019-11-25 08:57:54,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:54,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271517114] [2019-11-25 08:57:54,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:54,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271517114] [2019-11-25 08:57:54,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:54,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:54,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669705489] [2019-11-25 08:57:54,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:54,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:54,957 INFO L87 Difference]: Start difference. First operand 439 states and 555 transitions. Second operand 4 states. [2019-11-25 08:57:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:55,023 INFO L93 Difference]: Finished difference Result 918 states and 1163 transitions. [2019-11-25 08:57:55,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:55,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-25 08:57:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:55,026 INFO L225 Difference]: With dead ends: 918 [2019-11-25 08:57:55,027 INFO L226 Difference]: Without dead ends: 488 [2019-11-25 08:57:55,028 INFO L630 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 [2019-11-25 08:57:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-11-25 08:57:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 300. [2019-11-25 08:57:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-25 08:57:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 374 transitions. [2019-11-25 08:57:55,066 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 374 transitions. Word has length 43 [2019-11-25 08:57:55,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:55,067 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 374 transitions. [2019-11-25 08:57:55,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 374 transitions. [2019-11-25 08:57:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:57:55,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:55,068 INFO L410 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] [2019-11-25 08:57:55,068 INFO L410 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]=== [2019-11-25 08:57:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1546970963, now seen corresponding path program 1 times [2019-11-25 08:57:55,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:55,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216468183] [2019-11-25 08:57:55,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:55,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216468183] [2019-11-25 08:57:55,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:55,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:55,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133760455] [2019-11-25 08:57:55,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:55,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:55,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:55,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:55,203 INFO L87 Difference]: Start difference. First operand 300 states and 374 transitions. Second operand 4 states. [2019-11-25 08:57:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:55,294 INFO L93 Difference]: Finished difference Result 530 states and 659 transitions. [2019-11-25 08:57:55,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:55,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-25 08:57:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:55,298 INFO L225 Difference]: With dead ends: 530 [2019-11-25 08:57:55,298 INFO L226 Difference]: Without dead ends: 526 [2019-11-25 08:57:55,298 INFO L630 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 [2019-11-25 08:57:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-25 08:57:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 504. [2019-11-25 08:57:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-25 08:57:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 636 transitions. [2019-11-25 08:57:55,329 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 636 transitions. Word has length 43 [2019-11-25 08:57:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:55,330 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 636 transitions. [2019-11-25 08:57:55,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 636 transitions. [2019-11-25 08:57:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 08:57:55,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:55,331 INFO L410 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] [2019-11-25 08:57:55,331 INFO L410 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]=== [2019-11-25 08:57:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash -322126284, now seen corresponding path program 1 times [2019-11-25 08:57:55,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:55,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074276299] [2019-11-25 08:57:55,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:55,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074276299] [2019-11-25 08:57:55,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:55,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:57:55,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60732546] [2019-11-25 08:57:55,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:57:55,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:57:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:55,430 INFO L87 Difference]: Start difference. First operand 504 states and 636 transitions. Second operand 5 states. [2019-11-25 08:57:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:55,588 INFO L93 Difference]: Finished difference Result 1032 states and 1291 transitions. [2019-11-25 08:57:55,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:57:55,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-25 08:57:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:55,592 INFO L225 Difference]: With dead ends: 1032 [2019-11-25 08:57:55,592 INFO L226 Difference]: Without dead ends: 530 [2019-11-25 08:57:55,593 INFO L630 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 [2019-11-25 08:57:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-25 08:57:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 494. [2019-11-25 08:57:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-25 08:57:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 618 transitions. [2019-11-25 08:57:55,629 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 618 transitions. Word has length 46 [2019-11-25 08:57:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:55,630 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 618 transitions. [2019-11-25 08:57:55,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:57:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 618 transitions. [2019-11-25 08:57:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:57:55,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:55,631 INFO L410 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] [2019-11-25 08:57:55,632 INFO L410 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]=== [2019-11-25 08:57:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash -521519415, now seen corresponding path program 1 times [2019-11-25 08:57:55,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:55,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243800197] [2019-11-25 08:57:55,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:55,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243800197] [2019-11-25 08:57:55,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:55,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:55,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409548105] [2019-11-25 08:57:55,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:55,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:55,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:55,766 INFO L87 Difference]: Start difference. First operand 494 states and 618 transitions. Second operand 3 states. [2019-11-25 08:57:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:55,823 INFO L93 Difference]: Finished difference Result 958 states and 1194 transitions. [2019-11-25 08:57:55,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:55,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:57:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:55,827 INFO L225 Difference]: With dead ends: 958 [2019-11-25 08:57:55,828 INFO L226 Difference]: Without dead ends: 495 [2019-11-25 08:57:55,828 INFO L630 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 [2019-11-25 08:57:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-25 08:57:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 466. [2019-11-25 08:57:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-25 08:57:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 572 transitions. [2019-11-25 08:57:55,864 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 572 transitions. Word has length 50 [2019-11-25 08:57:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:55,864 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 572 transitions. [2019-11-25 08:57:55,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 572 transitions. [2019-11-25 08:57:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:57:55,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:55,865 INFO L410 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] [2019-11-25 08:57:55,866 INFO L410 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]=== [2019-11-25 08:57:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1026533742, now seen corresponding path program 1 times [2019-11-25 08:57:55,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:55,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977198221] [2019-11-25 08:57:55,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:56,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977198221] [2019-11-25 08:57:56,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:56,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:57:56,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600758256] [2019-11-25 08:57:56,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:57:56,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:57:56,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:56,032 INFO L87 Difference]: Start difference. First operand 466 states and 572 transitions. Second operand 5 states. [2019-11-25 08:57:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:56,119 INFO L93 Difference]: Finished difference Result 926 states and 1137 transitions. [2019-11-25 08:57:56,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:56,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-25 08:57:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:56,123 INFO L225 Difference]: With dead ends: 926 [2019-11-25 08:57:56,123 INFO L226 Difference]: Without dead ends: 466 [2019-11-25 08:57:56,124 INFO L630 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 [2019-11-25 08:57:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-25 08:57:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-11-25 08:57:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-25 08:57:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 571 transitions. [2019-11-25 08:57:56,157 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 571 transitions. Word has length 52 [2019-11-25 08:57:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:56,158 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 571 transitions. [2019-11-25 08:57:56,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:57:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 571 transitions. [2019-11-25 08:57:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:57:56,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:56,159 INFO L410 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] [2019-11-25 08:57:56,160 INFO L410 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]=== [2019-11-25 08:57:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash 673445360, now seen corresponding path program 1 times [2019-11-25 08:57:56,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:56,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968614215] [2019-11-25 08:57:56,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:56,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968614215] [2019-11-25 08:57:56,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:56,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:57:56,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261614923] [2019-11-25 08:57:56,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:57:56,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:57:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:57:56,327 INFO L87 Difference]: Start difference. First operand 466 states and 571 transitions. Second operand 6 states. [2019-11-25 08:57:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:56,471 INFO L93 Difference]: Finished difference Result 701 states and 853 transitions. [2019-11-25 08:57:56,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:57:56,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-25 08:57:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:56,477 INFO L225 Difference]: With dead ends: 701 [2019-11-25 08:57:56,478 INFO L226 Difference]: Without dead ends: 675 [2019-11-25 08:57:56,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-25 08:57:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 470. [2019-11-25 08:57:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-11-25 08:57:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 575 transitions. [2019-11-25 08:57:56,518 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 575 transitions. Word has length 52 [2019-11-25 08:57:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:56,518 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 575 transitions. [2019-11-25 08:57:56,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:57:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 575 transitions. [2019-11-25 08:57:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:57:56,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:56,519 INFO L410 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] [2019-11-25 08:57:56,519 INFO L410 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]=== [2019-11-25 08:57:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:56,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1090912167, now seen corresponding path program 1 times [2019-11-25 08:57:56,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:56,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157416650] [2019-11-25 08:57:56,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:56,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157416650] [2019-11-25 08:57:56,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:56,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:56,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957974365] [2019-11-25 08:57:56,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:56,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:56,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:56,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:56,664 INFO L87 Difference]: Start difference. First operand 470 states and 575 transitions. Second operand 4 states. [2019-11-25 08:57:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:56,814 INFO L93 Difference]: Finished difference Result 1269 states and 1565 transitions. [2019-11-25 08:57:56,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:56,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-25 08:57:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:56,820 INFO L225 Difference]: With dead ends: 1269 [2019-11-25 08:57:56,820 INFO L226 Difference]: Without dead ends: 991 [2019-11-25 08:57:56,822 INFO L630 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 [2019-11-25 08:57:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-25 08:57:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 808. [2019-11-25 08:57:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-11-25 08:57:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 999 transitions. [2019-11-25 08:57:56,905 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 999 transitions. Word has length 53 [2019-11-25 08:57:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:56,906 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 999 transitions. [2019-11-25 08:57:56,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 999 transitions. [2019-11-25 08:57:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:57:56,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:56,907 INFO L410 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] [2019-11-25 08:57:56,908 INFO L410 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]=== [2019-11-25 08:57:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -412869753, now seen corresponding path program 1 times [2019-11-25 08:57:56,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:56,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535593219] [2019-11-25 08:57:56,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:57,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535593219] [2019-11-25 08:57:57,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:57,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:57,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515031513] [2019-11-25 08:57:57,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:57,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:57,078 INFO L87 Difference]: Start difference. First operand 808 states and 999 transitions. Second operand 4 states. [2019-11-25 08:57:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:57,152 INFO L93 Difference]: Finished difference Result 1209 states and 1486 transitions. [2019-11-25 08:57:57,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:57,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:57:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:57,156 INFO L225 Difference]: With dead ends: 1209 [2019-11-25 08:57:57,156 INFO L226 Difference]: Without dead ends: 470 [2019-11-25 08:57:57,157 INFO L630 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 [2019-11-25 08:57:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-25 08:57:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 449. [2019-11-25 08:57:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-25 08:57:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 547 transitions. [2019-11-25 08:57:57,200 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 547 transitions. Word has length 59 [2019-11-25 08:57:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:57,200 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 547 transitions. [2019-11-25 08:57:57,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 547 transitions. [2019-11-25 08:57:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:57:57,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:57,201 INFO L410 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] [2019-11-25 08:57:57,201 INFO L410 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]=== [2019-11-25 08:57:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash -272321143, now seen corresponding path program 1 times [2019-11-25 08:57:57,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:57,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123221051] [2019-11-25 08:57:57,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:57,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123221051] [2019-11-25 08:57:57,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:57,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:57,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442219995] [2019-11-25 08:57:57,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:57,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:57,333 INFO L87 Difference]: Start difference. First operand 449 states and 547 transitions. Second operand 4 states. [2019-11-25 08:57:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:57,459 INFO L93 Difference]: Finished difference Result 740 states and 899 transitions. [2019-11-25 08:57:57,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:57,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:57:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:57,464 INFO L225 Difference]: With dead ends: 740 [2019-11-25 08:57:57,466 INFO L226 Difference]: Without dead ends: 733 [2019-11-25 08:57:57,469 INFO L630 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 [2019-11-25 08:57:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-11-25 08:57:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 684. [2019-11-25 08:57:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-11-25 08:57:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 841 transitions. [2019-11-25 08:57:57,534 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 841 transitions. Word has length 59 [2019-11-25 08:57:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:57,535 INFO L462 AbstractCegarLoop]: Abstraction has 684 states and 841 transitions. [2019-11-25 08:57:57,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 841 transitions. [2019-11-25 08:57:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-25 08:57:57,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:57,536 INFO L410 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] [2019-11-25 08:57:57,537 INFO L410 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]=== [2019-11-25 08:57:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash -162519921, now seen corresponding path program 1 times [2019-11-25 08:57:57,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:57,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320872068] [2019-11-25 08:57:57,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:57,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320872068] [2019-11-25 08:57:57,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:57,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:57,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321887396] [2019-11-25 08:57:57,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:57,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:57,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:57,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:57,627 INFO L87 Difference]: Start difference. First operand 684 states and 841 transitions. Second operand 4 states. [2019-11-25 08:57:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:57,725 INFO L93 Difference]: Finished difference Result 808 states and 995 transitions. [2019-11-25 08:57:57,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:57,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-25 08:57:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:57,730 INFO L225 Difference]: With dead ends: 808 [2019-11-25 08:57:57,730 INFO L226 Difference]: Without dead ends: 799 [2019-11-25 08:57:57,731 INFO L630 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 [2019-11-25 08:57:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-25 08:57:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 688. [2019-11-25 08:57:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-11-25 08:57:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 841 transitions. [2019-11-25 08:57:57,806 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 841 transitions. Word has length 60 [2019-11-25 08:57:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:57,806 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 841 transitions. [2019-11-25 08:57:57,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 841 transitions. [2019-11-25 08:57:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 08:57:57,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:57,812 INFO L410 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] [2019-11-25 08:57:57,812 INFO L410 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]=== [2019-11-25 08:57:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2084339258, now seen corresponding path program 1 times [2019-11-25 08:57:57,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:57,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786388082] [2019-11-25 08:57:57,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:57,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786388082] [2019-11-25 08:57:57,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693282909] [2019-11-25 08:57:57,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/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 [2019-11-25 08:57:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:58,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:57:58,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:58,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:57:58,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-25 08:57:58,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175208766] [2019-11-25 08:57:58,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:58,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:58,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:58,377 INFO L87 Difference]: Start difference. First operand 688 states and 841 transitions. Second operand 4 states. [2019-11-25 08:57:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:58,444 INFO L93 Difference]: Finished difference Result 994 states and 1225 transitions. [2019-11-25 08:57:58,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:58,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-25 08:57:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:58,446 INFO L225 Difference]: With dead ends: 994 [2019-11-25 08:57:58,446 INFO L226 Difference]: Without dead ends: 330 [2019-11-25 08:57:58,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-25 08:57:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 298. [2019-11-25 08:57:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-25 08:57:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 341 transitions. [2019-11-25 08:57:58,493 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 341 transitions. Word has length 64 [2019-11-25 08:57:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:58,494 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 341 transitions. [2019-11-25 08:57:58,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 341 transitions. [2019-11-25 08:57:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 08:57:58,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:58,495 INFO L410 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] [2019-11-25 08:57:58,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:58,705 INFO L410 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]=== [2019-11-25 08:57:58,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:58,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2138631459, now seen corresponding path program 1 times [2019-11-25 08:57:58,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:58,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513787404] [2019-11-25 08:57:58,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:58,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513787404] [2019-11-25 08:57:58,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:58,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:58,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457740126] [2019-11-25 08:57:58,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:58,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:58,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:58,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:58,837 INFO L87 Difference]: Start difference. First operand 298 states and 341 transitions. Second operand 3 states. [2019-11-25 08:57:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:58,881 INFO L93 Difference]: Finished difference Result 492 states and 564 transitions. [2019-11-25 08:57:58,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:58,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-25 08:57:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:58,883 INFO L225 Difference]: With dead ends: 492 [2019-11-25 08:57:58,883 INFO L226 Difference]: Without dead ends: 231 [2019-11-25 08:57:58,884 INFO L630 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 [2019-11-25 08:57:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-25 08:57:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-25 08:57:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-25 08:57:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 257 transitions. [2019-11-25 08:57:58,913 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 257 transitions. Word has length 73 [2019-11-25 08:57:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:58,914 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 257 transitions. [2019-11-25 08:57:58,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 257 transitions. [2019-11-25 08:57:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 08:57:58,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:58,915 INFO L410 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] [2019-11-25 08:57:58,915 INFO L410 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]=== [2019-11-25 08:57:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash 231426680, now seen corresponding path program 1 times [2019-11-25 08:57:58,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:58,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968813507] [2019-11-25 08:57:58,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:59,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968813507] [2019-11-25 08:57:59,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:59,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:59,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269077452] [2019-11-25 08:57:59,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:59,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:59,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:59,215 INFO L87 Difference]: Start difference. First operand 231 states and 257 transitions. Second operand 4 states. [2019-11-25 08:57:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:59,292 INFO L93 Difference]: Finished difference Result 233 states and 258 transitions. [2019-11-25 08:57:59,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:59,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-25 08:57:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:59,294 INFO L225 Difference]: With dead ends: 233 [2019-11-25 08:57:59,294 INFO L226 Difference]: Without dead ends: 200 [2019-11-25 08:57:59,295 INFO L630 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 [2019-11-25 08:57:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-25 08:57:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 126. [2019-11-25 08:57:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-25 08:57:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2019-11-25 08:57:59,311 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 75 [2019-11-25 08:57:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:59,311 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2019-11-25 08:57:59,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2019-11-25 08:57:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:57:59,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:59,313 INFO L410 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] [2019-11-25 08:57:59,313 INFO L410 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]=== [2019-11-25 08:57:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1814198765, now seen corresponding path program 1 times [2019-11-25 08:57:59,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:59,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948606019] [2019-11-25 08:57:59,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:59,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948606019] [2019-11-25 08:57:59,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:59,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:57:59,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362421512] [2019-11-25 08:57:59,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:57:59,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:59,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:57:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:59,422 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 5 states. [2019-11-25 08:57:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:59,512 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-11-25 08:57:59,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:59,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-25 08:57:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:59,512 INFO L225 Difference]: With dead ends: 126 [2019-11-25 08:57:59,512 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:57:59,513 INFO L630 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 [2019-11-25 08:57:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:57:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:57:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:57:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:57:59,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2019-11-25 08:57:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:59,513 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:57:59,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:57:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:57:59,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:57:59,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:58:00,877 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-11-25 08:58:01,071 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-11-25 08:58:01,623 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-11-25 08:58:01,976 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-11-25 08:58:02,242 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 6 [2019-11-25 08:58:02,552 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2019-11-25 08:58:03,064 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-11-25 08:58:03,225 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-11-25 08:58:03,528 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-11-25 08:58:03,766 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2019-11-25 08:58:04,037 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-11-25 08:58:04,279 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-11-25 08:58:04,744 INFO L440 ceAbstractionStarter]: At program point L3520(lines 3514 3522) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,744 INFO L440 ceAbstractionStarter]: At program point L4032(lines 3950 4034) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-11-25 08:58:04,744 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,744 INFO L444 ceAbstractionStarter]: For program point L3983(lines 3983 4019) no Hoare annotation was computed. [2019-11-25 08:58:04,744 INFO L444 ceAbstractionStarter]: For program point L4132(lines 4117 4133) no Hoare annotation was computed. [2019-11-25 08:58:04,744 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:58:04,744 INFO L444 ceAbstractionStarter]: For program point L3802(lines 3802 3805) no Hoare annotation was computed. [2019-11-25 08:58:04,745 INFO L440 ceAbstractionStarter]: At program point L4215(lines 3997 4000) the Hoare annotation is: (let ((.cse7 (= 0 ~res_kbtab_probe_3~0)) (.cse5 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse0 (not .cse5)) (.cse1 (not .cse7)) (.cse2 (= 0 ~ldv_coherent_state~0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse8 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse9 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4) (and .cse5 .cse6 (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse7 .cse8 (<= 1 ~ldv_urb_state~0) .cse4 .cse9) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (<= (+ .cse10 1) 0) (< (* 18446744073709551616 .cse10) .cse11)))) .cse6 .cse0 .cse1 (let ((.cse13 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse12 (div .cse13 18446744073709551616))) (or (< (* 18446744073709551616 .cse12) .cse13) (<= (+ .cse12 1) 0)))) .cse2 .cse3 .cse8 .cse4 .cse9)))) [2019-11-25 08:58:04,745 INFO L440 ceAbstractionStarter]: At program point L3984(lines 3983 4019) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse6 (<= 1 ~ldv_urb_state~0)) (.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse8 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse2 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse7 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) (.cse4 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 (<= ~ldv_urb_state~0 1) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (let ((.cse10 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (<= (+ .cse9 1) 0) (< (* 18446744073709551616 .cse9) .cse10)))) .cse1 .cse8 .cse2 .cse4 .cse5 .cse7) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2019-11-25 08:58:04,745 INFO L440 ceAbstractionStarter]: At program point L4017(lines 3969 4020) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse6 (<= 1 ~ldv_urb_state~0)) (.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse8 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse2 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse7 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) (.cse4 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 (<= ~ldv_urb_state~0 1) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (let ((.cse10 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (<= (+ .cse9 1) 0) (< (* 18446744073709551616 .cse9) .cse10)))) .cse1 .cse8 .cse2 .cse4 .cse5 .cse7) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2019-11-25 08:58:04,745 INFO L440 ceAbstractionStarter]: At program point L3852(lines 3782 3862) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4 .cse5 .cse6) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 .cse2 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (< (* 18446744073709551616 .cse7) .cse8) (<= (+ .cse7 1) 0)))) .cse3 (= 0 ~res_kbtab_probe_3~0) .cse4 .cse5 .cse6))) [2019-11-25 08:58:04,745 INFO L440 ceAbstractionStarter]: At program point L4232(lines 4173 4178) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:58:04,746 INFO L444 ceAbstractionStarter]: For program point L4067(lines 4067 4070) no Hoare annotation was computed. [2019-11-25 08:58:04,746 INFO L440 ceAbstractionStarter]: At program point L3390(lines 3383 3392) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,746 INFO L440 ceAbstractionStarter]: At program point L3390-1(lines 3383 3392) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,746 INFO L444 ceAbstractionStarter]: For program point L4035-1(lines 1 4248) no Hoare annotation was computed. [2019-11-25 08:58:04,746 INFO L444 ceAbstractionStarter]: For program point L4035(lines 1 4248) no Hoare annotation was computed. [2019-11-25 08:58:04,746 INFO L444 ceAbstractionStarter]: For program point L4035-3(lines 1 4248) no Hoare annotation was computed. [2019-11-25 08:58:04,746 INFO L444 ceAbstractionStarter]: For program point L4035-2(lines 1 4248) no Hoare annotation was computed. [2019-11-25 08:58:04,746 INFO L440 ceAbstractionStarter]: At program point L4035-5(lines 4170 4187) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-11-25 08:58:04,746 INFO L444 ceAbstractionStarter]: For program point L4035-4(lines 4179 4184) no Hoare annotation was computed. [2019-11-25 08:58:04,746 INFO L440 ceAbstractionStarter]: At program point L4118loopEntry(lines 4118 4131) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,747 INFO L444 ceAbstractionStarter]: For program point L3986(lines 3986 4019) no Hoare annotation was computed. [2019-11-25 08:58:04,747 INFO L440 ceAbstractionStarter]: At program point L4135(lines 4113 4137) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= ~ldv_urb_state~0 0) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (or (<= 1 |ULTIMATE.start_usb_alloc_urb_#res.offset|) (<= (+ |ULTIMATE.start_usb_alloc_urb_#res.offset| 1) 0)) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) .cse3 .cse4 (<= 1 ~ldv_urb_state~0) .cse5 .cse6))) [2019-11-25 08:58:04,747 INFO L444 ceAbstractionStarter]: For program point L3970(line 3970) no Hoare annotation was computed. [2019-11-25 08:58:04,747 INFO L444 ceAbstractionStarter]: For program point L3904(lines 3904 3907) no Hoare annotation was computed. [2019-11-25 08:58:04,747 INFO L440 ceAbstractionStarter]: At program point L4218(lines 4217 4219) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-25 08:58:04,747 INFO L444 ceAbstractionStarter]: For program point L4152(lines 4152 4157) no Hoare annotation was computed. [2019-11-25 08:58:04,747 INFO L440 ceAbstractionStarter]: At program point L4086loopEntry(lines 4086 4105) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4 .cse5 .cse6) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 .cse2 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (< (* 18446744073709551616 .cse7) .cse8) (<= (+ .cse7 1) 0)))) .cse3 (= 0 ~res_kbtab_probe_3~0) .cse4 .cse5 .cse6))) [2019-11-25 08:58:04,747 INFO L444 ceAbstractionStarter]: For program point L4152-2(lines 4152 4157) no Hoare annotation was computed. [2019-11-25 08:58:04,748 INFO L444 ceAbstractionStarter]: For program point L4119(line 4119) no Hoare annotation was computed. [2019-11-25 08:58:04,748 INFO L440 ceAbstractionStarter]: At program point L4086-2loopEntry(lines 4086 4105) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,748 INFO L440 ceAbstractionStarter]: At program point L3987(lines 3986 4019) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse4 (<= 1 ~ldv_coherent_state~0)) (.cse8 (<= 1 ~ldv_urb_state~0)) (.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse2 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse3 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= 0 ~res_kbtab_probe_3~0)) (.cse6 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse7 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 ULTIMATE.start_main_~tmp___8~3))) (.cse9 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse3 .cse4 (<= ~ldv_urb_state~0 1) .cse5 .cse6 .cse8 .cse9) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse5 .cse7 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (<= (+ .cse10 1) 0) (< (* 18446744073709551616 .cse10) .cse11)))) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9))) [2019-11-25 08:58:04,748 INFO L440 ceAbstractionStarter]: At program point L4202(lines 4201 4203) the Hoare annotation is: (let ((.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse2) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (<= (+ .cse3 1) 0) (< (* 18446744073709551616 .cse3) .cse4)))) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (let ((.cse6 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (< (* 18446744073709551616 .cse5) .cse6) (<= (+ .cse5 1) 0)))) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) .cse2 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)))) [2019-11-25 08:58:04,748 INFO L444 ceAbstractionStarter]: For program point L4087-1(lines 4086 4105) no Hoare annotation was computed. [2019-11-25 08:58:04,748 INFO L444 ceAbstractionStarter]: For program point L4087(lines 4086 4105) no Hoare annotation was computed. [2019-11-25 08:58:04,749 INFO L444 ceAbstractionStarter]: For program point L3476(lines 3476 3483) no Hoare annotation was computed. [2019-11-25 08:58:04,749 INFO L440 ceAbstractionStarter]: At program point L4021(lines 3968 4022) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:58:04,749 INFO L440 ceAbstractionStarter]: At program point L3856(lines 3782 3862) the Hoare annotation is: (let ((.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse2) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (<= (+ .cse3 1) 0) (< (* 18446744073709551616 .cse3) .cse4)))) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (let ((.cse6 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (< (* 18446744073709551616 .cse5) .cse6) (<= (+ .cse5 1) 0)))) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) .cse2 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)))) [2019-11-25 08:58:04,749 INFO L444 ceAbstractionStarter]: For program point L4038(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,749 INFO L440 ceAbstractionStarter]: At program point L3460(lines 3454 3462) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-25 08:58:04,749 INFO L444 ceAbstractionStarter]: For program point L4038-2(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,749 INFO L444 ceAbstractionStarter]: For program point L4038-1(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,749 INFO L444 ceAbstractionStarter]: For program point L4038-4(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,749 INFO L444 ceAbstractionStarter]: For program point L4038-3(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,750 INFO L444 ceAbstractionStarter]: For program point L3840(lines 3840 3843) no Hoare annotation was computed. [2019-11-25 08:58:04,750 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:58:04,750 INFO L444 ceAbstractionStarter]: For program point L4038-5(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,750 INFO L444 ceAbstractionStarter]: For program point L4088(lines 4086 4105) no Hoare annotation was computed. [2019-11-25 08:58:04,750 INFO L444 ceAbstractionStarter]: For program point L4088-1(lines 4086 4105) no Hoare annotation was computed. [2019-11-25 08:58:04,750 INFO L444 ceAbstractionStarter]: For program point L3791(lines 3791 3797) no Hoare annotation was computed. [2019-11-25 08:58:04,750 INFO L440 ceAbstractionStarter]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,750 INFO L440 ceAbstractionStarter]: At program point L3428-1(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,750 INFO L440 ceAbstractionStarter]: At program point L3841(lines 3782 3862) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,751 INFO L440 ceAbstractionStarter]: At program point L4221(lines 4220 4222) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,751 INFO L440 ceAbstractionStarter]: At program point L4221-1(lines 4220 4222) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,751 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,751 INFO L444 ceAbstractionStarter]: For program point L3445(lines 3445 3449) no Hoare annotation was computed. [2019-11-25 08:58:04,751 INFO L444 ceAbstractionStarter]: For program point L3445-2(lines 3445 3449) no Hoare annotation was computed. [2019-11-25 08:58:04,751 INFO L440 ceAbstractionStarter]: At program point L4106(lines 4082 4111) the Hoare annotation is: (let ((.cse0 (let ((.cse10 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (<= (+ .cse9 1) 0) (< (* 18446744073709551616 .cse9) .cse10))))) (.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse4 (= 0 ~ldv_coherent_state~0)) (.cse5 (= ~ldv_urb_state~0 0)) (.cse6 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse7 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse8 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base))) (or (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0)))) .cse4 .cse5 (= 0 ~res_kbtab_probe_3~0) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse5 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse6 .cse7 .cse8))) [2019-11-25 08:58:04,752 INFO L440 ceAbstractionStarter]: At program point L4106-1(lines 4082 4111) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0)))) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,752 INFO L444 ceAbstractionStarter]: For program point L3974(lines 3974 3979) no Hoare annotation was computed. [2019-11-25 08:58:04,752 INFO L444 ceAbstractionStarter]: For program point L3809(lines 3809 3812) no Hoare annotation was computed. [2019-11-25 08:58:04,752 INFO L440 ceAbstractionStarter]: At program point L4189-1(lines 4188 4190) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,752 INFO L440 ceAbstractionStarter]: At program point L4189(lines 4188 4190) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,752 INFO L444 ceAbstractionStarter]: For program point L3479(lines 3479 3483) no Hoare annotation was computed. [2019-11-25 08:58:04,752 INFO L444 ceAbstractionStarter]: For program point L3479-2(lines 3476 3483) no Hoare annotation was computed. [2019-11-25 08:58:04,752 INFO L440 ceAbstractionStarter]: At program point L4239(lines 4238 4240) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-25 08:58:04,752 INFO L440 ceAbstractionStarter]: At program point L4206(lines 4205 4207) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,753 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,753 INFO L444 ceAbstractionStarter]: For program point L4124(lines 4124 4127) no Hoare annotation was computed. [2019-11-25 08:58:04,753 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:58:04,753 INFO L444 ceAbstractionStarter]: For program point L3794(lines 3794 3797) no Hoare annotation was computed. [2019-11-25 08:58:04,753 INFO L444 ceAbstractionStarter]: For program point L4075(lines 4060 4076) no Hoare annotation was computed. [2019-11-25 08:58:04,755 INFO L444 ceAbstractionStarter]: For program point L3976(lines 3976 3979) no Hoare annotation was computed. [2019-11-25 08:58:04,755 INFO L444 ceAbstractionStarter]: For program point L3976-1(lines 3974 3979) no Hoare annotation was computed. [2019-11-25 08:58:04,755 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,755 INFO L440 ceAbstractionStarter]: At program point L3861(lines 3771 3863) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse2 (= 0 ~res_kbtab_probe_3~0)) (.cse3 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base)) (.cse5 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) (.cse8 (not .cse0)) (.cse11 (= 0 ~ldv_coherent_state~0)) (.cse12 (= ~ldv_urb_state~0 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse2 .cse3 (<= 1 ~ldv_urb_state~0) .cse4 .cse5) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7)))) .cse1 .cse8 (let ((.cse10 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (< (* 18446744073709551616 .cse9) .cse10) (<= (+ .cse9 1) 0)))) .cse11 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse11 .cse12 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4)))) [2019-11-25 08:58:04,756 INFO L440 ceAbstractionStarter]: At program point L3498(lines 3495 3500) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,756 INFO L440 ceAbstractionStarter]: At program point L3911(lines 3900 3913) the Hoare annotation is: (let ((.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0) (< 0 ULTIMATE.start_kbtab_init_~retval~1)) .cse0 .cse1))) [2019-11-25 08:58:04,756 INFO L440 ceAbstractionStarter]: At program point L4192(lines 4191 4193) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,756 INFO L440 ceAbstractionStarter]: At program point L4209-2(lines 4208 4210) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,756 INFO L440 ceAbstractionStarter]: At program point L4209(lines 4208 4210) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,757 INFO L440 ceAbstractionStarter]: At program point L4209-1(lines 4208 4210) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,757 INFO L440 ceAbstractionStarter]: At program point L4143loopEntry(lines 4143 4162) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,757 INFO L440 ceAbstractionStarter]: At program point L3565(lines 3558 3567) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,757 INFO L440 ceAbstractionStarter]: At program point L4143-2loopEntry(lines 4143 4162) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,757 INFO L440 ceAbstractionStarter]: At program point L3912(lines 3898 3914) the Hoare annotation is: (let ((.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0) (< 0 ULTIMATE.start_kbtab_init_~retval~1)) (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) .cse0 .cse1))) [2019-11-25 08:58:04,758 INFO L440 ceAbstractionStarter]: At program point L3400(lines 3394 3402) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,758 INFO L440 ceAbstractionStarter]: At program point L3400-1(lines 3394 3402) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,758 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,758 INFO L440 ceAbstractionStarter]: At program point L4061loopEntry(lines 4061 4074) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,758 INFO L440 ceAbstractionStarter]: At program point L3450(lines 3438 3452) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,759 INFO L440 ceAbstractionStarter]: At program point L3417(lines 3411 3419) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,759 INFO L444 ceAbstractionStarter]: For program point L4144(lines 4143 4162) no Hoare annotation was computed. [2019-11-25 08:58:04,759 INFO L440 ceAbstractionStarter]: At program point L4078(lines 4055 4080) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse3 (= 0 |ULTIMATE.start_usb_alloc_coherent_#res.offset|)) (.cse1 (= ~ldv_urb_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 (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base))) (or (and .cse0 (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= ~ldv_coherent_state~0 1) (not .cse3) (<= 1 ~ldv_coherent_state~0) .cse1 .cse2 (= 0 ~res_kbtab_probe_3~0) .cse4 .cse5))) [2019-11-25 08:58:04,759 INFO L444 ceAbstractionStarter]: For program point L4144-1(lines 4143 4162) no Hoare annotation was computed. [2019-11-25 08:58:04,759 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:58:04,759 INFO L444 ceAbstractionStarter]: For program point L4062(line 4062) no Hoare annotation was computed. [2019-11-25 08:58:04,760 INFO L444 ceAbstractionStarter]: For program point L4095(lines 4095 4100) no Hoare annotation was computed. [2019-11-25 08:58:04,760 INFO L444 ceAbstractionStarter]: For program point L4095-2(lines 4095 4100) no Hoare annotation was computed. [2019-11-25 08:58:04,760 INFO L444 ceAbstractionStarter]: For program point L3963(lines 3963 3966) no Hoare annotation was computed. [2019-11-25 08:58:04,760 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-25 08:58:04,760 INFO L444 ceAbstractionStarter]: For program point L4145-1(lines 4143 4162) no Hoare annotation was computed. [2019-11-25 08:58:04,760 INFO L444 ceAbstractionStarter]: For program point L4145(lines 4143 4162) no Hoare annotation was computed. [2019-11-25 08:58:04,761 INFO L440 ceAbstractionStarter]: At program point L3435(lines 3431 3437) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,761 INFO L440 ceAbstractionStarter]: At program point L3485(lines 3464 3487) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,761 INFO L440 ceAbstractionStarter]: At program point L4212(lines 4211 4213) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,761 INFO L440 ceAbstractionStarter]: At program point L3502(lines 3501 3503) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-25 08:58:04,761 INFO L447 ceAbstractionStarter]: At program point L4047-1(lines 4047 4048) the Hoare annotation is: true [2019-11-25 08:58:04,762 INFO L447 ceAbstractionStarter]: At program point L4047(lines 4047 4048) the Hoare annotation is: true [2019-11-25 08:58:04,762 INFO L447 ceAbstractionStarter]: At program point L4047-3(lines 4047 4048) the Hoare annotation is: true [2019-11-25 08:58:04,762 INFO L447 ceAbstractionStarter]: At program point L4047-2(lines 4047 4048) the Hoare annotation is: true [2019-11-25 08:58:04,762 INFO L440 ceAbstractionStarter]: At program point L4196(lines 4195 4197) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,762 INFO L440 ceAbstractionStarter]: At program point L4229(lines 4228 4230) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,762 INFO L440 ceAbstractionStarter]: At program point L4196-2(lines 4195 4197) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,763 INFO L440 ceAbstractionStarter]: At program point L4163-1(lines 4139 4168) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,763 INFO L440 ceAbstractionStarter]: At program point L4196-1(lines 4195 4197) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,763 INFO L440 ceAbstractionStarter]: At program point L4163(lines 4139 4168) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,763 INFO L444 ceAbstractionStarter]: For program point L4246(lines 4246 4248) no Hoare annotation was computed. [2019-11-25 08:58:04,764 INFO L440 ceAbstractionStarter]: At program point L4246-1(lines 1 4248) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0)))) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (= 0 ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base)) [2019-11-25 08:58:04,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:58:04 BoogieIcfgContainer [2019-11-25 08:58:04,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:58:04,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:58:04,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:58:04,820 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:58:04,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:53" (3/4) ... [2019-11-25 08:58:04,823 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:58:04,844 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2019-11-25 08:58:04,845 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-11-25 08:58:04,847 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-25 08:58:04,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:58:04,850 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:58:04,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || ((((retval + 1 <= 0 || 0 < retval) && (1 <= \result || \result + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) [2019-11-25 08:58:04,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory) || ((((((((\result == 0 && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory)) || ((((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) [2019-11-25 08:58:04,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory) || ((((((((\result == 0 && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory)) || ((((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) [2019-11-25 08:58:04,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 1 <= ldv_urb_state) && 0 == arbitrary_memory) || (((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory)) || ((((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == arbitrary_memory) [2019-11-25 08:58:04,882 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory [2019-11-25 08:58:04,882 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory [2019-11-25 08:58:04,883 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory [2019-11-25 08:58:04,883 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory [2019-11-25 08:58:04,883 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory [2019-11-25 08:58:04,883 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory [2019-11-25 08:58:04,883 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory [2019-11-25 08:58:04,884 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory [2019-11-25 08:58:04,884 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory [2019-11-25 08:58:04,884 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory [2019-11-25 08:58:04,885 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) [2019-11-25 08:58:04,885 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) [2019-11-25 08:58:04,885 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || ((((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory)) || ((((!(\result == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2019-11-25 08:58:04,885 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && 0 == ldv_coherent_state) && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || ((((((((\result == 0 && ldv_coherent_state <= 1) && !(0 == \result)) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) [2019-11-25 08:58:04,886 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 [2019-11-25 08:58:04,886 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\result == 0) && !(0 == res_kbtab_probe_3)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory)) || ((((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && !(\result == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) [2019-11-25 08:58:04,886 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,886 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || ((((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (1 <= \result || \result + 1 <= 0)) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) [2019-11-25 08:58:04,887 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,887 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || (((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) [2019-11-25 08:58:04,887 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || (((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) [2019-11-25 08:58:04,887 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || (((((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && \result == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) [2019-11-25 08:58:04,888 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,888 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,888 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,888 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,888 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,889 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,889 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,889 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,889 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,889 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,890 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,890 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,890 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,890 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,890 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:04,891 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory [2019-11-25 08:58:05,108 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ae6da43a-1fab-4355-acbc-4d0e9afd51b1/bin/uautomizer/witness.graphml [2019-11-25 08:58:05,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:58:05,110 INFO L168 Benchmark]: Toolchain (without parser) took 14670.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 478.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -106.6 MB). Peak memory consumption was 372.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:05,110 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:58:05,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1240.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -115.1 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:05,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:05,111 INFO L168 Benchmark]: Boogie Preprocessor took 77.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:05,111 INFO L168 Benchmark]: RCFGBuilder took 1363.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 899.1 MB in the end (delta: 145.9 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:05,112 INFO L168 Benchmark]: TraceAbstraction took 11577.03 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.0 MB). Free memory was 899.1 MB in the beginning and 1.1 GB in the end (delta: -220.4 MB). Peak memory consumption was 236.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:05,112 INFO L168 Benchmark]: Witness Printer took 289.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:05,114 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1240.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -115.1 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1363.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 899.1 MB in the end (delta: 145.9 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11577.03 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.0 MB). Free memory was 899.1 MB in the beginning and 1.1 GB in the end (delta: -220.4 MB). Peak memory consumption was 236.5 MB. Max. memory is 11.5 GB. * Witness Printer took 289.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: 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: 4143]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory - InvariantResult [Line: 3558]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 3771]: Loop Invariant Derived loop invariant: ((((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || ((((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory)) || ((((!(\result == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: (((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || (((((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && \result == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 3383]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3464]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 3383]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4208]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4208]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4143]: Loop Invariant Derived loop invariant: ((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4208]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 3454]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: (((((((\result == 0 && 0 == ldv_coherent_state) && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || ((((((((\result == 0 && ldv_coherent_state <= 1) && !(0 == \result)) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 4205]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 4118]: Loop Invariant Derived loop invariant: ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: ((((\result == 0 && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4173]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory - InvariantResult [Line: 3986]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 1 <= ldv_urb_state) && 0 == arbitrary_memory) || (((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory)) || ((((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == arbitrary_memory) - InvariantResult [Line: 4170]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4195]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory - InvariantResult [Line: 4139]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 3411]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory - InvariantResult [Line: 4195]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4195]: Loop Invariant Derived loop invariant: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4139]: Loop Invariant Derived loop invariant: ((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory - InvariantResult [Line: 4191]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: ((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || (((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 3431]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || (((((((((!(error == 0) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 4188]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4061]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3900]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || (((retval + 1 <= 0 || 0 < retval) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 4228]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 3983]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory) || ((((((((\result == 0 && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory)) || ((((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3969]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory) || ((((((((\result == 0 && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory)) || ((((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4188]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4047]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((!(\result == 0) && !(0 == res_kbtab_probe_3)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory)) || ((((((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && !(\result == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 3501]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4047]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3514]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 3950]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3495]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory - InvariantResult [Line: 4047]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3898]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || ((((retval + 1 <= 0 || 0 < retval) && (1 <= \result || \result + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 4113]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == arbitrary_memory) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) || ((((((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (1 <= \result || \result + 1 <= 0)) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 0 == arbitrary_memory - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: ((((((((\result == 0 && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) && 0 == arbitrary_memory - InvariantResult [Line: 4047]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 121 locations, 6 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, HoareTripleCheckerStatistics: 2973 SDtfs, 2230 SDslu, 4289 SDs, 0 SdLazy, 317 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 63 PreInvPairs, 175 NumberOfFragments, 2481 HoareAnnotationTreeSize, 63 FomulaSimplifications, 141163 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 63 FomulaSimplificationsInter, 28507 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 971 NumberOfCodeBlocks, 971 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 118363 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1058 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 13/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...