./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/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_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/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 6b79800b0012dbc4aca68e544b1d0e24c4a91e91 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:44:13,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:44:13,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:44:13,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:44:13,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:44:13,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:44:13,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:44:13,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:44:14,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:44:14,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:44:14,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:44:14,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:44:14,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:44:14,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:44:14,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:44:14,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:44:14,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:44:14,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:44:14,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:44:14,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:44:14,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:44:14,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:44:14,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:44:14,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:44:14,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:44:14,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:44:14,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:44:14,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:44:14,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:44:14,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:44:14,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:44:14,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:44:14,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:44:14,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:44:14,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:44:14,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:44:14,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:44:14,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:44:14,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:44:14,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:44:14,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:44:14,031 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-16 00:44:14,044 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:44:14,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:44:14,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:44:14,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:44:14,046 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:44:14,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:44:14,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:44:14,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:44:14,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:44:14,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:44:14,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:44:14,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:44:14,048 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:44:14,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:44:14,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:44:14,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:44:14,049 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:44:14,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:44:14,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:44:14,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:44:14,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:44:14,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:44:14,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:44:14,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:44:14,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:44:14,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:44:14,051 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_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/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 -> 6b79800b0012dbc4aca68e544b1d0e24c4a91e91 [2019-11-16 00:44:14,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:44:14,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:44:14,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:44:14,096 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:44:14,096 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:44:14,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-16 00:44:14,150 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/data/0c202f9a9/a87014705bb44a3eb1e9b278b63eec51/FLAG0b8c64b4b [2019-11-16 00:44:14,727 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:44:14,729 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-16 00:44:14,768 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/data/0c202f9a9/a87014705bb44a3eb1e9b278b63eec51/FLAG0b8c64b4b [2019-11-16 00:44:14,874 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/data/0c202f9a9/a87014705bb44a3eb1e9b278b63eec51 [2019-11-16 00:44:14,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:44:14,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:44:14,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:14,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:44:14,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:44:14,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fed4fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14, skipping insertion in model container [2019-11-16 00:44:14,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,894 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:44:14,989 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:44:15,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:15,894 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:44:16,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:16,164 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:44:16,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16 WrapperNode [2019-11-16 00:44:16,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:16,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:16,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:44:16,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:44:16,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:16,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:44:16,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:44:16,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:44:16,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... [2019-11-16 00:44:16,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:44:16,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:44:16,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:44:16,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:44:16,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/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-16 00:44:16,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:44:16,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:44:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:44:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:44:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:44:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:44:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:44:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:44:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:44:16,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:44:16,950 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:44:18,153 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-16 00:44:18,154 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-16 00:44:18,156 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:44:18,157 INFO L284 CfgBuilder]: Removed 135 assume(true) statements. [2019-11-16 00:44:18,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:18 BoogieIcfgContainer [2019-11-16 00:44:18,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:44:18,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:44:18,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:44:18,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:44:18,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:44:14" (1/3) ... [2019-11-16 00:44:18,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324cd317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:18, skipping insertion in model container [2019-11-16 00:44:18,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:16" (2/3) ... [2019-11-16 00:44:18,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324cd317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:18, skipping insertion in model container [2019-11-16 00:44:18,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:18" (3/3) ... [2019-11-16 00:44:18,170 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-16 00:44:18,180 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:44:18,189 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-16 00:44:18,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-16 00:44:18,222 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:44:18,223 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:44:18,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:44:18,223 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:44:18,223 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:44:18,223 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:44:18,223 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:44:18,223 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:44:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-16 00:44:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:44:18,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:18,250 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:18,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1802507212, now seen corresponding path program 1 times [2019-11-16 00:44:18,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:18,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572986227] [2019-11-16 00:44:18,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:18,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:18,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:18,675 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-16 00:44:18,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572986227] [2019-11-16 00:44:18,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:18,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:44:18,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878500360] [2019-11-16 00:44:18,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:18,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:18,696 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-16 00:44:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:18,797 INFO L93 Difference]: Finished difference Result 345 states and 479 transitions. [2019-11-16 00:44:18,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:18,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-16 00:44:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:18,813 INFO L225 Difference]: With dead ends: 345 [2019-11-16 00:44:18,813 INFO L226 Difference]: Without dead ends: 216 [2019-11-16 00:44:18,817 INFO L600 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-16 00:44:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-16 00:44:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2019-11-16 00:44:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-16 00:44:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2019-11-16 00:44:18,869 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 11 [2019-11-16 00:44:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:18,870 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2019-11-16 00:44:18,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2019-11-16 00:44:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:44:18,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:18,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:18,873 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash 43147479, now seen corresponding path program 1 times [2019-11-16 00:44:18,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:18,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524363703] [2019-11-16 00:44:18,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:18,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:18,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:19,066 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-16 00:44:19,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524363703] [2019-11-16 00:44:19,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:19,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:44:19,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726762165] [2019-11-16 00:44:19,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:19,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:19,069 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 3 states. [2019-11-16 00:44:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:19,127 INFO L93 Difference]: Finished difference Result 600 states and 732 transitions. [2019-11-16 00:44:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:19,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-16 00:44:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:19,131 INFO L225 Difference]: With dead ends: 600 [2019-11-16 00:44:19,132 INFO L226 Difference]: Without dead ends: 398 [2019-11-16 00:44:19,134 INFO L600 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-16 00:44:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-11-16 00:44:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2019-11-16 00:44:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-16 00:44:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 470 transitions. [2019-11-16 00:44:19,182 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 470 transitions. Word has length 12 [2019-11-16 00:44:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:19,182 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 470 transitions. [2019-11-16 00:44:19,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 470 transitions. [2019-11-16 00:44:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:44:19,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:19,186 INFO L380 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] [2019-11-16 00:44:19,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 97836559, now seen corresponding path program 1 times [2019-11-16 00:44:19,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:19,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695226762] [2019-11-16 00:44:19,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:19,355 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-16 00:44:19,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695226762] [2019-11-16 00:44:19,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:19,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:19,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347768229] [2019-11-16 00:44:19,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:44:19,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:44:19,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:19,358 INFO L87 Difference]: Start difference. First operand 384 states and 470 transitions. Second operand 5 states. [2019-11-16 00:44:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:19,579 INFO L93 Difference]: Finished difference Result 882 states and 1112 transitions. [2019-11-16 00:44:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:44:19,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-16 00:44:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:19,583 INFO L225 Difference]: With dead ends: 882 [2019-11-16 00:44:19,584 INFO L226 Difference]: Without dead ends: 505 [2019-11-16 00:44:19,589 INFO L600 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-16 00:44:19,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-16 00:44:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 455. [2019-11-16 00:44:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-16 00:44:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 571 transitions. [2019-11-16 00:44:19,631 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 571 transitions. Word has length 27 [2019-11-16 00:44:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:19,631 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 571 transitions. [2019-11-16 00:44:19,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:44:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 571 transitions. [2019-11-16 00:44:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:44:19,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:19,634 INFO L380 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-16 00:44:19,635 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:19,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1015401359, now seen corresponding path program 1 times [2019-11-16 00:44:19,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:19,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170470608] [2019-11-16 00:44:19,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:19,786 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-16 00:44:19,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170470608] [2019-11-16 00:44:19,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:19,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:19,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167817947] [2019-11-16 00:44:19,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:19,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:19,788 INFO L87 Difference]: Start difference. First operand 455 states and 571 transitions. Second operand 4 states. [2019-11-16 00:44:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:19,865 INFO L93 Difference]: Finished difference Result 915 states and 1147 transitions. [2019-11-16 00:44:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:19,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-16 00:44:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:19,870 INFO L225 Difference]: With dead ends: 915 [2019-11-16 00:44:19,870 INFO L226 Difference]: Without dead ends: 680 [2019-11-16 00:44:19,872 INFO L600 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-16 00:44:19,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-16 00:44:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 459. [2019-11-16 00:44:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-11-16 00:44:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 575 transitions. [2019-11-16 00:44:19,898 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 575 transitions. Word has length 43 [2019-11-16 00:44:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:19,898 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 575 transitions. [2019-11-16 00:44:19,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 575 transitions. [2019-11-16 00:44:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:44:19,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:19,907 INFO L380 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] [2019-11-16 00:44:19,907 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2036405118, now seen corresponding path program 1 times [2019-11-16 00:44:19,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:19,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481718755] [2019-11-16 00:44:19,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:20,052 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-16 00:44:20,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481718755] [2019-11-16 00:44:20,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:20,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:20,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485266829] [2019-11-16 00:44:20,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:20,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:20,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:20,054 INFO L87 Difference]: Start difference. First operand 459 states and 575 transitions. Second operand 4 states. [2019-11-16 00:44:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:20,116 INFO L93 Difference]: Finished difference Result 961 states and 1206 transitions. [2019-11-16 00:44:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:20,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-16 00:44:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:20,120 INFO L225 Difference]: With dead ends: 961 [2019-11-16 00:44:20,120 INFO L226 Difference]: Without dead ends: 511 [2019-11-16 00:44:20,121 INFO L600 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-16 00:44:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-16 00:44:20,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 314. [2019-11-16 00:44:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-16 00:44:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 388 transitions. [2019-11-16 00:44:20,141 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 388 transitions. Word has length 47 [2019-11-16 00:44:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:20,141 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 388 transitions. [2019-11-16 00:44:20,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 388 transitions. [2019-11-16 00:44:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:44:20,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:20,143 INFO L380 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] [2019-11-16 00:44:20,143 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:20,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1015336764, now seen corresponding path program 1 times [2019-11-16 00:44:20,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:20,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451504794] [2019-11-16 00:44:20,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:20,258 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-16 00:44:20,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451504794] [2019-11-16 00:44:20,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:20,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:20,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840261032] [2019-11-16 00:44:20,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:20,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:20,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:20,260 INFO L87 Difference]: Start difference. First operand 314 states and 388 transitions. Second operand 4 states. [2019-11-16 00:44:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:20,357 INFO L93 Difference]: Finished difference Result 554 states and 683 transitions. [2019-11-16 00:44:20,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:20,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-16 00:44:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:20,361 INFO L225 Difference]: With dead ends: 554 [2019-11-16 00:44:20,361 INFO L226 Difference]: Without dead ends: 550 [2019-11-16 00:44:20,362 INFO L600 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-16 00:44:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-16 00:44:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 528. [2019-11-16 00:44:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-16 00:44:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 660 transitions. [2019-11-16 00:44:20,392 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 660 transitions. Word has length 47 [2019-11-16 00:44:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:20,392 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 660 transitions. [2019-11-16 00:44:20,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 660 transitions. [2019-11-16 00:44:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:44:20,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:20,394 INFO L380 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] [2019-11-16 00:44:20,394 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:20,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:20,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1949403581, now seen corresponding path program 1 times [2019-11-16 00:44:20,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:20,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855064551] [2019-11-16 00:44:20,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:20,499 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-16 00:44:20,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855064551] [2019-11-16 00:44:20,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:20,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:20,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930062277] [2019-11-16 00:44:20,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:44:20,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:20,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:44:20,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:20,501 INFO L87 Difference]: Start difference. First operand 528 states and 660 transitions. Second operand 5 states. [2019-11-16 00:44:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:20,631 INFO L93 Difference]: Finished difference Result 1079 states and 1338 transitions. [2019-11-16 00:44:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:44:20,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-16 00:44:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:20,635 INFO L225 Difference]: With dead ends: 1079 [2019-11-16 00:44:20,635 INFO L226 Difference]: Without dead ends: 553 [2019-11-16 00:44:20,636 INFO L600 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-16 00:44:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-16 00:44:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 517. [2019-11-16 00:44:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-16 00:44:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 641 transitions. [2019-11-16 00:44:20,672 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 641 transitions. Word has length 49 [2019-11-16 00:44:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:20,672 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 641 transitions. [2019-11-16 00:44:20,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:44:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 641 transitions. [2019-11-16 00:44:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:44:20,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:20,675 INFO L380 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] [2019-11-16 00:44:20,675 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1249342346, now seen corresponding path program 1 times [2019-11-16 00:44:20,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:20,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764409904] [2019-11-16 00:44:20,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:20,809 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-16 00:44:20,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764409904] [2019-11-16 00:44:20,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:20,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:20,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498750110] [2019-11-16 00:44:20,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:20,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:20,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:20,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:20,811 INFO L87 Difference]: Start difference. First operand 517 states and 641 transitions. Second operand 3 states. [2019-11-16 00:44:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:20,870 INFO L93 Difference]: Finished difference Result 1001 states and 1237 transitions. [2019-11-16 00:44:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:20,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-16 00:44:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:20,875 INFO L225 Difference]: With dead ends: 1001 [2019-11-16 00:44:20,876 INFO L226 Difference]: Without dead ends: 518 [2019-11-16 00:44:20,877 INFO L600 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-16 00:44:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-16 00:44:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 489. [2019-11-16 00:44:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-11-16 00:44:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 595 transitions. [2019-11-16 00:44:20,912 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 595 transitions. Word has length 54 [2019-11-16 00:44:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:20,912 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 595 transitions. [2019-11-16 00:44:20,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 595 transitions. [2019-11-16 00:44:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:44:20,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:20,914 INFO L380 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] [2019-11-16 00:44:20,914 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:20,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2015730543, now seen corresponding path program 1 times [2019-11-16 00:44:20,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:20,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837368390] [2019-11-16 00:44:20,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:21,029 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-16 00:44:21,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837368390] [2019-11-16 00:44:21,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:21,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:21,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681164796] [2019-11-16 00:44:21,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:21,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:21,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:21,032 INFO L87 Difference]: Start difference. First operand 489 states and 595 transitions. Second operand 4 states. [2019-11-16 00:44:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:21,115 INFO L93 Difference]: Finished difference Result 730 states and 883 transitions. [2019-11-16 00:44:21,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:21,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-16 00:44:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:21,121 INFO L225 Difference]: With dead ends: 730 [2019-11-16 00:44:21,121 INFO L226 Difference]: Without dead ends: 704 [2019-11-16 00:44:21,122 INFO L600 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-16 00:44:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-11-16 00:44:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 493. [2019-11-16 00:44:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-16 00:44:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 599 transitions. [2019-11-16 00:44:21,159 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 599 transitions. Word has length 56 [2019-11-16 00:44:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:21,160 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 599 transitions. [2019-11-16 00:44:21,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 599 transitions. [2019-11-16 00:44:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:44:21,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:21,161 INFO L380 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] [2019-11-16 00:44:21,162 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash -247920110, now seen corresponding path program 1 times [2019-11-16 00:44:21,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:21,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056294109] [2019-11-16 00:44:21,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:21,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:21,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:21,309 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-16 00:44:21,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056294109] [2019-11-16 00:44:21,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:21,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:21,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911014321] [2019-11-16 00:44:21,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:44:21,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:21,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:44:21,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:21,316 INFO L87 Difference]: Start difference. First operand 493 states and 599 transitions. Second operand 5 states. [2019-11-16 00:44:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:21,439 INFO L93 Difference]: Finished difference Result 980 states and 1191 transitions. [2019-11-16 00:44:21,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:44:21,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-16 00:44:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:21,443 INFO L225 Difference]: With dead ends: 980 [2019-11-16 00:44:21,443 INFO L226 Difference]: Without dead ends: 493 [2019-11-16 00:44:21,444 INFO L600 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-16 00:44:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-16 00:44:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-11-16 00:44:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-16 00:44:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 598 transitions. [2019-11-16 00:44:21,489 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 598 transitions. Word has length 57 [2019-11-16 00:44:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:21,489 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 598 transitions. [2019-11-16 00:44:21,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:44:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 598 transitions. [2019-11-16 00:44:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:44:21,490 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:21,490 INFO L380 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] [2019-11-16 00:44:21,491 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1290419920, now seen corresponding path program 1 times [2019-11-16 00:44:21,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:21,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150242485] [2019-11-16 00:44:21,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:21,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:21,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:21,686 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-16 00:44:21,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150242485] [2019-11-16 00:44:21,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:21,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:21,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679550502] [2019-11-16 00:44:21,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:21,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:21,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:21,688 INFO L87 Difference]: Start difference. First operand 493 states and 598 transitions. Second operand 4 states. [2019-11-16 00:44:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:21,859 INFO L93 Difference]: Finished difference Result 1329 states and 1625 transitions. [2019-11-16 00:44:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:21,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-16 00:44:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:21,866 INFO L225 Difference]: With dead ends: 1329 [2019-11-16 00:44:21,866 INFO L226 Difference]: Without dead ends: 1041 [2019-11-16 00:44:21,867 INFO L600 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-16 00:44:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-11-16 00:44:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 844. [2019-11-16 00:44:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-16 00:44:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1035 transitions. [2019-11-16 00:44:21,939 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1035 transitions. Word has length 57 [2019-11-16 00:44:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:21,939 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1035 transitions. [2019-11-16 00:44:21,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1035 transitions. [2019-11-16 00:44:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:44:21,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:21,941 INFO L380 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] [2019-11-16 00:44:21,941 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:21,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1563249264, now seen corresponding path program 1 times [2019-11-16 00:44:21,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:21,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471656273] [2019-11-16 00:44:21,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:21,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:21,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:22,052 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-16 00:44:22,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471656273] [2019-11-16 00:44:22,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:22,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:22,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34074460] [2019-11-16 00:44:22,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:22,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:22,053 INFO L87 Difference]: Start difference. First operand 844 states and 1035 transitions. Second operand 4 states. [2019-11-16 00:44:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:22,130 INFO L93 Difference]: Finished difference Result 1261 states and 1538 transitions. [2019-11-16 00:44:22,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:22,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-16 00:44:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:22,134 INFO L225 Difference]: With dead ends: 1261 [2019-11-16 00:44:22,134 INFO L226 Difference]: Without dead ends: 490 [2019-11-16 00:44:22,135 INFO L600 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-16 00:44:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-16 00:44:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 469. [2019-11-16 00:44:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-11-16 00:44:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 567 transitions. [2019-11-16 00:44:22,173 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 567 transitions. Word has length 63 [2019-11-16 00:44:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:22,173 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 567 transitions. [2019-11-16 00:44:22,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 567 transitions. [2019-11-16 00:44:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:44:22,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:22,175 INFO L380 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] [2019-11-16 00:44:22,175 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1703797874, now seen corresponding path program 1 times [2019-11-16 00:44:22,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:22,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194096580] [2019-11-16 00:44:22,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:22,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:22,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:22,308 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-16 00:44:22,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194096580] [2019-11-16 00:44:22,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:22,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:22,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723260329] [2019-11-16 00:44:22,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:22,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:22,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:22,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:22,311 INFO L87 Difference]: Start difference. First operand 469 states and 567 transitions. Second operand 4 states. [2019-11-16 00:44:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:22,446 INFO L93 Difference]: Finished difference Result 771 states and 930 transitions. [2019-11-16 00:44:22,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:22,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-16 00:44:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:22,451 INFO L225 Difference]: With dead ends: 771 [2019-11-16 00:44:22,451 INFO L226 Difference]: Without dead ends: 764 [2019-11-16 00:44:22,452 INFO L600 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-16 00:44:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-11-16 00:44:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 715. [2019-11-16 00:44:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-16 00:44:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 872 transitions. [2019-11-16 00:44:22,509 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 872 transitions. Word has length 63 [2019-11-16 00:44:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:22,510 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 872 transitions. [2019-11-16 00:44:22,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 872 transitions. [2019-11-16 00:44:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:44:22,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:22,511 INFO L380 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] [2019-11-16 00:44:22,511 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:22,511 INFO L82 PathProgramCache]: Analyzing trace with hash 967629456, now seen corresponding path program 1 times [2019-11-16 00:44:22,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:22,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067890950] [2019-11-16 00:44:22,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:22,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:22,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:22,612 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-16 00:44:22,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067890950] [2019-11-16 00:44:22,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:22,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:22,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271211453] [2019-11-16 00:44:22,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:22,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:22,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:22,614 INFO L87 Difference]: Start difference. First operand 715 states and 872 transitions. Second operand 4 states. [2019-11-16 00:44:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:22,715 INFO L93 Difference]: Finished difference Result 841 states and 1028 transitions. [2019-11-16 00:44:22,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:22,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-16 00:44:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:22,721 INFO L225 Difference]: With dead ends: 841 [2019-11-16 00:44:22,721 INFO L226 Difference]: Without dead ends: 832 [2019-11-16 00:44:22,722 INFO L600 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-16 00:44:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-11-16 00:44:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 719. [2019-11-16 00:44:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-11-16 00:44:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 872 transitions. [2019-11-16 00:44:22,793 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 872 transitions. Word has length 64 [2019-11-16 00:44:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:22,794 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 872 transitions. [2019-11-16 00:44:22,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 872 transitions. [2019-11-16 00:44:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:44:22,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:22,795 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:22,795 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1689795513, now seen corresponding path program 1 times [2019-11-16 00:44:22,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:22,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50929084] [2019-11-16 00:44:22,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:22,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:22,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:22,938 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-16 00:44:22,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50929084] [2019-11-16 00:44:22,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662087398] [2019-11-16 00:44:22,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/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-16 00:44:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:23,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:44:23,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:23,413 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-16 00:44:23,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:44:23,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-16 00:44:23,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813983908] [2019-11-16 00:44:23,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:23,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:23,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:23,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:23,426 INFO L87 Difference]: Start difference. First operand 719 states and 872 transitions. Second operand 4 states. [2019-11-16 00:44:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:23,504 INFO L93 Difference]: Finished difference Result 1037 states and 1268 transitions. [2019-11-16 00:44:23,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:23,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:44:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:23,507 INFO L225 Difference]: With dead ends: 1037 [2019-11-16 00:44:23,507 INFO L226 Difference]: Without dead ends: 346 [2019-11-16 00:44:23,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-16 00:44:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-16 00:44:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 314. [2019-11-16 00:44:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-16 00:44:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 357 transitions. [2019-11-16 00:44:23,598 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 357 transitions. Word has length 68 [2019-11-16 00:44:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:23,598 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 357 transitions. [2019-11-16 00:44:23,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 357 transitions. [2019-11-16 00:44:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:44:23,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:23,599 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:23,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:23,800 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:23,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2027570376, now seen corresponding path program 1 times [2019-11-16 00:44:23,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:23,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160610344] [2019-11-16 00:44:23,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:23,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:23,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:23,943 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-16 00:44:23,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160610344] [2019-11-16 00:44:23,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:23,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:23,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457320670] [2019-11-16 00:44:23,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:23,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:23,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:23,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:23,945 INFO L87 Difference]: Start difference. First operand 314 states and 357 transitions. Second operand 3 states. [2019-11-16 00:44:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:23,990 INFO L93 Difference]: Finished difference Result 515 states and 587 transitions. [2019-11-16 00:44:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:23,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-16 00:44:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:23,992 INFO L225 Difference]: With dead ends: 515 [2019-11-16 00:44:23,992 INFO L226 Difference]: Without dead ends: 242 [2019-11-16 00:44:23,993 INFO L600 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-16 00:44:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-16 00:44:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-16 00:44:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-16 00:44:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2019-11-16 00:44:24,020 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 77 [2019-11-16 00:44:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:24,020 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2019-11-16 00:44:24,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2019-11-16 00:44:24,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:44:24,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:24,022 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:24,022 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:24,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1039963939, now seen corresponding path program 1 times [2019-11-16 00:44:24,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:24,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155057522] [2019-11-16 00:44:24,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:24,382 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-16 00:44:24,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155057522] [2019-11-16 00:44:24,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:24,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:24,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498950837] [2019-11-16 00:44:24,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:24,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:24,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:24,384 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand 4 states. [2019-11-16 00:44:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:24,468 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2019-11-16 00:44:24,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:24,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-16 00:44:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:24,470 INFO L225 Difference]: With dead ends: 244 [2019-11-16 00:44:24,470 INFO L226 Difference]: Without dead ends: 211 [2019-11-16 00:44:24,470 INFO L600 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-16 00:44:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-16 00:44:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 132. [2019-11-16 00:44:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:44:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2019-11-16 00:44:24,487 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 79 [2019-11-16 00:44:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:24,487 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2019-11-16 00:44:24,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2019-11-16 00:44:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:44:24,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:24,489 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:24,489 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1761187395, now seen corresponding path program 1 times [2019-11-16 00:44:24,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:24,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001181411] [2019-11-16 00:44:24,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:24,619 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-16 00:44:24,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001181411] [2019-11-16 00:44:24,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:24,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:24,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601417701] [2019-11-16 00:44:24,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:44:24,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:44:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:24,622 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 5 states. [2019-11-16 00:44:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:24,710 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2019-11-16 00:44:24,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:44:24,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:44:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:24,711 INFO L225 Difference]: With dead ends: 132 [2019-11-16 00:44:24,711 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:44:24,711 INFO L600 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-16 00:44:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:44:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:44:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:44:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:44:24,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-11-16 00:44:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:24,712 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:24,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:44:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:44:24,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:44:24,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:44:25,551 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 26 [2019-11-16 00:44:25,822 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-11-16 00:44:26,459 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-11-16 00:44:26,804 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-11-16 00:44:27,033 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-11-16 00:44:27,363 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-11-16 00:44:27,737 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-11-16 00:44:27,942 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-11-16 00:44:28,342 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-11-16 00:44:28,600 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-11-16 00:44:28,795 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-11-16 00:44:29,171 INFO L443 ceAbstractionStarter]: For program point L3801(lines 3801 3804) no Hoare annotation was computed. [2019-11-16 00:44:29,171 INFO L439 ceAbstractionStarter]: At program point L4231(lines 4230 4232) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,171 INFO L443 ceAbstractionStarter]: For program point L4066(lines 4066 4069) no Hoare annotation was computed. [2019-11-16 00:44:29,171 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,171 INFO L443 ceAbstractionStarter]: For program point L4034(lines 1 4254) no Hoare annotation was computed. [2019-11-16 00:44:29,171 INFO L443 ceAbstractionStarter]: For program point L4034-2(lines 1 4254) no Hoare annotation was computed. [2019-11-16 00:44:29,171 INFO L443 ceAbstractionStarter]: For program point L4034-1(lines 1 4254) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L4034-4(lines 4178 4183) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L4034-3(lines 1 4254) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L439 ceAbstractionStarter]: At program point L4034-5(lines 4169 4186) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L439 ceAbstractionStarter]: At program point L4134(lines 4112 4136) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (= ~ldv_urb_state~0 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= ~ldv_urb_state~0 1) (or (not .cse2) (not .cse3)) .cse4 (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) .cse5))) [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L3969(line 3969) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L3903(lines 3903 3906) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L439 ceAbstractionStarter]: At program point L4234(lines 4172 4177) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L3475(lines 3475 3482) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L4037-1(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L4037(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L4037-3(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L4037-2(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L4037-5(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L4037-4(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,172 INFO L443 ceAbstractionStarter]: For program point L3839(lines 3839 3842) no Hoare annotation was computed. [2019-11-16 00:44:29,173 INFO L439 ceAbstractionStarter]: At program point L4203(lines 4202 4204) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (and (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) (and (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (<= (+ .cse5 1) 0) (< (* 18446744073709551616 .cse5) .cse6)))) .cse2) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2019-11-16 00:44:29,173 INFO L439 ceAbstractionStarter]: At program point L3840(lines 3781 3861) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,173 INFO L443 ceAbstractionStarter]: For program point L3444(lines 3444 3448) no Hoare annotation was computed. [2019-11-16 00:44:29,173 INFO L443 ceAbstractionStarter]: For program point L3444-2(lines 3444 3448) no Hoare annotation was computed. [2019-11-16 00:44:29,173 INFO L439 ceAbstractionStarter]: At program point L4105-1(lines 4081 4110) 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)))) (<= 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)) [2019-11-16 00:44:29,173 INFO L439 ceAbstractionStarter]: At program point L4105(lines 4081 4110) the Hoare annotation is: (let ((.cse0 (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 (= 0 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse1 .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-11-16 00:44:29,174 INFO L443 ceAbstractionStarter]: For program point L3973(lines 3973 3978) no Hoare annotation was computed. [2019-11-16 00:44:29,174 INFO L443 ceAbstractionStarter]: For program point L3808(lines 3808 3811) no Hoare annotation was computed. [2019-11-16 00:44:29,174 INFO L443 ceAbstractionStarter]: For program point L3478(lines 3478 3482) no Hoare annotation was computed. [2019-11-16 00:44:29,174 INFO L443 ceAbstractionStarter]: For program point L3478-2(lines 3475 3482) no Hoare annotation was computed. [2019-11-16 00:44:29,174 INFO L443 ceAbstractionStarter]: For program point L4074(lines 4059 4075) no Hoare annotation was computed. [2019-11-16 00:44:29,174 INFO L443 ceAbstractionStarter]: For program point L3975-1(lines 3973 3978) no Hoare annotation was computed. [2019-11-16 00:44:29,174 INFO L443 ceAbstractionStarter]: For program point L3975(lines 3975 3978) no Hoare annotation was computed. [2019-11-16 00:44:29,174 INFO L439 ceAbstractionStarter]: At program point L4207(lines 4206 4208) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,174 INFO L439 ceAbstractionStarter]: At program point L3910(lines 3899 3912) 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-16 00:44:29,174 INFO L439 ceAbstractionStarter]: At program point L4241(lines 4240 4242) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-16 00:44:29,175 INFO L439 ceAbstractionStarter]: At program point L4142loopEntry(lines 4142 4161) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,175 INFO L439 ceAbstractionStarter]: At program point L4142-2loopEntry(lines 4142 4161) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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) (<= 1 ~ldv_urb_state~0)) [2019-11-16 00:44:29,175 INFO L439 ceAbstractionStarter]: At program point L3911(lines 3897 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)) (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) .cse0 .cse1))) [2019-11-16 00:44:29,175 INFO L439 ceAbstractionStarter]: At program point L3416(lines 3410 3418) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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) (<= 1 ~ldv_urb_state~0)) [2019-11-16 00:44:29,175 INFO L439 ceAbstractionStarter]: At program point L3449(lines 3437 3451) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,175 INFO L443 ceAbstractionStarter]: For program point L4143-1(lines 4142 4161) no Hoare annotation was computed. [2019-11-16 00:44:29,175 INFO L443 ceAbstractionStarter]: For program point L4143(lines 4142 4161) no Hoare annotation was computed. [2019-11-16 00:44:29,176 INFO L439 ceAbstractionStarter]: At program point L4077(lines 4054 4079) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse2 (= 0 |ULTIMATE.start_usb_alloc_coherent_#res.offset|)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0) (or (not .cse2) (not .cse3)) .cse4) (and (= 0 ~ldv_coherent_state~0) .cse3 .cse0 .cse1 .cse2 .cse4))) [2019-11-16 00:44:29,176 INFO L439 ceAbstractionStarter]: At program point L4210(lines 4209 4211) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,176 INFO L443 ceAbstractionStarter]: For program point L4144(lines 4142 4161) no Hoare annotation was computed. [2019-11-16 00:44:29,176 INFO L439 ceAbstractionStarter]: At program point L4210-1(lines 4209 4211) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,176 INFO L439 ceAbstractionStarter]: At program point L4210-2(lines 4209 4211) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,176 INFO L443 ceAbstractionStarter]: For program point L4144-1(lines 4142 4161) no Hoare annotation was computed. [2019-11-16 00:44:29,176 INFO L439 ceAbstractionStarter]: At program point L3484(lines 3463 3486) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,177 INFO L446 ceAbstractionStarter]: At program point L4046(lines 4046 4047) the Hoare annotation is: true [2019-11-16 00:44:29,177 INFO L446 ceAbstractionStarter]: At program point L4046-2(lines 4046 4047) the Hoare annotation is: true [2019-11-16 00:44:29,177 INFO L446 ceAbstractionStarter]: At program point L4046-1(lines 4046 4047) the Hoare annotation is: true [2019-11-16 00:44:29,177 INFO L446 ceAbstractionStarter]: At program point L4046-3(lines 4046 4047) the Hoare annotation is: true [2019-11-16 00:44:29,177 INFO L439 ceAbstractionStarter]: At program point L3519(lines 3513 3521) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,177 INFO L439 ceAbstractionStarter]: At program point L4213(lines 4212 4214) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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) (<= 1 ~ldv_urb_state~0)) [2019-11-16 00:44:29,177 INFO L443 ceAbstractionStarter]: For program point L3982(lines 3982 4018) no Hoare annotation was computed. [2019-11-16 00:44:29,177 INFO L439 ceAbstractionStarter]: At program point L4016(lines 3968 4019) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse4 (<= 1 ~ldv_urb_state~0)) (.cse1 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse3 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse1 (and (and (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)))) .cse5) .cse3)))) [2019-11-16 00:44:29,178 INFO L439 ceAbstractionStarter]: At program point L3983(lines 3982 4018) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse4 (<= 1 ~ldv_urb_state~0)) (.cse1 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse3 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse1 (and (and (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)))) .cse5) .cse3)))) [2019-11-16 00:44:29,178 INFO L439 ceAbstractionStarter]: At program point L3851(lines 3781 3861) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-11-16 00:44:29,178 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:44:29,178 INFO L439 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-16 00:44:29,178 INFO L439 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-16 00:44:29,178 INFO L439 ceAbstractionStarter]: At program point L4249-2(lines 4248 4250) 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-16 00:44:29,178 INFO L439 ceAbstractionStarter]: At program point L4249-3(lines 4248 4250) the Hoare annotation is: (and (<= ~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)) [2019-11-16 00:44:29,179 INFO L439 ceAbstractionStarter]: At program point L4249(lines 4248 4250) 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-16 00:44:29,179 INFO L439 ceAbstractionStarter]: At program point L4249-1(lines 4248 4250) 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-16 00:44:29,179 INFO L439 ceAbstractionStarter]: At program point L4216(lines 3996 3999) the Hoare annotation is: (let ((.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse4 (not .cse0)) (.cse5 (not .cse1)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= 0 ~ldv_coherent_state~0)) (.cse6 (= ~ldv_urb_state~0 0))) (or (and .cse0 (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse1 (<= 1 ~ldv_urb_state~0) .cse2) (and .cse3 (and .cse4 .cse5 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse6 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse4 .cse5 (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)))) (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)))) .cse2) .cse3 .cse6)))) [2019-11-16 00:44:29,179 INFO L439 ceAbstractionStarter]: At program point L4117loopEntry(lines 4117 4130) the Hoare annotation is: (and (<= ~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)) [2019-11-16 00:44:29,179 INFO L439 ceAbstractionStarter]: At program point L4249-4(lines 4248 4250) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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) (<= 1 ~ldv_urb_state~0)) [2019-11-16 00:44:29,179 INFO L443 ceAbstractionStarter]: For program point L3985(lines 3985 4018) no Hoare annotation was computed. [2019-11-16 00:44:29,179 INFO L443 ceAbstractionStarter]: For program point L4118(line 4118) no Hoare annotation was computed. [2019-11-16 00:44:29,180 INFO L443 ceAbstractionStarter]: For program point L4151(lines 4151 4156) no Hoare annotation was computed. [2019-11-16 00:44:29,180 INFO L439 ceAbstractionStarter]: At program point L4085loopEntry(lines 4085 4104) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-11-16 00:44:29,180 INFO L443 ceAbstractionStarter]: For program point L4151-2(lines 4151 4156) no Hoare annotation was computed. [2019-11-16 00:44:29,180 INFO L439 ceAbstractionStarter]: At program point L3986(lines 3985 4018) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 ULTIMATE.start_main_~tmp___8~3))) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse0 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse7 (<= 1 ~ldv_coherent_state~0)) (.cse5 (= 0 ~res_kbtab_probe_3~0)) (.cse8 (<= 1 ~ldv_urb_state~0))) (or (and .cse0 (and (and (let ((.cse2 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse1 (div .cse2 18446744073709551616))) (or (<= (+ .cse1 1) 0) (< (* 18446744073709551616 .cse1) .cse2)))) .cse3 .cse4) .cse5)) (and .cse6 .cse0 .cse5 (and .cse3 .cse7 .cse4) .cse8) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse5 .cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse6 (<= ~ldv_coherent_state~0 1) .cse0 .cse7 (<= ~ldv_urb_state~0 1) .cse5 .cse8))) [2019-11-16 00:44:29,180 INFO L439 ceAbstractionStarter]: At program point L4085-2loopEntry(lines 4085 4104) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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)) [2019-11-16 00:44:29,180 INFO L443 ceAbstractionStarter]: For program point L4086(lines 4085 4104) no Hoare annotation was computed. [2019-11-16 00:44:29,180 INFO L439 ceAbstractionStarter]: At program point L4020(lines 3967 4021) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-16 00:44:29,181 INFO L443 ceAbstractionStarter]: For program point L4086-1(lines 4085 4104) no Hoare annotation was computed. [2019-11-16 00:44:29,181 INFO L439 ceAbstractionStarter]: At program point L3855(lines 3781 3861) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (and (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) (and (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (<= (+ .cse5 1) 0) (< (* 18446744073709551616 .cse5) .cse6)))) .cse2) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2019-11-16 00:44:29,181 INFO L439 ceAbstractionStarter]: At program point L3459(lines 3453 3461) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-16 00:44:29,181 INFO L439 ceAbstractionStarter]: At program point L4219(lines 4218 4220) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-16 00:44:29,181 INFO L439 ceAbstractionStarter]: At program point L4252-1(lines 1 4254) 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)))) (<= 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)) [2019-11-16 00:44:29,181 INFO L443 ceAbstractionStarter]: For program point L4252(lines 4252 4254) no Hoare annotation was computed. [2019-11-16 00:44:29,181 INFO L443 ceAbstractionStarter]: For program point L4087-1(lines 4085 4104) no Hoare annotation was computed. [2019-11-16 00:44:29,181 INFO L443 ceAbstractionStarter]: For program point L4087(lines 4085 4104) no Hoare annotation was computed. [2019-11-16 00:44:29,182 INFO L443 ceAbstractionStarter]: For program point L3790(lines 3790 3796) no Hoare annotation was computed. [2019-11-16 00:44:29,182 INFO L439 ceAbstractionStarter]: At program point L3427-1(lines 3421 3429) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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) (<= 1 ~ldv_urb_state~0)) [2019-11-16 00:44:29,182 INFO L439 ceAbstractionStarter]: At program point L3427(lines 3421 3429) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,182 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:44:29,182 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,182 INFO L439 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-16 00:44:29,182 INFO L439 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-16 00:44:29,182 INFO L443 ceAbstractionStarter]: For program point L4123(lines 4123 4126) no Hoare annotation was computed. [2019-11-16 00:44:29,183 INFO L443 ceAbstractionStarter]: For program point L3793(lines 3793 3796) no Hoare annotation was computed. [2019-11-16 00:44:29,183 INFO L439 ceAbstractionStarter]: At program point L4223(lines 4222 4224) 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-16 00:44:29,183 INFO L439 ceAbstractionStarter]: At program point L4223-1(lines 4222 4224) the Hoare annotation is: (and (<= ~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)) [2019-11-16 00:44:29,183 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:44:29,183 INFO L439 ceAbstractionStarter]: At program point L3860(lines 3770 3862) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse0 (not .cse4)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse5 (= 0 ~res_kbtab_probe_3~0))) (or (and (and .cse0 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2)) .cse3) (and .cse4 (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse5 (<= 1 ~ldv_urb_state~0) .cse2) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 (let ((.cse7 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0)))) (and (let ((.cse9 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) .cse2) .cse3 .cse1 .cse5)))) [2019-11-16 00:44:29,183 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,183 INFO L439 ceAbstractionStarter]: At program point L3497(lines 3494 3499) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,184 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,184 INFO L439 ceAbstractionStarter]: At program point L3564(lines 3557 3566) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,184 INFO L439 ceAbstractionStarter]: At program point L3399-1(lines 3393 3401) 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-16 00:44:29,184 INFO L439 ceAbstractionStarter]: At program point L3399(lines 3393 3401) 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-16 00:44:29,184 INFO L439 ceAbstractionStarter]: At program point L4060loopEntry(lines 4060 4073) 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-16 00:44:29,184 INFO L439 ceAbstractionStarter]: At program point L4193(lines 4192 4194) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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) (<= 1 ~ldv_urb_state~0)) [2019-11-16 00:44:29,184 INFO L443 ceAbstractionStarter]: For program point L4094(lines 4094 4099) no Hoare annotation was computed. [2019-11-16 00:44:29,184 INFO L443 ceAbstractionStarter]: For program point L4094-2(lines 4094 4099) no Hoare annotation was computed. [2019-11-16 00:44:29,184 INFO L443 ceAbstractionStarter]: For program point L4061(line 4061) no Hoare annotation was computed. [2019-11-16 00:44:29,185 INFO L443 ceAbstractionStarter]: For program point L3962(lines 3962 3965) no Hoare annotation was computed. [2019-11-16 00:44:29,185 INFO L439 ceAbstractionStarter]: At program point L3434(lines 3430 3436) 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-16 00:44:29,185 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:44:29,185 INFO L439 ceAbstractionStarter]: At program point L3501(lines 3500 3502) 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-16 00:44:29,185 INFO L439 ceAbstractionStarter]: At program point L4162(lines 4138 4167) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 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) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,185 INFO L439 ceAbstractionStarter]: At program point L4162-1(lines 4138 4167) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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)) [2019-11-16 00:44:29,185 INFO L439 ceAbstractionStarter]: At program point L4031(lines 3949 4033) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-11-16 00:44:29,186 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-11-16 00:44:29,186 INFO L439 ceAbstractionStarter]: At program point L4197-1(lines 4196 4198) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,186 INFO L439 ceAbstractionStarter]: At program point L4197(lines 4196 4198) the Hoare annotation is: (and (<= ~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) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-16 00:44:29,186 INFO L443 ceAbstractionStarter]: For program point L4131(lines 4116 4132) no Hoare annotation was computed. [2019-11-16 00:44:29,186 INFO L439 ceAbstractionStarter]: At program point L4197-2(lines 4196 4198) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 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) (<= 1 ~ldv_urb_state~0)) [2019-11-16 00:44:29,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:44:29 BoogieIcfgContainer [2019-11-16 00:44:29,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:44:29,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:29,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:29,233 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:29,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:18" (3/4) ... [2019-11-16 00:44:29,242 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:44:29,276 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2019-11-16 00:44:29,278 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2019-11-16 00:44:29,279 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-16 00:44:29,281 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:44:29,313 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-16 00:44:29,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 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) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) [2019-11-16 00:44:29,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 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) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) [2019-11-16 00:44:29,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_s_kbtab_driver_usb_driver && ((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) || ((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && (!(ldv_s_kbtab_driver_usb_driver == 1) && 1 <= ldv_coherent_state) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 1 <= ldv_urb_state)) || ((((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)) || ((((((\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) && 1 <= ldv_urb_state) [2019-11-16 00:44:29,315 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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) && 1 <= ldv_urb_state [2019-11-16 00:44:29,315 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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) && 1 <= ldv_urb_state [2019-11-16 00:44:29,316 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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) && 1 <= ldv_urb_state [2019-11-16 00:44:29,316 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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) && 1 <= ldv_urb_state [2019-11-16 00:44:29,316 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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) && 1 <= ldv_urb_state [2019-11-16 00:44:29,316 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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) && 1 <= ldv_urb_state [2019-11-16 00:44:29,317 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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) && 1 <= ldv_urb_state [2019-11-16 00:44:29,317 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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 [2019-11-16 00:44:29,317 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\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 [2019-11-16 00:44:29,317 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 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 [2019-11-16 00:44:29,318 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 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 [2019-11-16 00:44:29,318 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) [2019-11-16 00:44:29,319 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && (!(0 == \result) || !(\result == 0))) && ldv_s_kbtab_driver_usb_driver == 0) || (((((0 == ldv_coherent_state && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && ldv_s_kbtab_driver_usb_driver == 0) [2019-11-16 00:44:29,319 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) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) || (0 == ldv_coherent_state && ((!(\result == 0) && !(0 == res_kbtab_probe_3)) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) [2019-11-16 00:44:29,319 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && (!(\result == 0) || !(\result == 0))) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) [2019-11-16 00:44:29,499 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f5518f85-0759-4f1f-b2b5-2b14c2ad1655/bin/uautomizer/witness.graphml [2019-11-16 00:44:29,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:29,501 INFO L168 Benchmark]: Toolchain (without parser) took 14623.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 489.2 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -93.0 MB). Peak memory consumption was 396.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:29,501 INFO L168 Benchmark]: CDTParser took 0.28 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-16 00:44:29,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1286.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:29,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.21 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:29,502 INFO L168 Benchmark]: Boogie Preprocessor took 100.00 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:29,503 INFO L168 Benchmark]: RCFGBuilder took 1771.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 907.7 MB in the end (delta: 163.2 MB). Peak memory consumption was 163.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:29,503 INFO L168 Benchmark]: TraceAbstraction took 11072.07 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 331.9 MB). Free memory was 907.7 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:29,503 INFO L168 Benchmark]: Witness Printer took 266.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:29,505 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.28 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 1286.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.21 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.00 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1771.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 907.7 MB in the end (delta: 163.2 MB). Peak memory consumption was 163.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11072.07 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 331.9 MB). Free memory was 907.7 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. * Witness Printer took 266.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: 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: 4054]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && (!(0 == \result) || !(\result == 0))) && ldv_s_kbtab_driver_usb_driver == 0) || (((((0 == ldv_coherent_state && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4248]: 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: 3996]: Loop Invariant Derived loop invariant: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) || (0 == ldv_coherent_state && ((!(\result == 0) && !(0 == res_kbtab_probe_3)) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 4248]: 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: 4248]: 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: 3453]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((((\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) && 1 <= ldv_urb_state - InvariantResult [Line: 4117]: Loop Invariant Derived loop invariant: ((((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 - InvariantResult [Line: 4222]: 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: 4172]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: ((((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 - InvariantResult [Line: 4169]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - 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: 4230]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3985]: Loop Invariant Derived loop invariant: (((1 <= ldv_s_kbtab_driver_usb_driver && ((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) || ((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && (!(ldv_s_kbtab_driver_usb_driver == 1) && 1 <= ldv_coherent_state) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 1 <= ldv_urb_state)) || ((((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)) || ((((((\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) && 1 <= ldv_urb_state) - 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: 4085]: Loop Invariant Derived loop invariant: (((((\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 - InvariantResult [Line: 3410]: Loop Invariant Derived loop invariant: (((((\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) && 1 <= ldv_urb_state - InvariantResult [Line: 3421]: Loop Invariant Derived loop invariant: (((((\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) && 1 <= ldv_urb_state - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: (((((!(error == 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) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3437]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3421]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4212]: Loop Invariant Derived loop invariant: (((((\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) && 1 <= ldv_urb_state - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((!(error == 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) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3430]: 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: 4138]: Loop Invariant Derived loop invariant: (((((\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 - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((!(error == 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) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3967]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3494]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 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) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3982]: Loop Invariant Derived loop invariant: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 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) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && error + 12 <= 0 && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) || (((((!(error == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4060]: 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: 3899]: 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: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3500]: 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: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3949]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3513]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4202]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && error + 12 <= 0 && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) || (((((!(error == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - 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: 4081]: Loop Invariant Derived loop invariant: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 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 - InvariantResult [Line: 3897]: 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: 3393]: 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: 4081]: Loop Invariant Derived loop invariant: ((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && 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)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3770]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && 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: 3393]: 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: 4112]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && (!(\result == 0) || !(\result == 0))) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: (((((\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) && 1 <= ldv_urb_state - InvariantResult [Line: 4142]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4192]: Loop Invariant Derived loop invariant: (((((\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) && 1 <= ldv_urb_state - InvariantResult [Line: 3557]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4142]: Loop Invariant Derived loop invariant: (((((\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) && 1 <= ldv_urb_state - InvariantResult [Line: 4222]: Loop Invariant Derived loop invariant: ((((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 - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4240]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3463]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4218]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 6 error locations. Result: SAFE, OverallTime: 10.9s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, HoareTripleCheckerStatistics: 3030 SDtfs, 1824 SDslu, 4115 SDs, 0 SdLazy, 278 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred 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, 1279 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 185 NumberOfFragments, 2134 HoareAnnotationTreeSize, 68 FomulaSimplifications, 128681 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 68 FomulaSimplificationsInter, 5965 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1017 ConstructedInterpolants, 0 QuantifiedInterpolants, 134104 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1065 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...