./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/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 32bit --witnessprinter.graph.data.programhash 8ad17193196daf327eee34f8d3cbf6704a80a533 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:19:55,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:19:55,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:19:56,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:19:56,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:19:56,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:19:56,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:19:56,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:19:56,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:19:56,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:19:56,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:19:56,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:19:56,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:19:56,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:19:56,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:19:56,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:19:56,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:19:56,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:19:56,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:19:56,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:19:56,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:19:56,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:19:56,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:19:56,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:19:56,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:19:56,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:19:56,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:19:56,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:19:56,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:19:56,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:19:56,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:19:56,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:19:56,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:19:56,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:19:56,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:19:56,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:19:56,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:19:56,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:19:56,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:19:56,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:19:56,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:19:56,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:19:56,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:19:56,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:19:56,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:19:56,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:19:56,102 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:19:56,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:19:56,102 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:19:56,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:19:56,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:19:56,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:19:56,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:19:56,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:19:56,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:19:56,104 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:19:56,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:19:56,104 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:19:56,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:19:56,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:19:56,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:19:56,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:19:56,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:19:56,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:19:56,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:19:56,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:19:56,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:19:56,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:19:56,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:19:56,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:19:56,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_38da0288-54df-452f-9122-211d000b8c15/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ad17193196daf327eee34f8d3cbf6704a80a533 [2019-11-20 02:19:56,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:19:56,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:19:56,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:19:56,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:19:56,316 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:19:56,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-20 02:19:56,381 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/data/0ec4b7efe/65bd3f0f0f4246e5bb21c78bda8f2544/FLAG38a2a98af [2019-11-20 02:19:56,946 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:19:56,948 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-20 02:19:56,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/data/0ec4b7efe/65bd3f0f0f4246e5bb21c78bda8f2544/FLAG38a2a98af [2019-11-20 02:19:57,294 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/data/0ec4b7efe/65bd3f0f0f4246e5bb21c78bda8f2544 [2019-11-20 02:19:57,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:19:57,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:19:57,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:19:57,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:19:57,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:19:57,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:19:57" (1/1) ... [2019-11-20 02:19:57,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e80f41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:57, skipping insertion in model container [2019-11-20 02:19:57,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:19:57" (1/1) ... [2019-11-20 02:19:57,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:19:57,390 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:19:57,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:19:57,874 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:19:58,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:19:58,054 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:19:58,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58 WrapperNode [2019-11-20 02:19:58,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:19:58,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:19:58,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:19:58,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:19:58,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:19:58,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:19:58,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:19:58,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:19:58,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... [2019-11-20 02:19:58,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:19:58,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:19:58,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:19:58,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:19:58,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/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-20 02:19:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:19:58,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:19:58,822 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,843 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,848 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,859 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,873 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,888 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,894 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,899 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,903 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,912 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,913 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,915 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,917 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,928 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,928 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,929 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,932 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,934 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,935 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,935 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,940 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,942 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,949 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,955 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,957 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,959 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,961 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,962 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,962 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:19:58,964 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:20:00,450 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-11-20 02:20:00,450 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-11-20 02:20:00,450 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-11-20 02:20:00,450 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-11-20 02:20:00,451 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-11-20 02:20:00,451 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-11-20 02:20:00,451 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-11-20 02:20:00,451 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-11-20 02:20:00,457 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-11-20 02:20:00,457 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-11-20 02:20:00,457 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-20 02:20:00,458 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-20 02:20:00,458 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-20 02:20:00,458 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-20 02:20:00,458 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-11-20 02:20:00,458 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-11-20 02:20:00,459 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-11-20 02:20:00,459 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-11-20 02:20:00,459 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-20 02:20:00,460 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-20 02:20:00,461 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-11-20 02:20:00,462 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-20 02:20:00,462 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-20 02:20:00,462 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-11-20 02:20:00,463 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-11-20 02:20:00,463 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-11-20 02:20:00,463 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-11-20 02:20:00,463 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-11-20 02:20:00,463 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-11-20 02:20:00,464 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-11-20 02:20:00,464 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-11-20 02:20:00,464 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-11-20 02:20:00,464 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-11-20 02:20:00,465 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-11-20 02:20:00,466 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-11-20 02:20:00,466 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-11-20 02:20:00,471 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-20 02:20:00,471 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-20 02:20:00,472 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-11-20 02:20:00,472 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-11-20 02:20:00,472 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-11-20 02:20:00,473 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-11-20 02:20:00,473 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-11-20 02:20:00,473 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-11-20 02:20:00,479 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-11-20 02:20:00,479 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-11-20 02:20:00,480 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-11-20 02:20:00,480 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-11-20 02:20:00,480 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-11-20 02:20:00,480 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-11-20 02:20:00,481 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-11-20 02:20:00,481 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-11-20 02:20:00,481 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-11-20 02:20:00,481 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-11-20 02:20:00,481 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-20 02:20:00,482 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-20 02:20:00,482 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-11-20 02:20:00,482 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-11-20 02:20:00,482 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-20 02:20:00,482 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-20 02:20:00,484 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:20:00,484 INFO L285 CfgBuilder]: Removed 275 assume(true) statements. [2019-11-20 02:20:00,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:20:00 BoogieIcfgContainer [2019-11-20 02:20:00,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:20:00,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:20:00,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:20:00,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:20:00,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:19:57" (1/3) ... [2019-11-20 02:20:00,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a34fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:20:00, skipping insertion in model container [2019-11-20 02:20:00,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:19:58" (2/3) ... [2019-11-20 02:20:00,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a34fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:20:00, skipping insertion in model container [2019-11-20 02:20:00,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:20:00" (3/3) ... [2019-11-20 02:20:00,499 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-11-20 02:20:00,511 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:20:00,520 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2019-11-20 02:20:00,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2019-11-20 02:20:00,581 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:20:00,582 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:20:00,582 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:20:00,582 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:20:00,583 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:20:00,583 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:20:00,584 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:20:00,584 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:20:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states. [2019-11-20 02:20:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 02:20:00,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:00,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:00,639 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:00,648 INFO L82 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2019-11-20 02:20:00,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:00,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311506866] [2019-11-20 02:20:00,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:00,948 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-20 02:20:00,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311506866] [2019-11-20 02:20:00,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:00,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:00,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212353121] [2019-11-20 02:20:00,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:00,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:00,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:00,979 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 3 states. [2019-11-20 02:20:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:01,553 INFO L93 Difference]: Finished difference Result 1130 states and 1620 transitions. [2019-11-20 02:20:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:01,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 02:20:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:01,588 INFO L225 Difference]: With dead ends: 1130 [2019-11-20 02:20:01,589 INFO L226 Difference]: Without dead ends: 686 [2019-11-20 02:20:01,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-20 02:20:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 663. [2019-11-20 02:20:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-20 02:20:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 902 transitions. [2019-11-20 02:20:01,706 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 902 transitions. Word has length 10 [2019-11-20 02:20:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:01,707 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 902 transitions. [2019-11-20 02:20:01,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 902 transitions. [2019-11-20 02:20:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 02:20:01,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:01,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:01,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:01,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2019-11-20 02:20:01,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:01,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760192758] [2019-11-20 02:20:01,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:01,758 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-20 02:20:01,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760192758] [2019-11-20 02:20:01,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:01,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:01,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084557221] [2019-11-20 02:20:01,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:01,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:01,761 INFO L87 Difference]: Start difference. First operand 663 states and 902 transitions. Second operand 3 states. [2019-11-20 02:20:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:01,803 INFO L93 Difference]: Finished difference Result 682 states and 924 transitions. [2019-11-20 02:20:01,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:01,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 02:20:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:01,809 INFO L225 Difference]: With dead ends: 682 [2019-11-20 02:20:01,809 INFO L226 Difference]: Without dead ends: 663 [2019-11-20 02:20:01,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-20 02:20:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-11-20 02:20:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-20 02:20:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 901 transitions. [2019-11-20 02:20:01,914 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 901 transitions. Word has length 11 [2019-11-20 02:20:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:01,914 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 901 transitions. [2019-11-20 02:20:01,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 901 transitions. [2019-11-20 02:20:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 02:20:01,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:01,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:01,918 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:01,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2019-11-20 02:20:01,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:01,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735834861] [2019-11-20 02:20:01,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:02,067 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-20 02:20:02,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735834861] [2019-11-20 02:20:02,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:02,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:02,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443350984] [2019-11-20 02:20:02,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:02,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:02,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:02,069 INFO L87 Difference]: Start difference. First operand 663 states and 901 transitions. Second operand 3 states. [2019-11-20 02:20:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:02,137 INFO L93 Difference]: Finished difference Result 756 states and 1015 transitions. [2019-11-20 02:20:02,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:02,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 02:20:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:02,142 INFO L225 Difference]: With dead ends: 756 [2019-11-20 02:20:02,142 INFO L226 Difference]: Without dead ends: 732 [2019-11-20 02:20:02,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-11-20 02:20:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 677. [2019-11-20 02:20:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-20 02:20:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 929 transitions. [2019-11-20 02:20:02,177 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 929 transitions. Word has length 16 [2019-11-20 02:20:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:02,178 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 929 transitions. [2019-11-20 02:20:02,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 929 transitions. [2019-11-20 02:20:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:20:02,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:02,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:02,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2019-11-20 02:20:02,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:02,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110923638] [2019-11-20 02:20:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:02,263 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-20 02:20:02,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110923638] [2019-11-20 02:20:02,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:02,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:02,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237262828] [2019-11-20 02:20:02,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:02,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:02,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:02,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:02,265 INFO L87 Difference]: Start difference. First operand 677 states and 929 transitions. Second operand 3 states. [2019-11-20 02:20:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:02,514 INFO L93 Difference]: Finished difference Result 705 states and 963 transitions. [2019-11-20 02:20:02,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:02,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 02:20:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:02,520 INFO L225 Difference]: With dead ends: 705 [2019-11-20 02:20:02,520 INFO L226 Difference]: Without dead ends: 700 [2019-11-20 02:20:02,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-11-20 02:20:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2019-11-20 02:20:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-11-20 02:20:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 958 transitions. [2019-11-20 02:20:02,561 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 958 transitions. Word has length 19 [2019-11-20 02:20:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:02,562 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 958 transitions. [2019-11-20 02:20:02,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 958 transitions. [2019-11-20 02:20:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:20:02,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:02,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:02,576 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:02,578 INFO L82 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2019-11-20 02:20:02,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:02,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785565889] [2019-11-20 02:20:02,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:02,638 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-20 02:20:02,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785565889] [2019-11-20 02:20:02,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:02,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:02,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105184550] [2019-11-20 02:20:02,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:02,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:02,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:02,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:02,641 INFO L87 Difference]: Start difference. First operand 700 states and 958 transitions. Second operand 3 states. [2019-11-20 02:20:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:02,746 INFO L93 Difference]: Finished difference Result 1205 states and 1636 transitions. [2019-11-20 02:20:02,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:02,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 02:20:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:02,752 INFO L225 Difference]: With dead ends: 1205 [2019-11-20 02:20:02,753 INFO L226 Difference]: Without dead ends: 843 [2019-11-20 02:20:02,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-11-20 02:20:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 682. [2019-11-20 02:20:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-11-20 02:20:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 934 transitions. [2019-11-20 02:20:02,794 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 934 transitions. Word has length 19 [2019-11-20 02:20:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:02,795 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 934 transitions. [2019-11-20 02:20:02,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 934 transitions. [2019-11-20 02:20:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 02:20:02,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:02,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:02,798 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:02,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash -946930085, now seen corresponding path program 1 times [2019-11-20 02:20:02,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:02,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689652206] [2019-11-20 02:20:02,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:02,883 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-20 02:20:02,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689652206] [2019-11-20 02:20:02,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:02,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:02,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886218229] [2019-11-20 02:20:02,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:02,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:02,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:02,885 INFO L87 Difference]: Start difference. First operand 682 states and 934 transitions. Second operand 4 states. [2019-11-20 02:20:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:02,968 INFO L93 Difference]: Finished difference Result 694 states and 947 transitions. [2019-11-20 02:20:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:02,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-20 02:20:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:02,974 INFO L225 Difference]: With dead ends: 694 [2019-11-20 02:20:02,974 INFO L226 Difference]: Without dead ends: 674 [2019-11-20 02:20:02,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-11-20 02:20:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2019-11-20 02:20:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-20 02:20:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 924 transitions. [2019-11-20 02:20:03,014 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 924 transitions. Word has length 20 [2019-11-20 02:20:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:03,014 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 924 transitions. [2019-11-20 02:20:03,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 924 transitions. [2019-11-20 02:20:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:20:03,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:03,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:03,016 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2019-11-20 02:20:03,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:03,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097160192] [2019-11-20 02:20:03,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:20:03,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097160192] [2019-11-20 02:20:03,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:03,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:03,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683471588] [2019-11-20 02:20:03,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:03,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:03,078 INFO L87 Difference]: Start difference. First operand 674 states and 924 transitions. Second operand 3 states. [2019-11-20 02:20:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:03,375 INFO L93 Difference]: Finished difference Result 674 states and 924 transitions. [2019-11-20 02:20:03,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:03,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 02:20:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:03,381 INFO L225 Difference]: With dead ends: 674 [2019-11-20 02:20:03,385 INFO L226 Difference]: Without dead ends: 658 [2019-11-20 02:20:03,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-20 02:20:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-11-20 02:20:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-20 02:20:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 907 transitions. [2019-11-20 02:20:03,428 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 907 transitions. Word has length 23 [2019-11-20 02:20:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:03,428 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 907 transitions. [2019-11-20 02:20:03,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 907 transitions. [2019-11-20 02:20:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 02:20:03,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:03,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:03,431 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:03,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:03,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1059264480, now seen corresponding path program 1 times [2019-11-20 02:20:03,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:03,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581236813] [2019-11-20 02:20:03,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:03,513 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-20 02:20:03,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581236813] [2019-11-20 02:20:03,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:03,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:03,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391751871] [2019-11-20 02:20:03,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:03,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:03,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:03,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:03,516 INFO L87 Difference]: Start difference. First operand 658 states and 907 transitions. Second operand 4 states. [2019-11-20 02:20:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:03,587 INFO L93 Difference]: Finished difference Result 671 states and 921 transitions. [2019-11-20 02:20:03,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:03,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 02:20:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:03,593 INFO L225 Difference]: With dead ends: 671 [2019-11-20 02:20:03,594 INFO L226 Difference]: Without dead ends: 656 [2019-11-20 02:20:03,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-20 02:20:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-11-20 02:20:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-20 02:20:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-11-20 02:20:03,631 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 24 [2019-11-20 02:20:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:03,634 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-11-20 02:20:03,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-11-20 02:20:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 02:20:03,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:03,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:03,636 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2019-11-20 02:20:03,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:03,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029036320] [2019-11-20 02:20:03,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:03,685 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-20 02:20:03,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029036320] [2019-11-20 02:20:03,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:03,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:03,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971335371] [2019-11-20 02:20:03,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:03,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:03,687 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-11-20 02:20:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:03,993 INFO L93 Difference]: Finished difference Result 855 states and 1170 transitions. [2019-11-20 02:20:03,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:03,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 02:20:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:04,001 INFO L225 Difference]: With dead ends: 855 [2019-11-20 02:20:04,001 INFO L226 Difference]: Without dead ends: 847 [2019-11-20 02:20:04,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-11-20 02:20:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 674. [2019-11-20 02:20:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-20 02:20:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 931 transitions. [2019-11-20 02:20:04,044 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 931 transitions. Word has length 25 [2019-11-20 02:20:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:04,045 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 931 transitions. [2019-11-20 02:20:04,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 931 transitions. [2019-11-20 02:20:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 02:20:04,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:04,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:04,048 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:04,049 INFO L82 PathProgramCache]: Analyzing trace with hash 417423376, now seen corresponding path program 1 times [2019-11-20 02:20:04,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:04,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987797391] [2019-11-20 02:20:04,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:04,153 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-20 02:20:04,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987797391] [2019-11-20 02:20:04,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:04,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:20:04,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847786152] [2019-11-20 02:20:04,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:20:04,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:20:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:04,155 INFO L87 Difference]: Start difference. First operand 674 states and 931 transitions. Second operand 7 states. [2019-11-20 02:20:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:05,023 INFO L93 Difference]: Finished difference Result 998 states and 1339 transitions. [2019-11-20 02:20:05,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:20:05,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-20 02:20:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:05,028 INFO L225 Difference]: With dead ends: 998 [2019-11-20 02:20:05,029 INFO L226 Difference]: Without dead ends: 749 [2019-11-20 02:20:05,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:20:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-11-20 02:20:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 657. [2019-11-20 02:20:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-20 02:20:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 895 transitions. [2019-11-20 02:20:05,123 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 895 transitions. Word has length 26 [2019-11-20 02:20:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:05,124 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 895 transitions. [2019-11-20 02:20:05,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:20:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 895 transitions. [2019-11-20 02:20:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 02:20:05,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:05,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:05,127 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash -65691980, now seen corresponding path program 1 times [2019-11-20 02:20:05,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:05,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496089259] [2019-11-20 02:20:05,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:05,161 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-20 02:20:05,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496089259] [2019-11-20 02:20:05,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:05,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:05,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162019123] [2019-11-20 02:20:05,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:05,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:05,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:05,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:05,163 INFO L87 Difference]: Start difference. First operand 657 states and 895 transitions. Second operand 4 states. [2019-11-20 02:20:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:05,222 INFO L93 Difference]: Finished difference Result 670 states and 909 transitions. [2019-11-20 02:20:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:05,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-20 02:20:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:05,227 INFO L225 Difference]: With dead ends: 670 [2019-11-20 02:20:05,227 INFO L226 Difference]: Without dead ends: 655 [2019-11-20 02:20:05,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-20 02:20:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-11-20 02:20:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-20 02:20:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 892 transitions. [2019-11-20 02:20:05,262 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 892 transitions. Word has length 26 [2019-11-20 02:20:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:05,263 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 892 transitions. [2019-11-20 02:20:05,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 892 transitions. [2019-11-20 02:20:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 02:20:05,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:05,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:05,266 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:05,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:05,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2019-11-20 02:20:05,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:05,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480413533] [2019-11-20 02:20:05,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:05,302 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-20 02:20:05,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480413533] [2019-11-20 02:20:05,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:05,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:05,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511324463] [2019-11-20 02:20:05,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:05,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:05,304 INFO L87 Difference]: Start difference. First operand 655 states and 892 transitions. Second operand 4 states. [2019-11-20 02:20:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:05,379 INFO L93 Difference]: Finished difference Result 693 states and 933 transitions. [2019-11-20 02:20:05,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:05,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-20 02:20:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:05,383 INFO L225 Difference]: With dead ends: 693 [2019-11-20 02:20:05,384 INFO L226 Difference]: Without dead ends: 672 [2019-11-20 02:20:05,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-20 02:20:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 657. [2019-11-20 02:20:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-20 02:20:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 894 transitions. [2019-11-20 02:20:05,415 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 894 transitions. Word has length 27 [2019-11-20 02:20:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:05,416 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 894 transitions. [2019-11-20 02:20:05,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 894 transitions. [2019-11-20 02:20:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 02:20:05,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:05,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:05,418 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2019-11-20 02:20:05,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:05,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12629956] [2019-11-20 02:20:05,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:05,447 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-20 02:20:05,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12629956] [2019-11-20 02:20:05,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:05,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:05,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026409733] [2019-11-20 02:20:05,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:05,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:05,449 INFO L87 Difference]: Start difference. First operand 657 states and 894 transitions. Second operand 3 states. [2019-11-20 02:20:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:05,493 INFO L93 Difference]: Finished difference Result 697 states and 943 transitions. [2019-11-20 02:20:05,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:05,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 02:20:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:05,498 INFO L225 Difference]: With dead ends: 697 [2019-11-20 02:20:05,498 INFO L226 Difference]: Without dead ends: 634 [2019-11-20 02:20:05,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-20 02:20:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-11-20 02:20:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-20 02:20:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 857 transitions. [2019-11-20 02:20:05,530 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 857 transitions. Word has length 27 [2019-11-20 02:20:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:05,530 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 857 transitions. [2019-11-20 02:20:05,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 857 transitions. [2019-11-20 02:20:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 02:20:05,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:05,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:05,532 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2019-11-20 02:20:05,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:05,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509641585] [2019-11-20 02:20:05,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:05,570 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-20 02:20:05,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509641585] [2019-11-20 02:20:05,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:05,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:05,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629068758] [2019-11-20 02:20:05,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:05,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:05,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:05,572 INFO L87 Difference]: Start difference. First operand 632 states and 857 transitions. Second operand 4 states. [2019-11-20 02:20:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:05,650 INFO L93 Difference]: Finished difference Result 670 states and 898 transitions. [2019-11-20 02:20:05,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:05,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-20 02:20:05,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:05,655 INFO L225 Difference]: With dead ends: 670 [2019-11-20 02:20:05,655 INFO L226 Difference]: Without dead ends: 649 [2019-11-20 02:20:05,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-20 02:20:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 632. [2019-11-20 02:20:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-20 02:20:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 857 transitions. [2019-11-20 02:20:05,695 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 857 transitions. Word has length 28 [2019-11-20 02:20:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:05,696 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 857 transitions. [2019-11-20 02:20:05,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 857 transitions. [2019-11-20 02:20:05,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 02:20:05,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:05,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:05,698 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:05,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:05,699 INFO L82 PathProgramCache]: Analyzing trace with hash 615415176, now seen corresponding path program 1 times [2019-11-20 02:20:05,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:05,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088327431] [2019-11-20 02:20:05,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:05,794 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-20 02:20:05,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088327431] [2019-11-20 02:20:05,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:05,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 02:20:05,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741148602] [2019-11-20 02:20:05,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:20:05,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:20:05,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:20:05,796 INFO L87 Difference]: Start difference. First operand 632 states and 857 transitions. Second operand 8 states. [2019-11-20 02:20:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:06,565 INFO L93 Difference]: Finished difference Result 654 states and 879 transitions. [2019-11-20 02:20:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:20:06,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-20 02:20:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:06,570 INFO L225 Difference]: With dead ends: 654 [2019-11-20 02:20:06,570 INFO L226 Difference]: Without dead ends: 649 [2019-11-20 02:20:06,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:20:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-20 02:20:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 642. [2019-11-20 02:20:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-20 02:20:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 867 transitions. [2019-11-20 02:20:06,607 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 867 transitions. Word has length 29 [2019-11-20 02:20:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:06,607 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 867 transitions. [2019-11-20 02:20:06,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:20:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 867 transitions. [2019-11-20 02:20:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 02:20:06,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:06,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:06,609 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1368733509, now seen corresponding path program 1 times [2019-11-20 02:20:06,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:06,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903001079] [2019-11-20 02:20:06,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:06,703 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-20 02:20:06,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903001079] [2019-11-20 02:20:06,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:06,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 02:20:06,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62812320] [2019-11-20 02:20:06,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:20:06,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:06,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:20:06,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:20:06,705 INFO L87 Difference]: Start difference. First operand 642 states and 867 transitions. Second operand 8 states. [2019-11-20 02:20:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:07,480 INFO L93 Difference]: Finished difference Result 654 states and 878 transitions. [2019-11-20 02:20:07,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:20:07,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-20 02:20:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:07,485 INFO L225 Difference]: With dead ends: 654 [2019-11-20 02:20:07,486 INFO L226 Difference]: Without dead ends: 649 [2019-11-20 02:20:07,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:20:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-20 02:20:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2019-11-20 02:20:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-20 02:20:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 868 transitions. [2019-11-20 02:20:07,534 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 868 transitions. Word has length 30 [2019-11-20 02:20:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:07,535 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 868 transitions. [2019-11-20 02:20:07,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:20:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 868 transitions. [2019-11-20 02:20:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 02:20:07,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:07,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:07,538 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1926882852, now seen corresponding path program 1 times [2019-11-20 02:20:07,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:07,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436723145] [2019-11-20 02:20:07,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:07,609 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-20 02:20:07,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436723145] [2019-11-20 02:20:07,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:07,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:20:07,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313478959] [2019-11-20 02:20:07,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:20:07,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:07,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:20:07,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:20:07,611 INFO L87 Difference]: Start difference. First operand 643 states and 868 transitions. Second operand 6 states. [2019-11-20 02:20:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:07,812 INFO L93 Difference]: Finished difference Result 697 states and 927 transitions. [2019-11-20 02:20:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:20:07,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-20 02:20:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:07,817 INFO L225 Difference]: With dead ends: 697 [2019-11-20 02:20:07,817 INFO L226 Difference]: Without dead ends: 640 [2019-11-20 02:20:07,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:20:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-20 02:20:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2019-11-20 02:20:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-11-20 02:20:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 827 transitions. [2019-11-20 02:20:07,865 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 827 transitions. Word has length 30 [2019-11-20 02:20:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:07,866 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 827 transitions. [2019-11-20 02:20:07,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:20:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 827 transitions. [2019-11-20 02:20:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 02:20:07,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:07,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:07,868 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:07,869 INFO L82 PathProgramCache]: Analyzing trace with hash 455111851, now seen corresponding path program 1 times [2019-11-20 02:20:07,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:07,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479576811] [2019-11-20 02:20:07,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:08,016 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-20 02:20:08,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479576811] [2019-11-20 02:20:08,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:08,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 02:20:08,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533595843] [2019-11-20 02:20:08,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 02:20:08,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:08,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:20:08,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:20:08,018 INFO L87 Difference]: Start difference. First operand 620 states and 827 transitions. Second operand 9 states. [2019-11-20 02:20:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:08,761 INFO L93 Difference]: Finished difference Result 637 states and 844 transitions. [2019-11-20 02:20:08,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:20:08,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-20 02:20:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:08,766 INFO L225 Difference]: With dead ends: 637 [2019-11-20 02:20:08,766 INFO L226 Difference]: Without dead ends: 632 [2019-11-20 02:20:08,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-20 02:20:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-20 02:20:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2019-11-20 02:20:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-11-20 02:20:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 826 transitions. [2019-11-20 02:20:08,804 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 826 transitions. Word has length 30 [2019-11-20 02:20:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:08,804 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 826 transitions. [2019-11-20 02:20:08,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 02:20:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 826 transitions. [2019-11-20 02:20:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 02:20:08,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:08,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:08,806 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2019-11-20 02:20:08,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:08,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882208343] [2019-11-20 02:20:08,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:08,841 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-20 02:20:08,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882208343] [2019-11-20 02:20:08,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:08,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:08,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658970879] [2019-11-20 02:20:08,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:08,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:08,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:08,843 INFO L87 Difference]: Start difference. First operand 620 states and 826 transitions. Second operand 3 states. [2019-11-20 02:20:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:09,092 INFO L93 Difference]: Finished difference Result 801 states and 1053 transitions. [2019-11-20 02:20:09,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:09,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-20 02:20:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:09,097 INFO L225 Difference]: With dead ends: 801 [2019-11-20 02:20:09,097 INFO L226 Difference]: Without dead ends: 778 [2019-11-20 02:20:09,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-11-20 02:20:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 658. [2019-11-20 02:20:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-20 02:20:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 869 transitions. [2019-11-20 02:20:09,136 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 869 transitions. Word has length 31 [2019-11-20 02:20:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:09,136 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 869 transitions. [2019-11-20 02:20:09,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 869 transitions. [2019-11-20 02:20:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 02:20:09,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:09,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:09,138 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash 694297730, now seen corresponding path program 1 times [2019-11-20 02:20:09,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:09,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341675981] [2019-11-20 02:20:09,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:09,289 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-20 02:20:09,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341675981] [2019-11-20 02:20:09,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:09,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 02:20:09,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429350765] [2019-11-20 02:20:09,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 02:20:09,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:20:09,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:20:09,291 INFO L87 Difference]: Start difference. First operand 658 states and 869 transitions. Second operand 9 states. [2019-11-20 02:20:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:10,048 INFO L93 Difference]: Finished difference Result 675 states and 885 transitions. [2019-11-20 02:20:10,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:20:10,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-20 02:20:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:10,052 INFO L225 Difference]: With dead ends: 675 [2019-11-20 02:20:10,052 INFO L226 Difference]: Without dead ends: 670 [2019-11-20 02:20:10,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-20 02:20:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-20 02:20:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 658. [2019-11-20 02:20:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-20 02:20:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 868 transitions. [2019-11-20 02:20:10,096 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 868 transitions. Word has length 31 [2019-11-20 02:20:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:10,096 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 868 transitions. [2019-11-20 02:20:10,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 02:20:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 868 transitions. [2019-11-20 02:20:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 02:20:10,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:10,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:10,098 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:10,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:10,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2019-11-20 02:20:10,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:10,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203174262] [2019-11-20 02:20:10,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:10,145 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-20 02:20:10,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203174262] [2019-11-20 02:20:10,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:10,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:10,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987085560] [2019-11-20 02:20:10,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:10,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:10,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:10,147 INFO L87 Difference]: Start difference. First operand 658 states and 868 transitions. Second operand 3 states. [2019-11-20 02:20:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:10,368 INFO L93 Difference]: Finished difference Result 866 states and 1144 transitions. [2019-11-20 02:20:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:10,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-20 02:20:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:10,372 INFO L225 Difference]: With dead ends: 866 [2019-11-20 02:20:10,373 INFO L226 Difference]: Without dead ends: 660 [2019-11-20 02:20:10,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-11-20 02:20:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-11-20 02:20:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-11-20 02:20:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 871 transitions. [2019-11-20 02:20:10,417 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 871 transitions. Word has length 31 [2019-11-20 02:20:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:10,417 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 871 transitions. [2019-11-20 02:20:10,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 871 transitions. [2019-11-20 02:20:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 02:20:10,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:10,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:10,420 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1153548271, now seen corresponding path program 1 times [2019-11-20 02:20:10,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:10,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448071479] [2019-11-20 02:20:10,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:10,481 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-20 02:20:10,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448071479] [2019-11-20 02:20:10,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:10,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:20:10,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295750802] [2019-11-20 02:20:10,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:20:10,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:20:10,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:20:10,484 INFO L87 Difference]: Start difference. First operand 660 states and 871 transitions. Second operand 6 states. [2019-11-20 02:20:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:10,950 INFO L93 Difference]: Finished difference Result 1317 states and 1722 transitions. [2019-11-20 02:20:10,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:20:10,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-20 02:20:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:10,957 INFO L225 Difference]: With dead ends: 1317 [2019-11-20 02:20:10,957 INFO L226 Difference]: Without dead ends: 1044 [2019-11-20 02:20:10,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:20:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-11-20 02:20:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 723. [2019-11-20 02:20:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-20 02:20:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 958 transitions. [2019-11-20 02:20:11,012 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 958 transitions. Word has length 32 [2019-11-20 02:20:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:11,012 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 958 transitions. [2019-11-20 02:20:11,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:20:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 958 transitions. [2019-11-20 02:20:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 02:20:11,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:11,015 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:11,015 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1153536355, now seen corresponding path program 1 times [2019-11-20 02:20:11,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:11,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523481348] [2019-11-20 02:20:11,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:11,068 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-20 02:20:11,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523481348] [2019-11-20 02:20:11,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:11,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:20:11,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928836652] [2019-11-20 02:20:11,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:20:11,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:11,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:20:11,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:20:11,070 INFO L87 Difference]: Start difference. First operand 723 states and 958 transitions. Second operand 6 states. [2019-11-20 02:20:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:11,390 INFO L93 Difference]: Finished difference Result 780 states and 1019 transitions. [2019-11-20 02:20:11,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:20:11,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-20 02:20:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:11,395 INFO L225 Difference]: With dead ends: 780 [2019-11-20 02:20:11,395 INFO L226 Difference]: Without dead ends: 764 [2019-11-20 02:20:11,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:20:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-11-20 02:20:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 719. [2019-11-20 02:20:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-11-20 02:20:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 952 transitions. [2019-11-20 02:20:11,441 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 952 transitions. Word has length 32 [2019-11-20 02:20:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:11,442 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 952 transitions. [2019-11-20 02:20:11,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:20:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 952 transitions. [2019-11-20 02:20:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 02:20:11,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:11,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:11,444 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash -311870270, now seen corresponding path program 1 times [2019-11-20 02:20:11,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:11,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924116942] [2019-11-20 02:20:11,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:11,498 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-20 02:20:11,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924116942] [2019-11-20 02:20:11,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:11,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:20:11,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613255619] [2019-11-20 02:20:11,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:20:11,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:20:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:20:11,500 INFO L87 Difference]: Start difference. First operand 719 states and 952 transitions. Second operand 6 states. [2019-11-20 02:20:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:11,611 INFO L93 Difference]: Finished difference Result 731 states and 963 transitions. [2019-11-20 02:20:11,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:20:11,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-20 02:20:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:11,615 INFO L225 Difference]: With dead ends: 731 [2019-11-20 02:20:11,616 INFO L226 Difference]: Without dead ends: 710 [2019-11-20 02:20:11,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:20:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-11-20 02:20:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2019-11-20 02:20:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2019-11-20 02:20:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 940 transitions. [2019-11-20 02:20:11,659 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 940 transitions. Word has length 32 [2019-11-20 02:20:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:11,659 INFO L462 AbstractCegarLoop]: Abstraction has 710 states and 940 transitions. [2019-11-20 02:20:11,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:20:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 940 transitions. [2019-11-20 02:20:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 02:20:11,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:11,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:11,661 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:11,662 INFO L82 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2019-11-20 02:20:11,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:11,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041500199] [2019-11-20 02:20:11,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:11,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-20 02:20:11,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041500199] [2019-11-20 02:20:11,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:11,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:11,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031865233] [2019-11-20 02:20:11,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:11,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:11,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:11,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:11,687 INFO L87 Difference]: Start difference. First operand 710 states and 940 transitions. Second operand 3 states. [2019-11-20 02:20:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:11,753 INFO L93 Difference]: Finished difference Result 893 states and 1175 transitions. [2019-11-20 02:20:11,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:11,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-20 02:20:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:11,757 INFO L225 Difference]: With dead ends: 893 [2019-11-20 02:20:11,758 INFO L226 Difference]: Without dead ends: 686 [2019-11-20 02:20:11,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-20 02:20:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 670. [2019-11-20 02:20:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-20 02:20:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 882 transitions. [2019-11-20 02:20:11,804 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 882 transitions. Word has length 32 [2019-11-20 02:20:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:11,805 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 882 transitions. [2019-11-20 02:20:11,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 882 transitions. [2019-11-20 02:20:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 02:20:11,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:11,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:11,807 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2019-11-20 02:20:11,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:11,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88206390] [2019-11-20 02:20:11,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:11,848 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-20 02:20:11,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88206390] [2019-11-20 02:20:11,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:11,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:11,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084936450] [2019-11-20 02:20:11,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:11,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:11,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:11,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:11,850 INFO L87 Difference]: Start difference. First operand 670 states and 882 transitions. Second operand 5 states. [2019-11-20 02:20:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:11,954 INFO L93 Difference]: Finished difference Result 771 states and 1000 transitions. [2019-11-20 02:20:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:20:11,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-20 02:20:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:11,958 INFO L225 Difference]: With dead ends: 771 [2019-11-20 02:20:11,959 INFO L226 Difference]: Without dead ends: 747 [2019-11-20 02:20:11,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-20 02:20:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 670. [2019-11-20 02:20:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-20 02:20:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 881 transitions. [2019-11-20 02:20:12,002 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 881 transitions. Word has length 33 [2019-11-20 02:20:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:12,003 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 881 transitions. [2019-11-20 02:20:12,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 881 transitions. [2019-11-20 02:20:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 02:20:12,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:12,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:12,007 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2019-11-20 02:20:12,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:12,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141989687] [2019-11-20 02:20:12,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:12,034 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-20 02:20:12,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141989687] [2019-11-20 02:20:12,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:12,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:12,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023781333] [2019-11-20 02:20:12,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:12,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:12,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:12,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:12,035 INFO L87 Difference]: Start difference. First operand 670 states and 881 transitions. Second operand 3 states. [2019-11-20 02:20:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:12,230 INFO L93 Difference]: Finished difference Result 808 states and 1046 transitions. [2019-11-20 02:20:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:12,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-20 02:20:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:12,236 INFO L225 Difference]: With dead ends: 808 [2019-11-20 02:20:12,236 INFO L226 Difference]: Without dead ends: 765 [2019-11-20 02:20:12,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-20 02:20:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 706. [2019-11-20 02:20:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-20 02:20:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 918 transitions. [2019-11-20 02:20:12,287 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 918 transitions. Word has length 33 [2019-11-20 02:20:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:12,287 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 918 transitions. [2019-11-20 02:20:12,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 918 transitions. [2019-11-20 02:20:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 02:20:12,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:12,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:12,294 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2019-11-20 02:20:12,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:12,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572281197] [2019-11-20 02:20:12,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:12,347 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-20 02:20:12,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572281197] [2019-11-20 02:20:12,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:12,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:12,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514547643] [2019-11-20 02:20:12,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:12,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:12,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:12,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:12,349 INFO L87 Difference]: Start difference. First operand 706 states and 918 transitions. Second operand 4 states. [2019-11-20 02:20:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:12,587 INFO L93 Difference]: Finished difference Result 725 states and 938 transitions. [2019-11-20 02:20:12,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:12,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-20 02:20:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:12,591 INFO L225 Difference]: With dead ends: 725 [2019-11-20 02:20:12,591 INFO L226 Difference]: Without dead ends: 599 [2019-11-20 02:20:12,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-11-20 02:20:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 587. [2019-11-20 02:20:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-20 02:20:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 755 transitions. [2019-11-20 02:20:12,639 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 755 transitions. Word has length 33 [2019-11-20 02:20:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:12,639 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 755 transitions. [2019-11-20 02:20:12,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 755 transitions. [2019-11-20 02:20:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 02:20:12,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:12,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:12,643 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1819353560, now seen corresponding path program 1 times [2019-11-20 02:20:12,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:12,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691933985] [2019-11-20 02:20:12,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:12,778 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-20 02:20:12,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691933985] [2019-11-20 02:20:12,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:12,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 02:20:12,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095426763] [2019-11-20 02:20:12,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:20:12,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:12,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:20:12,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:20:12,781 INFO L87 Difference]: Start difference. First operand 587 states and 755 transitions. Second operand 10 states. [2019-11-20 02:20:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:13,985 INFO L93 Difference]: Finished difference Result 668 states and 849 transitions. [2019-11-20 02:20:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 02:20:13,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-20 02:20:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:13,989 INFO L225 Difference]: With dead ends: 668 [2019-11-20 02:20:13,989 INFO L226 Difference]: Without dead ends: 652 [2019-11-20 02:20:13,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-20 02:20:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-11-20 02:20:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 589. [2019-11-20 02:20:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-11-20 02:20:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 757 transitions. [2019-11-20 02:20:14,044 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 757 transitions. Word has length 33 [2019-11-20 02:20:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:14,044 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 757 transitions. [2019-11-20 02:20:14,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:20:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 757 transitions. [2019-11-20 02:20:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 02:20:14,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:14,046 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:14,047 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -471627368, now seen corresponding path program 1 times [2019-11-20 02:20:14,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:14,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771791867] [2019-11-20 02:20:14,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:14,111 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-20 02:20:14,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771791867] [2019-11-20 02:20:14,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:14,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:14,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697947694] [2019-11-20 02:20:14,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:14,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:14,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:14,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:14,113 INFO L87 Difference]: Start difference. First operand 589 states and 757 transitions. Second operand 5 states. [2019-11-20 02:20:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:14,446 INFO L93 Difference]: Finished difference Result 599 states and 766 transitions. [2019-11-20 02:20:14,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:20:14,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-20 02:20:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:14,451 INFO L225 Difference]: With dead ends: 599 [2019-11-20 02:20:14,451 INFO L226 Difference]: Without dead ends: 583 [2019-11-20 02:20:14,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-11-20 02:20:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 578. [2019-11-20 02:20:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-20 02:20:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 743 transitions. [2019-11-20 02:20:14,509 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 743 transitions. Word has length 33 [2019-11-20 02:20:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:14,510 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 743 transitions. [2019-11-20 02:20:14,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 743 transitions. [2019-11-20 02:20:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 02:20:14,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:14,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:14,514 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:14,514 INFO L82 PathProgramCache]: Analyzing trace with hash -935653763, now seen corresponding path program 1 times [2019-11-20 02:20:14,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:14,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835836039] [2019-11-20 02:20:14,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:14,648 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-20 02:20:14,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835836039] [2019-11-20 02:20:14,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:14,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 02:20:14,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044431904] [2019-11-20 02:20:14,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 02:20:14,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:20:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:20:14,650 INFO L87 Difference]: Start difference. First operand 578 states and 743 transitions. Second operand 9 states. [2019-11-20 02:20:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:15,604 INFO L93 Difference]: Finished difference Result 947 states and 1209 transitions. [2019-11-20 02:20:15,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 02:20:15,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-20 02:20:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:15,610 INFO L225 Difference]: With dead ends: 947 [2019-11-20 02:20:15,610 INFO L226 Difference]: Without dead ends: 924 [2019-11-20 02:20:15,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-11-20 02:20:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-11-20 02:20:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 576. [2019-11-20 02:20:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-11-20 02:20:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 739 transitions. [2019-11-20 02:20:15,658 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 739 transitions. Word has length 35 [2019-11-20 02:20:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:15,659 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 739 transitions. [2019-11-20 02:20:15,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 02:20:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 739 transitions. [2019-11-20 02:20:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 02:20:15,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:15,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:15,661 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:15,662 INFO L82 PathProgramCache]: Analyzing trace with hash 749897277, now seen corresponding path program 1 times [2019-11-20 02:20:15,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:15,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881018038] [2019-11-20 02:20:15,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:15,703 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-20 02:20:15,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881018038] [2019-11-20 02:20:15,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:15,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:15,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730714726] [2019-11-20 02:20:15,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:15,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:15,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:15,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:15,705 INFO L87 Difference]: Start difference. First operand 576 states and 739 transitions. Second operand 4 states. [2019-11-20 02:20:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:15,948 INFO L93 Difference]: Finished difference Result 637 states and 818 transitions. [2019-11-20 02:20:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:15,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 02:20:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:15,953 INFO L225 Difference]: With dead ends: 637 [2019-11-20 02:20:15,953 INFO L226 Difference]: Without dead ends: 598 [2019-11-20 02:20:15,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-20 02:20:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 542. [2019-11-20 02:20:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-20 02:20:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 701 transitions. [2019-11-20 02:20:16,006 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 701 transitions. Word has length 35 [2019-11-20 02:20:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:16,006 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 701 transitions. [2019-11-20 02:20:16,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 701 transitions. [2019-11-20 02:20:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 02:20:16,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:16,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:16,008 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2019-11-20 02:20:16,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:16,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928600198] [2019-11-20 02:20:16,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:16,055 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-20 02:20:16,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928600198] [2019-11-20 02:20:16,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:16,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:16,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190425794] [2019-11-20 02:20:16,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:16,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:16,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:16,057 INFO L87 Difference]: Start difference. First operand 542 states and 701 transitions. Second operand 5 states. [2019-11-20 02:20:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:16,428 INFO L93 Difference]: Finished difference Result 1248 states and 1619 transitions. [2019-11-20 02:20:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:20:16,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-20 02:20:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:16,433 INFO L225 Difference]: With dead ends: 1248 [2019-11-20 02:20:16,433 INFO L226 Difference]: Without dead ends: 1062 [2019-11-20 02:20:16,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:20:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-20 02:20:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 549. [2019-11-20 02:20:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-11-20 02:20:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 708 transitions. [2019-11-20 02:20:16,541 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 708 transitions. Word has length 35 [2019-11-20 02:20:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:16,541 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 708 transitions. [2019-11-20 02:20:16,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 708 transitions. [2019-11-20 02:20:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 02:20:16,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:16,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:16,543 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:16,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:16,547 INFO L82 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2019-11-20 02:20:16,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:16,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050335339] [2019-11-20 02:20:16,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:16,582 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-20 02:20:16,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050335339] [2019-11-20 02:20:16,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:16,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:16,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900471165] [2019-11-20 02:20:16,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:16,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:16,584 INFO L87 Difference]: Start difference. First operand 549 states and 708 transitions. Second operand 3 states. [2019-11-20 02:20:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:16,674 INFO L93 Difference]: Finished difference Result 809 states and 1043 transitions. [2019-11-20 02:20:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:16,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-20 02:20:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:16,678 INFO L225 Difference]: With dead ends: 809 [2019-11-20 02:20:16,679 INFO L226 Difference]: Without dead ends: 610 [2019-11-20 02:20:16,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-20 02:20:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 537. [2019-11-20 02:20:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-20 02:20:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 690 transitions. [2019-11-20 02:20:16,739 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 690 transitions. Word has length 36 [2019-11-20 02:20:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:16,739 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 690 transitions. [2019-11-20 02:20:16,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 690 transitions. [2019-11-20 02:20:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 02:20:16,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:16,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:16,742 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1515814519, now seen corresponding path program 1 times [2019-11-20 02:20:16,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:16,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474475511] [2019-11-20 02:20:16,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:16,780 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-20 02:20:16,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474475511] [2019-11-20 02:20:16,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:16,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:16,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252332735] [2019-11-20 02:20:16,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:16,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:16,782 INFO L87 Difference]: Start difference. First operand 537 states and 690 transitions. Second operand 5 states. [2019-11-20 02:20:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:16,898 INFO L93 Difference]: Finished difference Result 553 states and 706 transitions. [2019-11-20 02:20:16,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:20:16,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-20 02:20:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:16,902 INFO L225 Difference]: With dead ends: 553 [2019-11-20 02:20:16,902 INFO L226 Difference]: Without dead ends: 536 [2019-11-20 02:20:16,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-20 02:20:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-11-20 02:20:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-20 02:20:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 688 transitions. [2019-11-20 02:20:16,960 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 688 transitions. Word has length 37 [2019-11-20 02:20:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:16,960 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 688 transitions. [2019-11-20 02:20:16,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 688 transitions. [2019-11-20 02:20:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 02:20:16,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:16,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:16,962 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash -604803074, now seen corresponding path program 1 times [2019-11-20 02:20:16,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:16,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173222840] [2019-11-20 02:20:16,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:17,011 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-20 02:20:17,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173222840] [2019-11-20 02:20:17,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:17,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:20:17,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750998779] [2019-11-20 02:20:17,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:20:17,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:17,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:20:17,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:20:17,013 INFO L87 Difference]: Start difference. First operand 536 states and 688 transitions. Second operand 6 states. [2019-11-20 02:20:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:17,295 INFO L93 Difference]: Finished difference Result 564 states and 714 transitions. [2019-11-20 02:20:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:20:17,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-20 02:20:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:17,298 INFO L225 Difference]: With dead ends: 564 [2019-11-20 02:20:17,298 INFO L226 Difference]: Without dead ends: 530 [2019-11-20 02:20:17,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:20:17,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-20 02:20:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 520. [2019-11-20 02:20:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-11-20 02:20:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 668 transitions. [2019-11-20 02:20:17,340 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 668 transitions. Word has length 37 [2019-11-20 02:20:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:17,340 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 668 transitions. [2019-11-20 02:20:17,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:20:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 668 transitions. [2019-11-20 02:20:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 02:20:17,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:17,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:17,343 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2019-11-20 02:20:17,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:17,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036262194] [2019-11-20 02:20:17,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:17,488 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-20 02:20:17,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036262194] [2019-11-20 02:20:17,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:17,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:17,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847179628] [2019-11-20 02:20:17,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:17,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:17,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:17,490 INFO L87 Difference]: Start difference. First operand 520 states and 668 transitions. Second operand 4 states. [2019-11-20 02:20:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:17,668 INFO L93 Difference]: Finished difference Result 709 states and 910 transitions. [2019-11-20 02:20:17,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:17,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-20 02:20:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:17,672 INFO L225 Difference]: With dead ends: 709 [2019-11-20 02:20:17,672 INFO L226 Difference]: Without dead ends: 490 [2019-11-20 02:20:17,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-20 02:20:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 485. [2019-11-20 02:20:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-20 02:20:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 617 transitions. [2019-11-20 02:20:17,782 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 617 transitions. Word has length 37 [2019-11-20 02:20:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:17,783 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 617 transitions. [2019-11-20 02:20:17,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 617 transitions. [2019-11-20 02:20:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 02:20:17,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:17,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:17,785 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2019-11-20 02:20:17,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:17,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268792328] [2019-11-20 02:20:17,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:17,823 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-20 02:20:17,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268792328] [2019-11-20 02:20:17,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:17,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:17,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87242950] [2019-11-20 02:20:17,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:17,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:17,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:17,825 INFO L87 Difference]: Start difference. First operand 485 states and 617 transitions. Second operand 4 states. [2019-11-20 02:20:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:18,043 INFO L93 Difference]: Finished difference Result 666 states and 850 transitions. [2019-11-20 02:20:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:18,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-20 02:20:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:18,052 INFO L225 Difference]: With dead ends: 666 [2019-11-20 02:20:18,057 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 02:20:18,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 02:20:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-11-20 02:20:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-11-20 02:20:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 608 transitions. [2019-11-20 02:20:18,128 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 608 transitions. Word has length 38 [2019-11-20 02:20:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:18,128 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 608 transitions. [2019-11-20 02:20:18,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 608 transitions. [2019-11-20 02:20:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 02:20:18,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:18,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:18,132 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:18,132 INFO L82 PathProgramCache]: Analyzing trace with hash -147578755, now seen corresponding path program 1 times [2019-11-20 02:20:18,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:18,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232607102] [2019-11-20 02:20:18,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:18,167 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-20 02:20:18,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232607102] [2019-11-20 02:20:18,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:18,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:18,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334469851] [2019-11-20 02:20:18,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:18,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:18,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:18,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:18,168 INFO L87 Difference]: Start difference. First operand 482 states and 608 transitions. Second operand 3 states. [2019-11-20 02:20:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:18,374 INFO L93 Difference]: Finished difference Result 843 states and 1061 transitions. [2019-11-20 02:20:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:18,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-20 02:20:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:18,388 INFO L225 Difference]: With dead ends: 843 [2019-11-20 02:20:18,389 INFO L226 Difference]: Without dead ends: 662 [2019-11-20 02:20:18,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-20 02:20:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 485. [2019-11-20 02:20:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-20 02:20:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 611 transitions. [2019-11-20 02:20:18,463 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 611 transitions. Word has length 41 [2019-11-20 02:20:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:18,464 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 611 transitions. [2019-11-20 02:20:18,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 611 transitions. [2019-11-20 02:20:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 02:20:18,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:18,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:18,466 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:18,466 INFO L82 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2019-11-20 02:20:18,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:18,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82918127] [2019-11-20 02:20:18,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:18,524 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-20 02:20:18,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82918127] [2019-11-20 02:20:18,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:18,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:18,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071333702] [2019-11-20 02:20:18,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:18,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:18,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:18,526 INFO L87 Difference]: Start difference. First operand 485 states and 611 transitions. Second operand 5 states. [2019-11-20 02:20:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:18,855 INFO L93 Difference]: Finished difference Result 828 states and 1031 transitions. [2019-11-20 02:20:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:20:18,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-20 02:20:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:18,858 INFO L225 Difference]: With dead ends: 828 [2019-11-20 02:20:18,858 INFO L226 Difference]: Without dead ends: 672 [2019-11-20 02:20:18,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-20 02:20:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 485. [2019-11-20 02:20:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-20 02:20:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 607 transitions. [2019-11-20 02:20:18,944 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 607 transitions. Word has length 41 [2019-11-20 02:20:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:18,944 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 607 transitions. [2019-11-20 02:20:18,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 607 transitions. [2019-11-20 02:20:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 02:20:18,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:18,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:18,947 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:18,947 INFO L82 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2019-11-20 02:20:18,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:18,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500210104] [2019-11-20 02:20:18,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:18,980 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-20 02:20:18,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500210104] [2019-11-20 02:20:18,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:18,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:18,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672454534] [2019-11-20 02:20:18,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:18,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:18,981 INFO L87 Difference]: Start difference. First operand 485 states and 607 transitions. Second operand 4 states. [2019-11-20 02:20:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:19,118 INFO L93 Difference]: Finished difference Result 657 states and 807 transitions. [2019-11-20 02:20:19,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:19,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-20 02:20:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:19,120 INFO L225 Difference]: With dead ends: 657 [2019-11-20 02:20:19,120 INFO L226 Difference]: Without dead ends: 580 [2019-11-20 02:20:19,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-20 02:20:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 489. [2019-11-20 02:20:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-11-20 02:20:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 611 transitions. [2019-11-20 02:20:19,218 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 611 transitions. Word has length 42 [2019-11-20 02:20:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:19,219 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 611 transitions. [2019-11-20 02:20:19,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 611 transitions. [2019-11-20 02:20:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 02:20:19,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:19,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:19,221 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2019-11-20 02:20:19,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:19,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81425912] [2019-11-20 02:20:19,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:19,280 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-20 02:20:19,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81425912] [2019-11-20 02:20:19,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:19,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:20:19,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934269716] [2019-11-20 02:20:19,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:20:19,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:20:19,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:19,282 INFO L87 Difference]: Start difference. First operand 489 states and 611 transitions. Second operand 7 states. [2019-11-20 02:20:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:19,552 INFO L93 Difference]: Finished difference Result 635 states and 779 transitions. [2019-11-20 02:20:19,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:20:19,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-20 02:20:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:19,554 INFO L225 Difference]: With dead ends: 635 [2019-11-20 02:20:19,554 INFO L226 Difference]: Without dead ends: 536 [2019-11-20 02:20:19,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:20:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-20 02:20:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 484. [2019-11-20 02:20:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-20 02:20:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 602 transitions. [2019-11-20 02:20:19,661 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 602 transitions. Word has length 42 [2019-11-20 02:20:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:19,661 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 602 transitions. [2019-11-20 02:20:19,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:20:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 602 transitions. [2019-11-20 02:20:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 02:20:19,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:19,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:19,664 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash -823105571, now seen corresponding path program 1 times [2019-11-20 02:20:19,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:19,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889266386] [2019-11-20 02:20:19,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:19,769 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-20 02:20:19,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889266386] [2019-11-20 02:20:19,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:19,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:20:19,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793503280] [2019-11-20 02:20:19,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:20:19,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:20:19,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:19,770 INFO L87 Difference]: Start difference. First operand 484 states and 602 transitions. Second operand 7 states. [2019-11-20 02:20:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:20,150 INFO L93 Difference]: Finished difference Result 512 states and 628 transitions. [2019-11-20 02:20:20,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:20:20,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-20 02:20:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:20,152 INFO L225 Difference]: With dead ends: 512 [2019-11-20 02:20:20,152 INFO L226 Difference]: Without dead ends: 346 [2019-11-20 02:20:20,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:20:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-20 02:20:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2019-11-20 02:20:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-20 02:20:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 399 transitions. [2019-11-20 02:20:20,213 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 399 transitions. Word has length 42 [2019-11-20 02:20:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:20,216 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 399 transitions. [2019-11-20 02:20:20,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:20:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 399 transitions. [2019-11-20 02:20:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 02:20:20,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:20,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:20,218 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2019-11-20 02:20:20,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:20,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436460474] [2019-11-20 02:20:20,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:20,313 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-20 02:20:20,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436460474] [2019-11-20 02:20:20,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:20,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:20,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028831186] [2019-11-20 02:20:20,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:20,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:20,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:20,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:20,315 INFO L87 Difference]: Start difference. First operand 323 states and 399 transitions. Second operand 5 states. [2019-11-20 02:20:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:20,576 INFO L93 Difference]: Finished difference Result 707 states and 889 transitions. [2019-11-20 02:20:20,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:20:20,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-20 02:20:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:20,579 INFO L225 Difference]: With dead ends: 707 [2019-11-20 02:20:20,579 INFO L226 Difference]: Without dead ends: 577 [2019-11-20 02:20:20,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:20:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-20 02:20:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 323. [2019-11-20 02:20:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-20 02:20:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 398 transitions. [2019-11-20 02:20:20,629 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 398 transitions. Word has length 44 [2019-11-20 02:20:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:20,630 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 398 transitions. [2019-11-20 02:20:20,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 398 transitions. [2019-11-20 02:20:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 02:20:20,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:20,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:20,632 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:20,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:20,632 INFO L82 PathProgramCache]: Analyzing trace with hash -702658274, now seen corresponding path program 1 times [2019-11-20 02:20:20,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:20,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084360728] [2019-11-20 02:20:20,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:20,680 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-20 02:20:20,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084360728] [2019-11-20 02:20:20,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:20,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:20,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825889848] [2019-11-20 02:20:20,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:20,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:20,681 INFO L87 Difference]: Start difference. First operand 323 states and 398 transitions. Second operand 4 states. [2019-11-20 02:20:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:20,754 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2019-11-20 02:20:20,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:20,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-20 02:20:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:20,756 INFO L225 Difference]: With dead ends: 355 [2019-11-20 02:20:20,756 INFO L226 Difference]: Without dead ends: 322 [2019-11-20 02:20:20,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-20 02:20:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-11-20 02:20:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-20 02:20:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 396 transitions. [2019-11-20 02:20:20,805 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 396 transitions. Word has length 47 [2019-11-20 02:20:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:20,805 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 396 transitions. [2019-11-20 02:20:20,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 396 transitions. [2019-11-20 02:20:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 02:20:20,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:20,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:20,808 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:20,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1085716830, now seen corresponding path program 1 times [2019-11-20 02:20:20,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:20,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419021192] [2019-11-20 02:20:20,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:20,875 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-20 02:20:20,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419021192] [2019-11-20 02:20:20,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:20,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:20:20,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816338015] [2019-11-20 02:20:20,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:20:20,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:20:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:20,876 INFO L87 Difference]: Start difference. First operand 322 states and 396 transitions. Second operand 7 states. [2019-11-20 02:20:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:20,993 INFO L93 Difference]: Finished difference Result 327 states and 400 transitions. [2019-11-20 02:20:20,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:20:20,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-20 02:20:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:20,995 INFO L225 Difference]: With dead ends: 327 [2019-11-20 02:20:20,995 INFO L226 Difference]: Without dead ends: 261 [2019-11-20 02:20:20,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:20:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-20 02:20:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-11-20 02:20:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-20 02:20:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 321 transitions. [2019-11-20 02:20:21,040 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 321 transitions. Word has length 47 [2019-11-20 02:20:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:21,041 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 321 transitions. [2019-11-20 02:20:21,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:20:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 321 transitions. [2019-11-20 02:20:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 02:20:21,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:21,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:21,043 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2019-11-20 02:20:21,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:21,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896569010] [2019-11-20 02:20:21,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:20:21,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896569010] [2019-11-20 02:20:21,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:21,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:20:21,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867497766] [2019-11-20 02:20:21,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:20:21,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:20:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:21,073 INFO L87 Difference]: Start difference. First operand 261 states and 321 transitions. Second operand 3 states. [2019-11-20 02:20:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:21,177 INFO L93 Difference]: Finished difference Result 394 states and 491 transitions. [2019-11-20 02:20:21,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:20:21,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-20 02:20:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:21,179 INFO L225 Difference]: With dead ends: 394 [2019-11-20 02:20:21,179 INFO L226 Difference]: Without dead ends: 223 [2019-11-20 02:20:21,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:20:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-20 02:20:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-11-20 02:20:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-20 02:20:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2019-11-20 02:20:21,215 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 48 [2019-11-20 02:20:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:21,216 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2019-11-20 02:20:21,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:20:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2019-11-20 02:20:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 02:20:21,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:21,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:21,217 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -624507704, now seen corresponding path program 1 times [2019-11-20 02:20:21,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:21,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947012188] [2019-11-20 02:20:21,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:21,282 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-20 02:20:21,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947012188] [2019-11-20 02:20:21,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:21,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:20:21,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003179843] [2019-11-20 02:20:21,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:20:21,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:20:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:21,283 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 7 states. [2019-11-20 02:20:21,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:21,489 INFO L93 Difference]: Finished difference Result 313 states and 380 transitions. [2019-11-20 02:20:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:20:21,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-20 02:20:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:21,490 INFO L225 Difference]: With dead ends: 313 [2019-11-20 02:20:21,491 INFO L226 Difference]: Without dead ends: 295 [2019-11-20 02:20:21,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:20:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-20 02:20:21,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 223. [2019-11-20 02:20:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-20 02:20:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 271 transitions. [2019-11-20 02:20:21,525 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 271 transitions. Word has length 54 [2019-11-20 02:20:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:21,525 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 271 transitions. [2019-11-20 02:20:21,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:20:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 271 transitions. [2019-11-20 02:20:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 02:20:21,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:21,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:21,527 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2071877734, now seen corresponding path program 1 times [2019-11-20 02:20:21,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:21,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831953092] [2019-11-20 02:20:21,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:21,600 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-20 02:20:21,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831953092] [2019-11-20 02:20:21,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:21,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 02:20:21,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872148274] [2019-11-20 02:20:21,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:20:21,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:21,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:20:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:20:21,602 INFO L87 Difference]: Start difference. First operand 223 states and 271 transitions. Second operand 8 states. [2019-11-20 02:20:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:21,779 INFO L93 Difference]: Finished difference Result 289 states and 351 transitions. [2019-11-20 02:20:21,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:20:21,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-11-20 02:20:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:21,782 INFO L225 Difference]: With dead ends: 289 [2019-11-20 02:20:21,782 INFO L226 Difference]: Without dead ends: 223 [2019-11-20 02:20:21,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:20:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-20 02:20:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-11-20 02:20:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-20 02:20:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 270 transitions. [2019-11-20 02:20:21,825 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 270 transitions. Word has length 59 [2019-11-20 02:20:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:21,825 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 270 transitions. [2019-11-20 02:20:21,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:20:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 270 transitions. [2019-11-20 02:20:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 02:20:21,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:21,828 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:21,828 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash -121361867, now seen corresponding path program 1 times [2019-11-20 02:20:21,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:21,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165384693] [2019-11-20 02:20:21,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:21,876 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-20 02:20:21,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165384693] [2019-11-20 02:20:21,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:21,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:21,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807701892] [2019-11-20 02:20:21,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:21,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:21,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:21,877 INFO L87 Difference]: Start difference. First operand 223 states and 270 transitions. Second operand 5 states. [2019-11-20 02:20:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:22,009 INFO L93 Difference]: Finished difference Result 378 states and 455 transitions. [2019-11-20 02:20:22,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:20:22,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-20 02:20:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:22,011 INFO L225 Difference]: With dead ends: 378 [2019-11-20 02:20:22,011 INFO L226 Difference]: Without dead ends: 327 [2019-11-20 02:20:22,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-20 02:20:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-20 02:20:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 190. [2019-11-20 02:20:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-20 02:20:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2019-11-20 02:20:22,039 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 59 [2019-11-20 02:20:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:22,039 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2019-11-20 02:20:22,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2019-11-20 02:20:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 02:20:22,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:22,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:22,041 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:22,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1291714983, now seen corresponding path program 1 times [2019-11-20 02:20:22,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:22,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722506942] [2019-11-20 02:20:22,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:22,090 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-20 02:20:22,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722506942] [2019-11-20 02:20:22,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:22,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:22,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669692377] [2019-11-20 02:20:22,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:22,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:22,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:22,091 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand 5 states. [2019-11-20 02:20:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:22,212 INFO L93 Difference]: Finished difference Result 278 states and 328 transitions. [2019-11-20 02:20:22,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:20:22,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-20 02:20:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:22,215 INFO L225 Difference]: With dead ends: 278 [2019-11-20 02:20:22,215 INFO L226 Difference]: Without dead ends: 244 [2019-11-20 02:20:22,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-20 02:20:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 179. [2019-11-20 02:20:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-20 02:20:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 209 transitions. [2019-11-20 02:20:22,244 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 209 transitions. Word has length 60 [2019-11-20 02:20:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:22,244 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 209 transitions. [2019-11-20 02:20:22,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2019-11-20 02:20:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 02:20:22,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:22,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:22,248 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:22,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1525268266, now seen corresponding path program 1 times [2019-11-20 02:20:22,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:22,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823290059] [2019-11-20 02:20:22,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20: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-20 02:20:22,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823290059] [2019-11-20 02:20:22,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:22,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:20:22,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150683552] [2019-11-20 02:20:22,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:20:22,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:22,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:20:22,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:20:22,311 INFO L87 Difference]: Start difference. First operand 179 states and 209 transitions. Second operand 6 states. [2019-11-20 02:20:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:22,444 INFO L93 Difference]: Finished difference Result 324 states and 382 transitions. [2019-11-20 02:20:22,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:20:22,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-20 02:20:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:22,445 INFO L225 Difference]: With dead ends: 324 [2019-11-20 02:20:22,445 INFO L226 Difference]: Without dead ends: 269 [2019-11-20 02:20:22,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:20:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-20 02:20:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 146. [2019-11-20 02:20:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:20:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 172 transitions. [2019-11-20 02:20:22,472 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 172 transitions. Word has length 61 [2019-11-20 02:20:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:22,472 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 172 transitions. [2019-11-20 02:20:22,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:20:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 172 transitions. [2019-11-20 02:20:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 02:20:22,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:22,473 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:22,474 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1218638889, now seen corresponding path program 1 times [2019-11-20 02:20:22,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:22,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090357206] [2019-11-20 02:20:22,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:22,543 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-20 02:20:22,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090357206] [2019-11-20 02:20:22,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:22,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:20:22,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586407354] [2019-11-20 02:20:22,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:20:22,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:22,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:20:22,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:22,546 INFO L87 Difference]: Start difference. First operand 146 states and 172 transitions. Second operand 7 states. [2019-11-20 02:20:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:22,815 INFO L93 Difference]: Finished difference Result 376 states and 447 transitions. [2019-11-20 02:20:22,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 02:20:22,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-20 02:20:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:22,817 INFO L225 Difference]: With dead ends: 376 [2019-11-20 02:20:22,817 INFO L226 Difference]: Without dead ends: 356 [2019-11-20 02:20:22,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-20 02:20:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-20 02:20:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 162. [2019-11-20 02:20:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-20 02:20:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2019-11-20 02:20:22,895 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 74 [2019-11-20 02:20:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:22,896 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2019-11-20 02:20:22,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:20:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2019-11-20 02:20:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 02:20:22,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:22,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:22,898 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1172490426, now seen corresponding path program 1 times [2019-11-20 02:20:22,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:22,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421012192] [2019-11-20 02:20:22,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:23,044 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-20 02:20:23,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421012192] [2019-11-20 02:20:23,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:23,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-20 02:20:23,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352086714] [2019-11-20 02:20:23,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 02:20:23,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 02:20:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:20:23,046 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand 11 states. [2019-11-20 02:20:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:23,595 INFO L93 Difference]: Finished difference Result 358 states and 429 transitions. [2019-11-20 02:20:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 02:20:23,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-11-20 02:20:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:23,596 INFO L225 Difference]: With dead ends: 358 [2019-11-20 02:20:23,596 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 02:20:23,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-11-20 02:20:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 02:20:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 162. [2019-11-20 02:20:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-20 02:20:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-11-20 02:20:23,625 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 75 [2019-11-20 02:20:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:23,626 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-11-20 02:20:23,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 02:20:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-11-20 02:20:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 02:20:23,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:23,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:23,628 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash 645027120, now seen corresponding path program 1 times [2019-11-20 02:20:23,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:23,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690409112] [2019-11-20 02:20:23,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:23,681 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-20 02:20:23,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690409112] [2019-11-20 02:20:23,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:23,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:23,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797470162] [2019-11-20 02:20:23,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:23,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:23,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:23,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:23,684 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 4 states. [2019-11-20 02:20:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:23,757 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2019-11-20 02:20:23,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:23,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-20 02:20:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:23,758 INFO L225 Difference]: With dead ends: 215 [2019-11-20 02:20:23,758 INFO L226 Difference]: Without dead ends: 195 [2019-11-20 02:20:23,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-20 02:20:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 162. [2019-11-20 02:20:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-20 02:20:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-11-20 02:20:23,792 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 79 [2019-11-20 02:20:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:23,792 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-11-20 02:20:23,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-11-20 02:20:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:20:23,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:23,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:23,794 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:23,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1091776138, now seen corresponding path program 1 times [2019-11-20 02:20:23,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:23,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952831281] [2019-11-20 02:20:23,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:23,851 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-20 02:20:23,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952831281] [2019-11-20 02:20:23,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:23,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:20:23,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022338021] [2019-11-20 02:20:23,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:20:23,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:20:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:20:23,854 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 6 states. [2019-11-20 02:20:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:23,997 INFO L93 Difference]: Finished difference Result 277 states and 333 transitions. [2019-11-20 02:20:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:20:23,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-11-20 02:20:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:23,999 INFO L225 Difference]: With dead ends: 277 [2019-11-20 02:20:23,999 INFO L226 Difference]: Without dead ends: 212 [2019-11-20 02:20:23,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:20:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-20 02:20:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 152. [2019-11-20 02:20:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-20 02:20:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2019-11-20 02:20:24,033 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 80 [2019-11-20 02:20:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:24,034 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2019-11-20 02:20:24,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:20:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2019-11-20 02:20:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:20:24,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:24,036 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:24,036 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash -839306980, now seen corresponding path program 1 times [2019-11-20 02:20:24,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:24,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241942184] [2019-11-20 02:20:24,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:24,199 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-20 02:20:24,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241942184] [2019-11-20 02:20:24,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:24,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 02:20:24,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016049106] [2019-11-20 02:20:24,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:20:24,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:24,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:20:24,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:20:24,201 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand 10 states. [2019-11-20 02:20:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:24,587 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2019-11-20 02:20:24,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 02:20:24,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-11-20 02:20:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:24,588 INFO L225 Difference]: With dead ends: 381 [2019-11-20 02:20:24,588 INFO L226 Difference]: Without dead ends: 281 [2019-11-20 02:20:24,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-11-20 02:20:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-20 02:20:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 219. [2019-11-20 02:20:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-20 02:20:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2019-11-20 02:20:24,633 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 81 [2019-11-20 02:20:24,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:24,633 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2019-11-20 02:20:24,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:20:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2019-11-20 02:20:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:20:24,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:24,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:24,635 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:24,636 INFO L82 PathProgramCache]: Analyzing trace with hash -273318, now seen corresponding path program 1 times [2019-11-20 02:20:24,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:24,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695550664] [2019-11-20 02:20:24,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:24,709 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-20 02:20:24,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695550664] [2019-11-20 02:20:24,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:24,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:20:24,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409999541] [2019-11-20 02:20:24,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:20:24,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:24,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:20:24,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:20:24,712 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand 6 states. [2019-11-20 02:20:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:24,968 INFO L93 Difference]: Finished difference Result 400 states and 466 transitions. [2019-11-20 02:20:24,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:20:24,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-20 02:20:24,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:24,970 INFO L225 Difference]: With dead ends: 400 [2019-11-20 02:20:24,970 INFO L226 Difference]: Without dead ends: 380 [2019-11-20 02:20:24,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:20:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-20 02:20:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2019-11-20 02:20:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-20 02:20:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2019-11-20 02:20:25,017 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 81 [2019-11-20 02:20:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:25,019 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2019-11-20 02:20:25,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:20:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2019-11-20 02:20:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:20:25,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:25,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:25,022 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash 288160049, now seen corresponding path program 1 times [2019-11-20 02:20:25,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:25,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43969955] [2019-11-20 02:20:25,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:25,094 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-20 02:20:25,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43969955] [2019-11-20 02:20:25,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:25,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:20:25,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846535952] [2019-11-20 02:20:25,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:20:25,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:20:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:25,097 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand 5 states. [2019-11-20 02:20:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:25,229 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2019-11-20 02:20:25,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:20:25,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-11-20 02:20:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:25,231 INFO L225 Difference]: With dead ends: 314 [2019-11-20 02:20:25,231 INFO L226 Difference]: Without dead ends: 274 [2019-11-20 02:20:25,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:20:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-20 02:20:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 214. [2019-11-20 02:20:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-20 02:20:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 244 transitions. [2019-11-20 02:20:25,276 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 244 transitions. Word has length 84 [2019-11-20 02:20:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:25,277 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 244 transitions. [2019-11-20 02:20:25,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:20:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 244 transitions. [2019-11-20 02:20:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 02:20:25,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:25,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:25,279 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:25,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1873856217, now seen corresponding path program 1 times [2019-11-20 02:20:25,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:25,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256620909] [2019-11-20 02:20:25,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:25,334 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-20 02:20:25,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256620909] [2019-11-20 02:20:25,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:25,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:20:25,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875633645] [2019-11-20 02:20:25,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:20:25,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:20:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:20:25,336 INFO L87 Difference]: Start difference. First operand 214 states and 244 transitions. Second operand 4 states. [2019-11-20 02:20:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:25,401 INFO L93 Difference]: Finished difference Result 262 states and 294 transitions. [2019-11-20 02:20:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:20:25,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 02:20:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:25,403 INFO L225 Difference]: With dead ends: 262 [2019-11-20 02:20:25,403 INFO L226 Difference]: Without dead ends: 241 [2019-11-20 02:20:25,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:20:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-20 02:20:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2019-11-20 02:20:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-20 02:20:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 246 transitions. [2019-11-20 02:20:25,442 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 246 transitions. Word has length 86 [2019-11-20 02:20:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:25,442 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 246 transitions. [2019-11-20 02:20:25,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:20:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2019-11-20 02:20:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 02:20:25,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:25,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:25,444 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash 481659239, now seen corresponding path program 1 times [2019-11-20 02:20:25,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:25,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358255998] [2019-11-20 02:20:25,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:25,542 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-20 02:20:25,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358255998] [2019-11-20 02:20:25,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:25,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 02:20:25,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642581498] [2019-11-20 02:20:25,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 02:20:25,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:25,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:20:25,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:20:25,544 INFO L87 Difference]: Start difference. First operand 216 states and 246 transitions. Second operand 9 states. [2019-11-20 02:20:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:26,033 INFO L93 Difference]: Finished difference Result 426 states and 492 transitions. [2019-11-20 02:20:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 02:20:26,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-11-20 02:20:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:26,034 INFO L225 Difference]: With dead ends: 426 [2019-11-20 02:20:26,034 INFO L226 Difference]: Without dead ends: 288 [2019-11-20 02:20:26,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-11-20 02:20:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-20 02:20:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 213. [2019-11-20 02:20:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-20 02:20:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 239 transitions. [2019-11-20 02:20:26,069 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 239 transitions. Word has length 86 [2019-11-20 02:20:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:26,069 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 239 transitions. [2019-11-20 02:20:26,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 02:20:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2019-11-20 02:20:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 02:20:26,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:26,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:26,071 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1016683280, now seen corresponding path program 1 times [2019-11-20 02:20:26,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:26,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179896214] [2019-11-20 02:20:26,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:26,221 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-20 02:20:26,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179896214] [2019-11-20 02:20:26,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:26,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 02:20:26,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692137171] [2019-11-20 02:20:26,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 02:20:26,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:26,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 02:20:26,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:20:26,223 INFO L87 Difference]: Start difference. First operand 213 states and 239 transitions. Second operand 12 states. [2019-11-20 02:20:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:26,732 INFO L93 Difference]: Finished difference Result 392 states and 442 transitions. [2019-11-20 02:20:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 02:20:26,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-11-20 02:20:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:26,734 INFO L225 Difference]: With dead ends: 392 [2019-11-20 02:20:26,734 INFO L226 Difference]: Without dead ends: 357 [2019-11-20 02:20:26,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2019-11-20 02:20:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-20 02:20:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 220. [2019-11-20 02:20:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-20 02:20:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2019-11-20 02:20:26,801 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 87 [2019-11-20 02:20:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:26,801 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2019-11-20 02:20:26,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 02:20:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2019-11-20 02:20:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 02:20:26,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:26,803 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:26,803 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:26,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:26,804 INFO L82 PathProgramCache]: Analyzing trace with hash 895193670, now seen corresponding path program 1 times [2019-11-20 02:20:26,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:26,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422339692] [2019-11-20 02:20:26,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:26,899 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-20 02:20:26,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422339692] [2019-11-20 02:20:26,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:26,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 02:20:26,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212076327] [2019-11-20 02:20:26,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 02:20:26,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:26,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:20:26,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:20:26,901 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 9 states. [2019-11-20 02:20:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:27,325 INFO L93 Difference]: Finished difference Result 321 states and 364 transitions. [2019-11-20 02:20:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 02:20:27,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-11-20 02:20:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:27,326 INFO L225 Difference]: With dead ends: 321 [2019-11-20 02:20:27,326 INFO L226 Difference]: Without dead ends: 136 [2019-11-20 02:20:27,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-11-20 02:20:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-20 02:20:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2019-11-20 02:20:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 02:20:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2019-11-20 02:20:27,359 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 91 [2019-11-20 02:20:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:27,360 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2019-11-20 02:20:27,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 02:20:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2019-11-20 02:20:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 02:20:27,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:20:27,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:20:27,362 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:20:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:20:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash 116218975, now seen corresponding path program 1 times [2019-11-20 02:20:27,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:20:27,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779563727] [2019-11-20 02:20:27,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:20:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:20:27,517 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-20 02:20:27,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779563727] [2019-11-20 02:20:27,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:20:27,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 02:20:27,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753340817] [2019-11-20 02:20:27,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 02:20:27,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:20:27,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 02:20:27,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:20:27,522 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand 12 states. [2019-11-20 02:20:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:20:27,892 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2019-11-20 02:20:27,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 02:20:27,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-11-20 02:20:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:20:27,893 INFO L225 Difference]: With dead ends: 166 [2019-11-20 02:20:27,893 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 02:20:27,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-11-20 02:20:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 02:20:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 02:20:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 02:20:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 02:20:27,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-11-20 02:20:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:20:27,895 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:20:27,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 02:20:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 02:20:27,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 02:20:27,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 02:20:28,068 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 123 [2019-11-20 02:20:28,313 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 155 [2019-11-20 02:20:28,586 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 157 [2019-11-20 02:20:28,978 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-20 02:20:29,396 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 198 [2019-11-20 02:20:29,835 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 155 [2019-11-20 02:20:30,095 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 191 [2019-11-20 02:20:30,542 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 190 [2019-11-20 02:20:30,880 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 180 [2019-11-20 02:20:31,058 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-20 02:20:32,181 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 469 DAG size of output: 442 [2019-11-20 02:20:33,310 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 472 DAG size of output: 403 [2019-11-20 02:20:34,288 WARN L191 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 470 DAG size of output: 446 [2019-11-20 02:20:34,461 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-20 02:20:36,263 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 485 DAG size of output: 451 [2019-11-20 02:20:36,695 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 268 [2019-11-20 02:20:37,327 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 183 [2019-11-20 02:20:37,533 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 158 [2019-11-20 02:20:37,876 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2019-11-20 02:20:38,065 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-11-20 02:20:38,173 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-20 02:20:38,438 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 176 [2019-11-20 02:20:38,739 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 275 [2019-11-20 02:20:38,895 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2019-11-20 02:20:39,045 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-11-20 02:20:39,269 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 185 [2019-11-20 02:20:39,691 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 208 [2019-11-20 02:20:40,192 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-20 02:20:40,824 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-20 02:20:41,554 WARN L191 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-20 02:20:41,677 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-20 02:20:41,961 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-11-20 02:20:42,097 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-20 02:20:42,521 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-11-20 02:20:42,663 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-20 02:20:43,252 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 68 [2019-11-20 02:20:43,846 WARN L191 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-11-20 02:20:44,055 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-20 02:20:44,893 WARN L191 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 69 [2019-11-20 02:20:45,123 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-20 02:20:45,445 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-11-20 02:20:45,769 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-20 02:20:46,105 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-20 02:20:46,358 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-20 02:20:46,603 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-20 02:20:47,083 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-20 02:20:47,838 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-20 02:20:47,983 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-20 02:20:49,129 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 188 DAG size of output: 92 [2019-11-20 02:20:49,237 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-20 02:20:49,430 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-20 02:20:49,563 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-20 02:20:50,461 WARN L191 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-20 02:20:51,492 WARN L191 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 66 [2019-11-20 02:20:51,804 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-11-20 02:20:52,456 WARN L191 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-11-20 02:20:52,665 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-20 02:20:55,950 WARN L191 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 438 DAG size of output: 148 [2019-11-20 02:20:56,196 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-11-20 02:20:56,397 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-20 02:20:59,518 WARN L191 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 393 DAG size of output: 143 [2019-11-20 02:21:03,976 WARN L191 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 440 DAG size of output: 148 [2019-11-20 02:21:04,559 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-11-20 02:21:04,773 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-20 02:21:05,013 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-20 02:21:05,179 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-20 02:21:05,282 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-20 02:21:05,384 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-20 02:21:05,522 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-20 02:21:09,976 WARN L191 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 450 DAG size of output: 148 [2019-11-20 02:21:10,333 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 02:21:12,084 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 257 DAG size of output: 102 [2019-11-20 02:21:12,743 WARN L191 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-11-20 02:21:13,389 WARN L191 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 74 [2019-11-20 02:21:13,724 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-11-20 02:21:13,924 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-11-20 02:21:14,226 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-20 02:21:14,539 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-11-20 02:21:14,813 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-20 02:21:15,026 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-20 02:21:15,226 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-20 02:21:15,458 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-11-20 02:21:15,686 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-11-20 02:21:15,899 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-20 02:21:16,161 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-11-20 02:21:16,793 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-11-20 02:21:17,589 WARN L191 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 91 [2019-11-20 02:21:17,741 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-20 02:21:18,055 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-11-20 02:21:18,297 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-20 02:21:18,884 WARN L191 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2019-11-20 02:21:19,050 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-11-20 02:21:19,196 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-20 02:21:19,333 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-20 02:21:20,166 WARN L191 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 69 [2019-11-20 02:21:21,025 WARN L191 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 61 [2019-11-20 02:21:21,609 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-11-20 02:21:22,152 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-11-20 02:21:22,262 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-11-20 02:21:22,496 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-20 02:21:22,746 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-20 02:21:23,568 WARN L191 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 81 [2019-11-20 02:21:25,764 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 265 DAG size of output: 100 [2019-11-20 02:21:26,558 WARN L191 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 69 [2019-11-20 02:21:27,465 WARN L191 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 61 [2019-11-20 02:21:27,759 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-20 02:21:28,117 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2019-11-20 02:21:28,438 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-11-20 02:21:29,119 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 77 [2019-11-20 02:21:29,300 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-11-20 02:21:29,418 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-11-20 02:21:30,224 WARN L191 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-11-20 02:21:30,907 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-20 02:21:31,032 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-20 02:21:31,278 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-20 02:21:32,082 WARN L191 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2019-11-20 02:21:32,345 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-20 02:21:33,348 WARN L191 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 82 [2019-11-20 02:21:33,722 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-20 02:21:33,965 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-20 02:21:34,179 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-11-20 02:21:34,349 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-11-20 02:21:34,569 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-20 02:21:34,780 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-20 02:21:34,951 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-20 02:21:35,253 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-11-20 02:21:35,682 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-20 02:21:36,088 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-11-20 02:21:36,785 WARN L191 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-20 02:21:36,910 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-20 02:21:37,247 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-20 02:21:37,964 WARN L191 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-11-20 02:21:38,226 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-20 02:21:38,243 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1426) no Hoare annotation was computed. [2019-11-20 02:21:38,243 INFO L444 ceAbstractionStarter]: For program point L234-1(lines 227 415) no Hoare annotation was computed. [2019-11-20 02:21:38,244 INFO L440 ceAbstractionStarter]: At program point L895(lines 894 904) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,244 INFO L444 ceAbstractionStarter]: For program point L1295(lines 1295 1309) no Hoare annotation was computed. [2019-11-20 02:21:38,244 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-11-20 02:21:38,244 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 640) no Hoare annotation was computed. [2019-11-20 02:21:38,244 INFO L444 ceAbstractionStarter]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2019-11-20 02:21:38,245 INFO L440 ceAbstractionStarter]: At program point L1560(lines 1181 1562) the Hoare annotation is: (let ((.cse20 (<= (+ ~DC~0 5) ~IPC~0)) (.cse17 (= 0 ~pended~0)) (.cse15 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (let ((.cse0 (= 1 ~pended~0)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse3 (+ ~s~0 5)) (.cse11 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse18 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse16 (= ~s~0 ~DC~0)) (.cse10 (= ~s~0 ~IPC~0)) (.cse5 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse6 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse7 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (and .cse20 .cse17 .cse15 .cse1 .cse19 .cse2)) (.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 (= ~NP~0 ~s~0) (<= .cse3 ~MPR3~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse8 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse9) (and .cse0 .cse15 .cse1 .cse2 .cse16) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse17 .cse1 .cse2 .cse16) (and .cse11 .cse12 .cse4 .cse13 .cse14 .cse8 .cse9) (and .cse18 .cse17 .cse1 (<= .cse3 ~IPC~0) .cse2 .cse16 (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse15 .cse19 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse10 .cse11 .cse12 (<= (+ ~DC~0 7) ~s~0) .cse13 .cse14 .cse8 .cse9) (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse20 .cse18 .cse17 .cse15 .cse1 .cse19 .cse2 .cse16 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse10 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2019-11-20 02:21:38,245 INFO L444 ceAbstractionStarter]: For program point L1296(lines 1296 1302) no Hoare annotation was computed. [2019-11-20 02:21:38,245 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-11-20 02:21:38,245 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-11-20 02:21:38,245 INFO L440 ceAbstractionStarter]: At program point L1034(lines 964 1036) the Hoare annotation is: (let ((.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse11 (= ~s~0 ~IPC~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse12 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse13 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse12 .cse13 .cse10) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse8 .cse5 .cse12 .cse13 .cse10))) [2019-11-20 02:21:38,245 INFO L440 ceAbstractionStarter]: At program point L1034-1(lines 964 1036) the Hoare annotation is: (let ((.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse11 (= ~s~0 ~IPC~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse12 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse13 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse12 .cse13 .cse10) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse8 .cse5 .cse12 .cse13 .cse10))) [2019-11-20 02:21:38,246 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 964 1036) the Hoare annotation is: (let ((.cse24 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse25 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse2 (<= .cse25 0)) (.cse13 (<= (+ .cse24 1) 0)) (.cse14 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse25)) (.cse18 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse8 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= 1 ~compRegistered~0)) (.cse7 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse24) 3221225494))) (.cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse20 (= ~setEventCalled~0 1))) (let ((.cse12 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse22 (= ~myStatus~0 0)) (.cse21 (and .cse2 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 (= ~MPR3~0 ~s~0) .cse18 (and .cse0 .cse1 (<= (+ ~NP~0 5) ~MPR3~0) .cse8 .cse11 .cse9 .cse5) (= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse7 .cse19 .cse20)) (.cse4 (= ~NP~0 ~s~0)) (.cse6 (<= (+ ~myStatus~0 1073741637) 0)) (.cse10 (<= (+ ~s~0 5) ~MPR3~0)) (.cse23 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse6) (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (= ~myStatus~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse9 .cse10 .cse11 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse22 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))))) [2019-11-20 02:21:38,246 INFO L440 ceAbstractionStarter]: At program point L1034-3(lines 964 1036) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse2 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse8 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 1 ~compRegistered~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse20)) (.cse10 (<= .cse20 0)) (.cse11 (<= (+ .cse19 1) 0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494))) (.cse16 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse17 (= ~setEventCalled~0 1)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse18 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse1 (and .cse2 (and (and (and .cse8 .cse9 .cse7 (and .cse5 .cse4 (<= (+ ~s~0 5) ~MPR3~0) (= ~NP~0 ~s~0))) .cse3) .cse13 .cse14 .cse10 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) .cse11 .cse15 .cse16 .cse12 .cse17) .cse6 (not .cse18))) (.cse0 (and .cse2 (and (and .cse3 (and (and (and .cse4 .cse5 (<= (+ ~NP~0 5) ~MPR3~0) .cse6) .cse7) .cse8 .cse9)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 (= ~MPR3~0 ~s~0) (= 259 |ULTIMATE.start_IofCallDriver_#res|)))) (or (and (= ~myStatus~0 0) .cse0) (and .cse1 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (and .cse1 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-11-20 02:21:38,246 INFO L440 ceAbstractionStarter]: At program point L1034-4(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse1 .cse4 .cse7 .cse8))) [2019-11-20 02:21:38,246 INFO L440 ceAbstractionStarter]: At program point L1034-5(lines 964 1036) the Hoare annotation is: (let ((.cse6 (= ~SKIP2~0 ~s~0)) (.cse0 (= 1 ~pended~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse11 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse13 (= ~s~0 ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) (and .cse3 .cse4 .cse1 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse3 .cse9 .cse1 .cse10 .cse6 .cse2 .cse11 .cse12) (and .cse13 .cse0 .cse3 .cse9 .cse1 .cse10 .cse2) (and .cse11 .cse12 (and (and .cse13 .cse4 .cse9 .cse1 .cse5 .cse10 (<= (+ ~DC~0 7) ~s~0) .cse2 .cse7) .cse8)))) [2019-11-20 02:21:38,246 INFO L440 ceAbstractionStarter]: At program point L1034-6(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9))) [2019-11-20 02:21:38,247 INFO L440 ceAbstractionStarter]: At program point L1034-7(lines 964 1036) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (<= .cse18 0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (= 1 ~compRegistered~0)) (.cse1 (= 0 ~pended~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse11 (<= 0 .cse18)) (.cse13 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse15 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse7 .cse8 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse9 .cse10 .cse11 (= ~NP~0 ~s~0) .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~myStatus~0 0) .cse4 .cse3 (and .cse9 (and .cse2 .cse5 .cse12 (and .cse1 .cse0 .cse8))) .cse6 .cse7 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse10 .cse11 (= ~MPR3~0 ~s~0) .cse13 (= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse14 .cse15 .cse16)))) [2019-11-20 02:21:38,247 INFO L440 ceAbstractionStarter]: At program point L1034-8(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9))) [2019-11-20 02:21:38,247 INFO L440 ceAbstractionStarter]: At program point L1034-9(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9))) [2019-11-20 02:21:38,247 INFO L440 ceAbstractionStarter]: At program point L1034-10(lines 964 1036) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9))) [2019-11-20 02:21:38,247 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,247 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,247 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1436) no Hoare annotation was computed. [2019-11-20 02:21:38,247 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-11-20 02:21:38,247 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,247 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,248 INFO L440 ceAbstractionStarter]: At program point L642(lines 610 644) the Hoare annotation is: (let ((.cse1 (and (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (let ((.cse4 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse5 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse4) (<= .cse4 0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ .cse5 1) 0) (and (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (= 1 ~compRegistered~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse5) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~NP~0 4) ~MPR1~0)))))) (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse1))) (or (and (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) .cse0 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) (<= (+ ~myStatus~0 1073741637) 0)) (and (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse1) (let ((.cse2 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse3 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0))) (or (and (not (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (and .cse0 (= 0 |ULTIMATE.start_IofCallDriver_#res|) .cse2 .cse3)) (and (= ~myStatus~0 0) .cse0 .cse2 .cse3)))))) [2019-11-20 02:21:38,248 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,248 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 515) no Hoare annotation was computed. [2019-11-20 02:21:38,248 INFO L444 ceAbstractionStarter]: For program point L510-2(lines 510 515) no Hoare annotation was computed. [2019-11-20 02:21:38,248 INFO L440 ceAbstractionStarter]: At program point L907(lines 907 928) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,248 INFO L444 ceAbstractionStarter]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 146) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L116-2(lines 108 156) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L1041(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L116-3(lines 116 146) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L1041-2(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L116-5(lines 108 156) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L1041-4(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L1041-6(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,249 INFO L444 ceAbstractionStarter]: For program point L1041-8(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L1041-10(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L1041-12(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L1041-14(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L1041-16(lines 1041 1047) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 783) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L1572(lines 1572 1576) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L119-2(lines 119 121) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L119-3(lines 119 121) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L444 ceAbstractionStarter]: For program point L119-5(lines 119 121) no Hoare annotation was computed. [2019-11-20 02:21:38,250 INFO L440 ceAbstractionStarter]: At program point L1177(lines 1166 1179) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0) (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) [2019-11-20 02:21:38,251 INFO L440 ceAbstractionStarter]: At program point L1177-1(lines 1166 1179) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0) (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) [2019-11-20 02:21:38,251 INFO L444 ceAbstractionStarter]: For program point L914(lines 914 926) no Hoare annotation was computed. [2019-11-20 02:21:38,251 INFO L440 ceAbstractionStarter]: At program point L1575(lines 1563 1579) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,251 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,251 INFO L440 ceAbstractionStarter]: At program point L915(lines 914 926) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,251 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,251 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,251 INFO L440 ceAbstractionStarter]: At program point L917(lines 916 926) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,252 INFO L440 ceAbstractionStarter]: At program point L785(lines 778 833) the Hoare annotation is: (let ((.cse19 (= 0 ~pended~0)) (.cse27 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse21 (= ~s~0 ~DC~0))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse28 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (and .cse19 .cse27 .cse21))) (let ((.cse14 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse31 (and (and .cse2 .cse3) (<= (+ ~s~0 5) ~IPC~0))) (.cse17 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse18 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse11 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse30 (= ~s~0 ~IPC~0)) (.cse5 (and .cse0 .cse19 .cse27 .cse28))) (let ((.cse16 (<= (+ ~DC~0 7) ~s~0)) (.cse15 (and .cse30 .cse5 .cse2)) (.cse13 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse22 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse24 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse23 (and (let ((.cse32 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse33 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (and .cse14 .cse31 .cse17) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse32) (<= .cse32 0) (<= (+ .cse33 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse33) 3221225494)) (<= (+ ~NP~0 4) ~MPR1~0))) .cse18 .cse11)) (.cse8 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse9 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse10 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse4 (not (= ULTIMATE.start_main_~status~1 259))) (.cse29 (and .cse5 .cse2)) (.cse6 (= ~SKIP2~0 ~s~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse25 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse20 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse26 (= 1 ~pended~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0))) (or (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse11) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse19 .cse20 .cse21) (and .cse22 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse23 .cse4 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse24) (and (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse23 (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse7) (and .cse12 .cse25 (and (and (and .cse15 .cse18 .cse11) .cse14 .cse17) .cse16)) (and .cse26 .cse0 .cse27 .cse28 .cse2 .cse6 .cse18 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse11 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0)) (and .cse29 .cse12 .cse13 .cse14 .cse6 .cse17 .cse18 .cse11) (and .cse30 .cse26 .cse0 .cse27 .cse28 .cse2) (and .cse22 .cse4 .cse24 .cse23 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and .cse30 .cse5 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse31 (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse1 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and (and .cse29 .cse14 .cse6 .cse17) .cse12 .cse25 .cse18 .cse11) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse19 .cse27 .cse20 .cse21) (and .cse26 .cse27 .cse28 .cse21) (and .cse19 .cse21 .cse7 (= |ULTIMATE.start_FloppyCreateClose_#res| 0))))))) [2019-11-20 02:21:38,252 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,252 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 394) no Hoare annotation was computed. [2019-11-20 02:21:38,252 INFO L444 ceAbstractionStarter]: For program point L389-2(lines 227 415) no Hoare annotation was computed. [2019-11-20 02:21:38,252 INFO L444 ceAbstractionStarter]: For program point L1314(lines 1314 1548) no Hoare annotation was computed. [2019-11-20 02:21:38,252 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,252 INFO L440 ceAbstractionStarter]: At program point L1315(lines 1314 1548) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 289) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 134) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L127-1(lines 127 134) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L1450(lines 1450 1453) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 591) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 526 591) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L1319(lines 1319 1546) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L130-2(lines 130 132) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L130-3(lines 130 132) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L130-5(lines 130 132) no Hoare annotation was computed. [2019-11-20 02:21:38,253 INFO L444 ceAbstractionStarter]: For program point L395-1(lines 395 399) no Hoare annotation was computed. [2019-11-20 02:21:38,254 INFO L440 ceAbstractionStarter]: At program point L1320(lines 1319 1546) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-20 02:21:38,254 INFO L444 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-11-20 02:21:38,254 INFO L444 ceAbstractionStarter]: For program point L263-2(lines 263 265) no Hoare annotation was computed. [2019-11-20 02:21:38,254 INFO L440 ceAbstractionStarter]: At program point L1056(lines 1051 1058) the Hoare annotation is: false [2019-11-20 02:21:38,254 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 02:21:38,254 INFO L440 ceAbstractionStarter]: At program point L1056-1(lines 1051 1058) the Hoare annotation is: false [2019-11-20 02:21:38,254 INFO L440 ceAbstractionStarter]: At program point L1056-2(lines 1051 1058) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0)) (.cse10 (= 1 ~compRegistered~0)) (.cse11 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~myStatus~0 1073741637) 0) .cse11) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-11-20 02:21:38,254 INFO L440 ceAbstractionStarter]: At program point L1056-3(lines 1051 1058) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0)) (.cse10 (= 1 ~compRegistered~0)) (.cse11 (= ~setEventCalled~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (<= (+ ~myStatus~0 1073741637) 0)) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-11-20 02:21:38,254 INFO L440 ceAbstractionStarter]: At program point L1056-4(lines 1051 1058) the Hoare annotation is: false [2019-11-20 02:21:38,254 INFO L440 ceAbstractionStarter]: At program point L1056-5(lines 1051 1058) the Hoare annotation is: false [2019-11-20 02:21:38,254 INFO L440 ceAbstractionStarter]: At program point L1056-6(lines 1051 1058) the Hoare annotation is: false [2019-11-20 02:21:38,255 INFO L440 ceAbstractionStarter]: At program point L1056-7(lines 1051 1058) the Hoare annotation is: (and (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~setEventCalled~0 1)) [2019-11-20 02:21:38,255 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,255 INFO L440 ceAbstractionStarter]: At program point L1056-8(lines 1051 1058) the Hoare annotation is: false [2019-11-20 02:21:38,255 INFO L440 ceAbstractionStarter]: At program point L1056-9(lines 1051 1058) the Hoare annotation is: false [2019-11-20 02:21:38,255 INFO L440 ceAbstractionStarter]: At program point L1056-10(lines 1051 1058) the Hoare annotation is: false [2019-11-20 02:21:38,255 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 568) no Hoare annotation was computed. [2019-11-20 02:21:38,255 INFO L440 ceAbstractionStarter]: At program point L793(lines 786 832) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse23 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~s~0 ~DC~0))) (let ((.cse8 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse28 (and .cse2 .cse3 (<= (+ ~s~0 5) ~IPC~0) .cse5)) (.cse11 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse13 (= ~s~0 ~IPC~0)) (.cse15 (and .cse0 .cse2 .cse23 .cse3))) (let ((.cse9 (and .cse13 .cse15)) (.cse20 (<= (+ ~DC~0 7) ~s~0)) (.cse19 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse21 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse6 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse7 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse24 (= ~SKIP2~0 ~s~0)) (.cse22 (= 1 ~pended~0)) (.cse16 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse17 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse18 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse26 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse4 (not (= ULTIMATE.start_main_~status~1 259))) (.cse27 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse14 (= ULTIMATE.start_main_~status~1 0)) (.cse25 (and (let ((.cse29 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse30 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (and .cse8 .cse10 .cse28) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse29) (<= .cse29 0) (<= (+ .cse30 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse30) 3221225494)) (<= (+ ~NP~0 4) ~MPR1~0))) .cse11 .cse12))) (or (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0)) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse12) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse19 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12) (and .cse6 .cse21 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse2 .cse19 .cse5) (and .cse13 .cse22 .cse0 .cse2 .cse23 .cse3) (and .cse6 .cse21 .cse11 (and .cse8 .cse24 .cse10 .cse15) .cse12) (and .cse14 .cse5 (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) (and .cse6 .cse15 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12) (and .cse22 .cse2 .cse5) (and .cse25 .cse26 .cse4 .cse27 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and .cse24 (or (and .cse22 .cse0 .cse2 .cse23 .cse3 .cse11 .cse12) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse12))) (and (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse28 .cse1 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse26 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse4 .cse25 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse27) (and (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse14 .cse25))))) [2019-11-20 02:21:38,256 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 539) no Hoare annotation was computed. [2019-11-20 02:21:38,256 INFO L447 ceAbstractionStarter]: At program point L794(lines 778 833) the Hoare annotation is: true [2019-11-20 02:21:38,256 INFO L440 ceAbstractionStarter]: At program point L662(lines 722 724) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0)) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-20 02:21:38,256 INFO L440 ceAbstractionStarter]: At program point L1059(lines 1059 1100) the Hoare annotation is: (let ((.cse0 (and (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (let ((.cse3 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse4 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse3 0) (<= (+ .cse4 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse3) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse4) 3221225494)))) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2) (and (and .cse0 .cse1 .cse2) (<= (+ ~myStatus~0 1073741637) 0)))) [2019-11-20 02:21:38,257 INFO L440 ceAbstractionStarter]: At program point L1059-1(lines 1059 1100) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= .cse1 0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ .cse2 1) 0) (and (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (= 1 ~compRegistered~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~NP~0 4) ~MPR1~0))) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (= ~myStatus~0 0) .cse0))) [2019-11-20 02:21:38,257 INFO L440 ceAbstractionStarter]: At program point L1059-2(lines 1059 1100) the Hoare annotation is: (let ((.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse4 (and .cse0 .cse2 (and (= 0 ~pended~0) .cse1 .cse6 .cse5 .cse3)) (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-11-20 02:21:38,257 INFO L440 ceAbstractionStarter]: At program point L1059-3(lines 1059 1100) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,257 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 830) no Hoare annotation was computed. [2019-11-20 02:21:38,258 INFO L444 ceAbstractionStarter]: For program point L796(lines 796 829) no Hoare annotation was computed. [2019-11-20 02:21:38,258 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1591) no Hoare annotation was computed. [2019-11-20 02:21:38,258 INFO L444 ceAbstractionStarter]: For program point L1589-2(lines 1587 1618) no Hoare annotation was computed. [2019-11-20 02:21:38,258 INFO L440 ceAbstractionStarter]: At program point L929(lines 929 949) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,258 INFO L440 ceAbstractionStarter]: At program point L929-1(lines 929 949) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9 .cse10))) [2019-11-20 02:21:38,259 INFO L444 ceAbstractionStarter]: For program point L797(lines 797 807) no Hoare annotation was computed. [2019-11-20 02:21:38,259 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,259 INFO L444 ceAbstractionStarter]: For program point L533(lines 533 536) no Hoare annotation was computed. [2019-11-20 02:21:38,259 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 275) no Hoare annotation was computed. [2019-11-20 02:21:38,259 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,260 INFO L444 ceAbstractionStarter]: For program point L798(lines 798 804) no Hoare annotation was computed. [2019-11-20 02:21:38,260 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,260 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,260 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 1592 1616) no Hoare annotation was computed. [2019-11-20 02:21:38,260 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1480) no Hoare annotation was computed. [2019-11-20 02:21:38,260 INFO L444 ceAbstractionStarter]: For program point L1328(lines 1328 1544) no Hoare annotation was computed. [2019-11-20 02:21:38,260 INFO L444 ceAbstractionStarter]: For program point L1064(lines 1064 1083) no Hoare annotation was computed. [2019-11-20 02:21:38,261 INFO L444 ceAbstractionStarter]: For program point L1064-1(lines 1064 1083) no Hoare annotation was computed. [2019-11-20 02:21:38,261 INFO L444 ceAbstractionStarter]: For program point L1064-2(lines 1064 1083) no Hoare annotation was computed. [2019-11-20 02:21:38,261 INFO L444 ceAbstractionStarter]: For program point L1064-3(lines 1064 1083) no Hoare annotation was computed. [2019-11-20 02:21:38,261 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1464) no Hoare annotation was computed. [2019-11-20 02:21:38,261 INFO L444 ceAbstractionStarter]: For program point L1065(lines 1065 1070) no Hoare annotation was computed. [2019-11-20 02:21:38,261 INFO L444 ceAbstractionStarter]: For program point L1065-2(lines 1065 1070) no Hoare annotation was computed. [2019-11-20 02:21:38,262 INFO L444 ceAbstractionStarter]: For program point L1065-4(lines 1065 1070) no Hoare annotation was computed. [2019-11-20 02:21:38,262 INFO L444 ceAbstractionStarter]: For program point L1065-6(lines 1065 1070) no Hoare annotation was computed. [2019-11-20 02:21:38,262 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 144) no Hoare annotation was computed. [2019-11-20 02:21:38,262 INFO L444 ceAbstractionStarter]: For program point L142-1(lines 142 144) no Hoare annotation was computed. [2019-11-20 02:21:38,262 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 947) no Hoare annotation was computed. [2019-11-20 02:21:38,262 INFO L444 ceAbstractionStarter]: For program point L935-1(lines 935 947) no Hoare annotation was computed. [2019-11-20 02:21:38,263 INFO L440 ceAbstractionStarter]: At program point L936(lines 935 947) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,263 INFO L440 ceAbstractionStarter]: At program point L936-1(lines 935 947) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9 .cse10))) [2019-11-20 02:21:38,263 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,263 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,264 INFO L440 ceAbstractionStarter]: At program point L541(lines 528 568) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse1 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (let ((.cse4 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse5 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse4) (<= .cse4 0) (and (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= 1 ~compRegistered~0)) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ .cse5 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse5) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~NP~0 4) ~MPR1~0))) (= ULTIMATE.start_main_~status~1 0))) (.cse2 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse3 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0))) (or (and (not (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse3) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3))) [2019-11-20 02:21:38,264 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1479) no Hoare annotation was computed. [2019-11-20 02:21:38,264 INFO L440 ceAbstractionStarter]: At program point L938(lines 937 947) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,265 INFO L440 ceAbstractionStarter]: At program point L938-1(lines 937 947) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9 .cse10))) [2019-11-20 02:21:38,265 INFO L444 ceAbstractionStarter]: For program point L542-1(lines 542 545) no Hoare annotation was computed. [2019-11-20 02:21:38,265 INFO L444 ceAbstractionStarter]: For program point L1600(lines 1600 1602) no Hoare annotation was computed. [2019-11-20 02:21:38,265 INFO L444 ceAbstractionStarter]: For program point L1600-2(lines 1600 1602) no Hoare annotation was computed. [2019-11-20 02:21:38,265 INFO L440 ceAbstractionStarter]: At program point L1072(lines 1064 1083) the Hoare annotation is: (let ((.cse0 (let ((.cse3 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse4 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ULTIMATE.start_main_~status~1 0) (<= .cse3 0) (<= (+ .cse4 1) 0) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (<= 0 .cse3) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (= 1 ~compRegistered~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse4) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~setEventCalled~0 1)))) (.cse1 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse2 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741823) 0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2) (and .cse0 (<= (+ ~myStatus~0 1073741637) 0) .cse1 .cse2))) [2019-11-20 02:21:38,266 INFO L440 ceAbstractionStarter]: At program point L1072-1(lines 1064 1083) the Hoare annotation is: false [2019-11-20 02:21:38,266 INFO L440 ceAbstractionStarter]: At program point L1072-2(lines 1064 1083) the Hoare annotation is: (let ((.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~NP~0 ~s~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse2 .cse3 (and .cse0 (and (= 0 ~pended~0) .cse1 .cse4 .cse5 .cse6)) (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-11-20 02:21:38,266 INFO L440 ceAbstractionStarter]: At program point L1072-3(lines 1064 1083) the Hoare annotation is: false [2019-11-20 02:21:38,266 INFO L444 ceAbstractionStarter]: For program point L1337(lines 1337 1542) no Hoare annotation was computed. [2019-11-20 02:21:38,267 INFO L440 ceAbstractionStarter]: At program point L809(lines 796 829) the Hoare annotation is: (let ((.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= ~s~0 ~DC~0)) (.cse26 (+ ~DC~0 2))) (let ((.cse28 (<= .cse26 ~SKIP2~0)) (.cse15 (and .cse2 .cse1))) (let ((.cse25 (= 0 ~compRegistered~0)) (.cse27 (<= (+ ~DC~0 5) ~IPC~0)) (.cse12 (and .cse28 .cse15))) (let ((.cse16 (and .cse27 .cse12)) (.cse20 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse22 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse21 (and .cse27 .cse2 .cse25 .cse28)) (.cse23 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse5 (or .cse16 (and .cse20 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse22 .cse21 .cse23))) (.cse10 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse14 (and .cse5 .cse10 .cse11))) (let ((.cse0 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse13 (<= .cse26 ~s~0)) (.cse6 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse3 (and .cse14 (<= (+ ~NP~0 4) ~MPR1~0))) (.cse8 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse7 (not (= ULTIMATE.start_main_~status~1 259))) (.cse9 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse17 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse18 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse19 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse24 (= 1 ~pended~0))) (or (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse0 .cse1) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse2 .cse0 .cse1) (and (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse3 .cse4) (and .cse5 (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse6 .cse7 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and (not (= 259 |ULTIMATE.start_IofCallDriver_#res|)) .cse8 .cse7 .cse3 .cse9 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and .cse6 .cse5 .cse7 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 ~DC~0 1073741825) ~s~0) .cse10 .cse11 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741825) ~s~0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| ~s~0 1073741816) ~IPC~0) (<= (+ ~s~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 1073741816) ~IPC~0) (<= (+ ULTIMATE.start_main_~status~1 1073741816) 0) .cse12) (and .cse13 .cse14) (and (<= (+ ULTIMATE.start_main_~status~1 1073741813) 0) .cse15 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| ~s~0 1073741813) ~SKIP2~0) (<= (+ ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ~DC~0 1073741813) ~SKIP2~0)) (and .cse16 .cse4 .cse17 .cse18 .cse19) (and .cse4 .cse1 (= |ULTIMATE.start_FloppyCreateClose_#res| 0)) (and .cse20 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (and .cse13 (and .cse10 .cse11 .cse21)) .cse22 .cse23) (and .cse24 .cse2 .cse25) (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse6 .cse7 .cse16 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse3 .cse8 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse7 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse9) (and .cse21 .cse4 .cse17 .cse18 .cse19 .cse23) (and (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse14 (<= (+ ULTIMATE.start_main_~status~1 1073741823) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0)) (and .cse24 .cse15))))))))) [2019-11-20 02:21:38,267 INFO L444 ceAbstractionStarter]: For program point L1470(lines 1470 1478) no Hoare annotation was computed. [2019-11-20 02:21:38,267 INFO L440 ceAbstractionStarter]: At program point L1338(lines 1328 1544) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,268 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,268 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,268 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,268 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 813) no Hoare annotation was computed. [2019-11-20 02:21:38,268 INFO L440 ceAbstractionStarter]: At program point L548-2(lines 548 564) the Hoare annotation is: (let ((.cse1 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (let ((.cse2 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse2) (<= .cse2 0) (and (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= 1 ~compRegistered~0)) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ .cse3 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse3) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~NP~0 4) ~MPR1~0))) (= ULTIMATE.start_main_~status~1 0)))) (let ((.cse0 (and .cse1 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))))) (or (and (not (= |ULTIMATE.start_IoQueryDeviceDescription_#res| 259)) .cse0) (and (= ~myStatus~0 0) (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse1 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (and (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse0)))) [2019-11-20 02:21:38,269 INFO L440 ceAbstractionStarter]: At program point L416(lines 227 417) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (= 0 ~pended~0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse17 (+ ~s~0 5)) (.cse6 (= ~s~0 ~DC~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0))) (let ((.cse8 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse7 (and .cse13 .cse15 (and .cse3 .cse12 .cse14 (<= .cse17 ~IPC~0) .cse6 .cse5))) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse1 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse19 (= ~SKIP2~0 ~s~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse11 (= ~s~0 ~IPC~0)) (.cse2 (= 1 ~pended~0)) (.cse18 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse0 (let ((.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse20) (<= .cse20 0) .cse8 .cse7 (<= (+ .cse21 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494)) .cse10 .cse16)))) (or (and .cse0 .cse1 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse7) (and .cse8 .cse9 .cse10 (and (and .cse11 .cse12 .cse3 .cse4 .cse13 .cse14 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse15) .cse16)) (and .cse2 .cse4 .cse5 (= ~NP~0 ~s~0) (<= .cse17 ~MPR3~0)) (and .cse0 .cse1 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse2 .cse18 .cse3 .cse4 .cse14 .cse19 .cse5 .cse8 .cse10) (and (and .cse18 .cse12 .cse4 .cse13 .cse19 .cse5 .cse15 .cse16 .cse3 .cse14 .cse8 .cse10) .cse9) (and .cse11 .cse2 .cse18 .cse3 .cse4 .cse14 .cse5) (and (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse0))))) [2019-11-20 02:21:38,269 INFO L444 ceAbstractionStarter]: For program point L1077(lines 1077 1081) no Hoare annotation was computed. [2019-11-20 02:21:38,270 INFO L440 ceAbstractionStarter]: At program point L1077-1(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (and (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (let ((.cse3 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse4 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse3 0) (<= (+ .cse4 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse3) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse4) 3221225494)))) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2) (and (and .cse0 .cse1 .cse2) (<= (+ ~myStatus~0 1073741637) 0)))) [2019-11-20 02:21:38,270 INFO L444 ceAbstractionStarter]: For program point L1077-2(lines 1077 1081) no Hoare annotation was computed. [2019-11-20 02:21:38,270 INFO L440 ceAbstractionStarter]: At program point L1077-3(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= .cse1 0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ .cse2 1) 0) (and (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (= 1 ~compRegistered~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~NP~0 4) ~MPR1~0))) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (= ~myStatus~0 0) .cse0))) [2019-11-20 02:21:38,270 INFO L444 ceAbstractionStarter]: For program point L1077-4(lines 1077 1081) no Hoare annotation was computed. [2019-11-20 02:21:38,270 INFO L440 ceAbstractionStarter]: At program point L1077-5(lines 1077 1081) the Hoare annotation is: (let ((.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse4 (and .cse0 .cse2 (and (= 0 ~pended~0) .cse1 .cse6 .cse5 .cse3)) (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-11-20 02:21:38,271 INFO L444 ceAbstractionStarter]: For program point L1077-6(lines 1077 1081) no Hoare annotation was computed. [2019-11-20 02:21:38,271 INFO L440 ceAbstractionStarter]: At program point L1077-7(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,271 INFO L444 ceAbstractionStarter]: For program point L549(lines 548 564) no Hoare annotation was computed. [2019-11-20 02:21:38,271 INFO L444 ceAbstractionStarter]: For program point L1474(lines 1474 1477) no Hoare annotation was computed. [2019-11-20 02:21:38,271 INFO L444 ceAbstractionStarter]: For program point L815(lines 815 827) no Hoare annotation was computed. [2019-11-20 02:21:38,272 INFO L444 ceAbstractionStarter]: For program point L1608(lines 1608 1614) no Hoare annotation was computed. [2019-11-20 02:21:38,272 INFO L440 ceAbstractionStarter]: At program point L155(lines 95 157) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (<= (+ ~s~0 5) ~MPR3~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 (<= (+ ~DC~0 2) ~SKIP2~0) .cse2 .cse3 .cse1 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1073741101) 0)))) [2019-11-20 02:21:38,272 INFO L440 ceAbstractionStarter]: At program point L155-1(lines 95 157) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0)) (.cse4 (<= (+ ~s~0 5) ~MPR3~0))) (or (and .cse0 (= 0 ~pended~0) .cse1 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse6 .cse5 .cse3 .cse4))) [2019-11-20 02:21:38,272 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 820) no Hoare annotation was computed. [2019-11-20 02:21:38,273 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,273 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,273 INFO L444 ceAbstractionStarter]: For program point L1346(lines 1346 1540) no Hoare annotation was computed. [2019-11-20 02:21:38,273 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 02:21:38,273 INFO L440 ceAbstractionStarter]: At program point L1482(lines 1346 1540) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,273 INFO L444 ceAbstractionStarter]: For program point L293-1(lines 227 415) no Hoare annotation was computed. [2019-11-20 02:21:38,274 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,274 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1098) no Hoare annotation was computed. [2019-11-20 02:21:38,274 INFO L444 ceAbstractionStarter]: For program point L1086-1(lines 1086 1098) no Hoare annotation was computed. [2019-11-20 02:21:38,274 INFO L444 ceAbstractionStarter]: For program point L1086-2(lines 1086 1098) no Hoare annotation was computed. [2019-11-20 02:21:38,274 INFO L444 ceAbstractionStarter]: For program point L1086-3(lines 1086 1098) no Hoare annotation was computed. [2019-11-20 02:21:38,274 INFO L444 ceAbstractionStarter]: For program point L954(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,275 INFO L444 ceAbstractionStarter]: For program point L954-2(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,275 INFO L444 ceAbstractionStarter]: For program point L954-4(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,275 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 826) no Hoare annotation was computed. [2019-11-20 02:21:38,275 INFO L444 ceAbstractionStarter]: For program point L954-6(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,275 INFO L444 ceAbstractionStarter]: For program point L954-8(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,275 INFO L444 ceAbstractionStarter]: For program point L954-10(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,275 INFO L444 ceAbstractionStarter]: For program point L954-12(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,276 INFO L444 ceAbstractionStarter]: For program point L954-14(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,276 INFO L444 ceAbstractionStarter]: For program point L954-16(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,276 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-11-20 02:21:38,276 INFO L444 ceAbstractionStarter]: For program point L954-18(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,276 INFO L444 ceAbstractionStarter]: For program point L426-2(lines 426 428) no Hoare annotation was computed. [2019-11-20 02:21:38,276 INFO L444 ceAbstractionStarter]: For program point L954-20(lines 954 960) no Hoare annotation was computed. [2019-11-20 02:21:38,277 INFO L440 ceAbstractionStarter]: At program point L1087(lines 1086 1098) the Hoare annotation is: (let ((.cse0 (and (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (let ((.cse3 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse4 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse3 0) (<= (+ .cse4 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse3) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse4) 3221225494)))) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2) (and (and .cse0 .cse1 .cse2) (<= (+ ~myStatus~0 1073741637) 0)))) [2019-11-20 02:21:38,277 INFO L440 ceAbstractionStarter]: At program point L1087-1(lines 1086 1098) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= .cse1 0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ .cse2 1) 0) (and (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (= 1 ~compRegistered~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~NP~0 4) ~MPR1~0))) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (= ~myStatus~0 0) .cse0))) [2019-11-20 02:21:38,277 INFO L440 ceAbstractionStarter]: At program point L1087-2(lines 1086 1098) the Hoare annotation is: (let ((.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse4 (and .cse0 .cse2 (and (= 0 ~pended~0) .cse1 .cse6 .cse5 .cse3)) (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-11-20 02:21:38,278 INFO L440 ceAbstractionStarter]: At program point L1087-3(lines 1086 1098) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,278 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,278 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,278 INFO L440 ceAbstractionStarter]: At program point L1617(lines 1580 1619) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse2 (+ ~s~0 5)) (.cse1 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) .cse0 .cse1 (= ~NP~0 ~s~0) (<= .cse2 ~MPR3~0)) (and (= 0 ~pended~0) .cse0 (<= .cse2 ~IPC~0) .cse1 (= ~s~0 ~DC~0) (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)))) [2019-11-20 02:21:38,278 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 562) no Hoare annotation was computed. [2019-11-20 02:21:38,279 INFO L440 ceAbstractionStarter]: At program point L1089(lines 1088 1098) the Hoare annotation is: (let ((.cse0 (and (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (let ((.cse3 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse4 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse3 0) (<= (+ .cse4 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse3) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse4) 3221225494)))) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2) (and (and .cse0 .cse1 .cse2) (<= (+ ~myStatus~0 1073741637) 0)))) [2019-11-20 02:21:38,279 INFO L440 ceAbstractionStarter]: At program point L1089-1(lines 1088 1098) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= .cse1 0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ .cse2 1) 0) (and (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (= 1 ~compRegistered~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~NP~0 4) ~MPR1~0))) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (= ~myStatus~0 0) .cse0))) [2019-11-20 02:21:38,280 INFO L440 ceAbstractionStarter]: At program point L1089-2(lines 1088 1098) the Hoare annotation is: (let ((.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse6 (<= (+ ~s~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse4 (and .cse0 .cse2 (and (= 0 ~pended~0) .cse1 .cse6 .cse5 .cse3)) (<= (+ ~NP~0 4) ~MPR1~0)))) [2019-11-20 02:21:38,280 INFO L440 ceAbstractionStarter]: At program point L1089-3(lines 1088 1098) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,280 INFO L440 ceAbstractionStarter]: At program point L429(lines 158 431) the Hoare annotation is: (let ((.cse16 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse11 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= 0 ~pended~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (+ ~s~0 5)) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse8 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse9 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse6 (let ((.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse19) (<= .cse19 0) .cse16 (and .cse11 .cse13 (and .cse0 .cse1 .cse15 (<= .cse7 ~IPC~0) .cse2 .cse3)) (<= (+ .cse20 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494)) .cse17 (<= (+ ~NP~0 4) ~MPR1~0)))) (.cse12 (= ~SKIP2~0 ~s~0)) (.cse14 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse18 (= ~s~0 ~IPC~0)) (.cse4 (= 1 ~pended~0)) (.cse10 (<= (+ ~DC~0 5) ~IPC~0)) (.cse5 (= 0 ~compRegistered~0))) (or (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3 .cse2) (and .cse6 (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|)) (and .cse4 .cse5 .cse3 (= ~NP~0 ~s~0) (<= .cse7 ~MPR3~0)) (and .cse6 .cse8 .cse9 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and .cse10 .cse1 .cse5 .cse11 .cse12 .cse3 .cse13 .cse14 .cse0 .cse15 .cse16 .cse17) (and .cse8 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse9 .cse6) (and .cse4 .cse10 .cse0 .cse5 .cse15 .cse12 .cse3 .cse16 .cse17) (and .cse14 .cse16 (and .cse18 .cse1 .cse0 .cse5 .cse11 .cse15 (<= (+ ~DC~0 7) ~s~0) .cse3 .cse13) .cse17) (and .cse18 .cse4 .cse10 .cse0 .cse5 .cse15 .cse3)))) [2019-11-20 02:21:38,281 INFO L444 ceAbstractionStarter]: For program point L1355(lines 1355 1538) no Hoare annotation was computed. [2019-11-20 02:21:38,281 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 305) no Hoare annotation was computed. [2019-11-20 02:21:38,281 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,281 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,281 INFO L440 ceAbstractionStarter]: At program point L565(lines 526 591) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,282 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,282 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1536) no Hoare annotation was computed. [2019-11-20 02:21:38,282 INFO L444 ceAbstractionStarter]: For program point L1625(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,282 INFO L444 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,282 INFO L444 ceAbstractionStarter]: For program point L1625-2(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,282 INFO L444 ceAbstractionStarter]: For program point L1625-3(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,283 INFO L444 ceAbstractionStarter]: For program point L1625-4(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,283 INFO L444 ceAbstractionStarter]: For program point L1493(lines 1493 1496) no Hoare annotation was computed. [2019-11-20 02:21:38,283 INFO L444 ceAbstractionStarter]: For program point L1625-5(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,283 INFO L444 ceAbstractionStarter]: For program point L1625-6(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,283 INFO L444 ceAbstractionStarter]: For program point L1625-7(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,283 INFO L444 ceAbstractionStarter]: For program point L1625-8(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,283 INFO L444 ceAbstractionStarter]: For program point L1625-9(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,284 INFO L444 ceAbstractionStarter]: For program point L1625-10(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,284 INFO L444 ceAbstractionStarter]: For program point L1625-11(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,284 INFO L444 ceAbstractionStarter]: For program point L1625-12(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,284 INFO L444 ceAbstractionStarter]: For program point L1625-13(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,284 INFO L444 ceAbstractionStarter]: For program point L1625-14(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,284 INFO L444 ceAbstractionStarter]: For program point L1625-15(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,284 INFO L444 ceAbstractionStarter]: For program point L1625-16(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,285 INFO L444 ceAbstractionStarter]: For program point L1625-17(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,285 INFO L444 ceAbstractionStarter]: For program point L1625-18(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,285 INFO L444 ceAbstractionStarter]: For program point L1625-19(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,285 INFO L444 ceAbstractionStarter]: For program point L1625-20(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,285 INFO L444 ceAbstractionStarter]: For program point L1625-21(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,285 INFO L444 ceAbstractionStarter]: For program point L1625-22(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,285 INFO L444 ceAbstractionStarter]: For program point L1625-23(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,286 INFO L444 ceAbstractionStarter]: For program point L1625-24(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,286 INFO L444 ceAbstractionStarter]: For program point L1625-25(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,286 INFO L444 ceAbstractionStarter]: For program point L1625-26(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,286 INFO L444 ceAbstractionStarter]: For program point L1625-27(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,286 INFO L444 ceAbstractionStarter]: For program point L1625-28(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,286 INFO L444 ceAbstractionStarter]: For program point L1625-29(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,286 INFO L444 ceAbstractionStarter]: For program point L1625-30(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,287 INFO L440 ceAbstractionStarter]: At program point L1626(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-20 02:21:38,287 INFO L444 ceAbstractionStarter]: For program point L1625-31(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,287 INFO L440 ceAbstractionStarter]: At program point L1626-1(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-20 02:21:38,287 INFO L444 ceAbstractionStarter]: For program point L1625-32(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,287 INFO L440 ceAbstractionStarter]: At program point L1626-2(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~s~0 5) ~IPC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-20 02:21:38,288 INFO L444 ceAbstractionStarter]: For program point L1625-33(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,288 INFO L440 ceAbstractionStarter]: At program point L1626-3(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-20 02:21:38,288 INFO L444 ceAbstractionStarter]: For program point L1625-34(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,288 INFO L440 ceAbstractionStarter]: At program point L1626-4(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-20 02:21:38,288 INFO L444 ceAbstractionStarter]: For program point L1625-35(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,288 INFO L440 ceAbstractionStarter]: At program point L1626-5(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,289 INFO L444 ceAbstractionStarter]: For program point L1625-36(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,289 INFO L444 ceAbstractionStarter]: For program point L1625-37(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,289 INFO L440 ceAbstractionStarter]: At program point L1626-7(lines 1 1628) the Hoare annotation is: (let ((.cse5 (= ~SKIP2~0 ~s~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (= ~s~0 ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 .cse6 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 ~DC~0 1073741830) ~s~0) .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse11 .cse6 .cse8))) [2019-11-20 02:21:38,289 INFO L444 ceAbstractionStarter]: For program point L1625-38(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,289 INFO L440 ceAbstractionStarter]: At program point L1626-8(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-20 02:21:38,290 INFO L444 ceAbstractionStarter]: For program point L1625-39(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,290 INFO L440 ceAbstractionStarter]: At program point L1626-9(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,290 INFO L444 ceAbstractionStarter]: For program point L1625-40(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,290 INFO L444 ceAbstractionStarter]: For program point L1625-41(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,290 INFO L440 ceAbstractionStarter]: At program point L1626-11(lines 1 1628) the Hoare annotation is: (let ((.cse5 (= ~SKIP2~0 ~s~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (= ~s~0 ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 .cse6 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 ~DC~0 1073741830) ~s~0) .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse11 .cse6 .cse8))) [2019-11-20 02:21:38,291 INFO L444 ceAbstractionStarter]: For program point L1625-42(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,291 INFO L444 ceAbstractionStarter]: For program point L1625-43(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,291 INFO L440 ceAbstractionStarter]: At program point L1626-13(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-20 02:21:38,291 INFO L444 ceAbstractionStarter]: For program point L1625-44(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,291 INFO L444 ceAbstractionStarter]: For program point L1625-45(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,291 INFO L444 ceAbstractionStarter]: For program point L1625-46(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,292 INFO L444 ceAbstractionStarter]: For program point L1625-47(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,292 INFO L440 ceAbstractionStarter]: At program point L1626-17(lines 1 1628) the Hoare annotation is: (let ((.cse23 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse24 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse2 (<= .cse24 0)) (.cse10 (<= (+ .cse23 1) 0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (<= 0 .cse24)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse20 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= 1 ~compRegistered~0)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse23) 3221225494))) (.cse16 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse17 (= ~setEventCalled~0 1))) (let ((.cse19 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse11 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (= ~NP~0 ~s~0)) (.cse21 (<= (+ ~myStatus~0 1073741637) 0)) (.cse18 (= ~myStatus~0 0)) (.cse22 (and .cse2 .cse10 .cse12 .cse13 .cse14 .cse3 .cse15 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) (and .cse0 .cse1 .cse20 .cse7 .cse9 .cse8 .cse5) .cse6 .cse16 .cse17))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~myStatus~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse8 (<= (+ ~s~0 5) ~MPR3~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse7 .cse8 .cse9 .cse2 .cse10 .cse19 .cse12 .cse13 .cse20 .cse14 .cse3 .cse15 .cse4 .cse5 .cse6 .cse16 .cse17) (and .cse0 .cse1 .cse7 .cse8 .cse9 .cse2 .cse10 .cse19 .cse12 .cse13 .cse20 .cse14 .cse3 .cse15 .cse4 .cse5 .cse21 .cse6 .cse16 .cse17) (and .cse21 .cse22) (and .cse0 .cse1 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse3 .cse15 .cse4 .cse5 .cse21 .cse6 .cse16 .cse17) (and .cse18 .cse22))))) [2019-11-20 02:21:38,292 INFO L444 ceAbstractionStarter]: For program point L1625-48(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,292 INFO L444 ceAbstractionStarter]: For program point L1625-49(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,292 INFO L444 ceAbstractionStarter]: For program point L1625-50(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,293 INFO L440 ceAbstractionStarter]: At program point L1626-20(lines 1 1628) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse12 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse15 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= 1 ~compRegistered~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse20)) (.cse9 (<= .cse20 0)) (.cse10 (<= (+ .cse19 1) 0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494))) (.cse11 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse18 (= ~setEventCalled~0 1)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse0 (and .cse12 .cse7 (not .cse15) (and (and (and .cse6 (and .cse2 .cse8 .cse3 (and .cse5 .cse4 (<= (+ ~s~0 5) ~MPR3~0) (= ~NP~0 ~s~0)))) .cse13 .cse14 .cse9 .cse10 .cse16 .cse11 .cse18) .cse17))) (.cse1 (and (and .cse2 (and .cse3 (and .cse4 .cse5 (<= (+ ~NP~0 5) ~MPR3~0) .cse6 .cse7)) .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~MPR3~0 ~s~0) .cse16 .cse17 .cse18))) (or (and .cse0 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (and (= ~myStatus~0 0) .cse1) (and (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse0) (and .cse1 (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-11-20 02:21:38,293 INFO L444 ceAbstractionStarter]: For program point L1625-51(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,293 INFO L444 ceAbstractionStarter]: For program point L1625-52(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,293 INFO L440 ceAbstractionStarter]: At program point L1626-22(lines 1037 1050) the Hoare annotation is: (let ((.cse0 (and (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~s~0 5) ~IPC~0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (<= (+ ~NP~0 4) ~MPR1~0))))))) (or (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse0) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse0))) [2019-11-20 02:21:38,294 INFO L440 ceAbstractionStarter]: At program point L1626-23(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,294 INFO L440 ceAbstractionStarter]: At program point L1626-25(lines 1 1628) the Hoare annotation is: (let ((.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse2 (= 0 ~compRegistered~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7) (and .cse7 (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse3 .cse2 (<= (+ ~DC~0 7) ~s~0) .cse6 .cse5) .cse4)))) [2019-11-20 02:21:38,294 INFO L440 ceAbstractionStarter]: At program point L1626-26(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-20 02:21:38,294 INFO L440 ceAbstractionStarter]: At program point L1626-28(lines 1 1628) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5) (and .cse0 (= 0 ~pended~0) .cse2 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse1 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse5))) [2019-11-20 02:21:38,295 INFO L440 ceAbstractionStarter]: At program point L1626-30(lines 1 1628) the Hoare annotation is: (let ((.cse4 (= 0 ~pended~0)) (.cse6 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse3 (= ~s~0 ~IPC~0)) (.cse0 (= 1 ~pended~0)) (.cse11 (<= (+ ~DC~0 5) ~IPC~0)) (.cse5 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (= ~SKIP2~0 ~s~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) (and (and (and (and .cse3 .cse4 .cse5 .cse6 .cse1 .cse7 .cse8 .cse2) (<= (+ ~DC~0 7) ~s~0)) .cse9) .cse10) (and (and (and .cse11 .cse4 .cse5 .cse6 .cse1 .cse12 .cse8 .cse2) .cse7) .cse10 .cse9) (and .cse3 .cse0 .cse11 .cse5 .cse1 .cse7 .cse2) (and .cse0 .cse11 .cse5 .cse1 .cse7 .cse12 .cse2 .cse10))) [2019-11-20 02:21:38,295 INFO L444 ceAbstractionStarter]: For program point L570(lines 570 577) no Hoare annotation was computed. [2019-11-20 02:21:38,295 INFO L440 ceAbstractionStarter]: At program point L1626-32(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,295 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,296 INFO L444 ceAbstractionStarter]: For program point L570-2(lines 570 577) no Hoare annotation was computed. [2019-11-20 02:21:38,296 INFO L440 ceAbstractionStarter]: At program point L1626-34(lines 1 1628) the Hoare annotation is: (let ((.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 (and (and (= ~s~0 ~IPC~0) .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7) .cse8) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse1 .cse2 .cse4 .cse3 .cse7 (= ~SKIP2~0 ~s~0) .cse6 .cse5 .cse8) .cse0))) [2019-11-20 02:21:38,296 INFO L440 ceAbstractionStarter]: At program point L1626-38(lines 1 1628) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse3 (<= .cse18 0)) (.cse6 (<= (+ .cse17 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse1 (= 0 ~pended~0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse13 (= 1 ~compRegistered~0)) (.cse11 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse12 (<= 0 .cse18)) (.cse7 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse15 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse10 .cse11 .cse12 (= ~NP~0 ~s~0) .cse13 .cse14 .cse15 .cse16) (and (= ~myStatus~0 0) .cse3 .cse6 .cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and .cse2 (and .cse1 .cse0 .cse9 .cse10 .cse4) .cse5 .cse13) .cse11 .cse12 .cse7 (= ~MPR3~0 ~s~0) .cse14 .cse15 .cse16)))) [2019-11-20 02:21:38,296 INFO L440 ceAbstractionStarter]: At program point L1626-41(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,297 INFO L440 ceAbstractionStarter]: At program point L1626-43(lines 1 1628) the Hoare annotation is: (let ((.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 (and (and (= ~s~0 ~IPC~0) .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7) .cse8) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse1 .cse2 .cse4 .cse3 .cse7 (= ~SKIP2~0 ~s~0) .cse6 .cse5 .cse8) .cse0))) [2019-11-20 02:21:38,297 INFO L440 ceAbstractionStarter]: At program point L1626-44(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,297 INFO L440 ceAbstractionStarter]: At program point L1626-46(lines 1 1628) the Hoare annotation is: (let ((.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 (and (and (= ~s~0 ~IPC~0) .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7) .cse8) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse1 .cse2 .cse4 .cse3 .cse7 (= ~SKIP2~0 ~s~0) .cse6 .cse5 .cse8) .cse0))) [2019-11-20 02:21:38,297 INFO L440 ceAbstractionStarter]: At program point L1626-47(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,298 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,298 INFO L440 ceAbstractionStarter]: At program point L1626-49(lines 1 1628) the Hoare annotation is: (let ((.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 (and (and (= ~s~0 ~IPC~0) .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7) .cse8) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse1 .cse2 .cse4 .cse3 .cse7 (= ~SKIP2~0 ~s~0) .cse6 .cse5 .cse8) .cse0))) [2019-11-20 02:21:38,298 INFO L447 ceAbstractionStarter]: At program point L835(lines 665 837) the Hoare annotation is: true [2019-11-20 02:21:38,298 INFO L440 ceAbstractionStarter]: At program point L1101(lines 1101 1122) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_ObReferenceObjectByHandle_#res| 1073741823) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 |ULTIMATE.start_ObReferenceObjectByHandle_#res|) .cse7 .cse8 .cse9))) [2019-11-20 02:21:38,298 INFO L440 ceAbstractionStarter]: At program point L1101-1(lines 1101 1122) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,299 INFO L440 ceAbstractionStarter]: At program point L705(lines 699 836) the Hoare annotation is: (let ((.cse10 (= 0 ~pended~0)) (.cse20 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (= ~s~0 ~DC~0))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (and .cse10 .cse20 .cse12))) (let ((.cse25 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse28 (and .cse0 .cse2 .cse3)) (.cse26 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse21 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse18 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (= 0 ~compRegistered~0))) (let ((.cse23 (= ~s~0 ~IPC~0)) (.cse19 (and .cse0 .cse10 .cse20 .cse9 .cse2)) (.cse22 (and (let ((.cse32 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse33 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse32) (<= .cse32 0) (<= (+ .cse33 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse33) 3221225494)) (and .cse25 .cse28 .cse26) (<= (+ ~NP~0 4) ~MPR1~0))) .cse21 .cse18))) (let ((.cse5 (and .cse22 (= 259 |ULTIMATE.start_IofCallDriver_#res|))) (.cse6 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse7 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse1 (not (= |ULTIMATE.start_FloppyDeviceControl_#res| 259))) (.cse4 (not (= ULTIMATE.start_main_~status~1 259))) (.cse14 (= ~SKIP2~0 ~s~0)) (.cse30 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse24 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse27 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse31 (<= (+ ~DC~0 7) ~s~0)) (.cse29 (and .cse23 .cse19)) (.cse11 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse15 (= |ULTIMATE.start_FloppyDeviceControl_#res| 0)) (.cse16 (= 0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse17 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (= 1 ~pended~0)) (.cse13 (= ULTIMATE.start_main_~status~1 0))) (or (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse5 .cse6 (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) .cse4 (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse7) (and .cse8 .cse9 (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse10 .cse11 .cse12) (and (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse13 .cse5) (and .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse8 .cse0 .cse20 .cse9 .cse2 .cse14 .cse21 .cse18) (and .cse6 .cse4 .cse7 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse22) (and .cse23 .cse8 .cse0 .cse20 .cse9 .cse2) (and .cse24 (and .cse25 .cse14 .cse26 .cse19) .cse27 .cse21 .cse18) (and (<= (+ |ULTIMATE.start_FloppyQueueRequest_#res| 1073741536) 0) .cse28 .cse1 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse29 .cse24 .cse30 .cse25 .cse26 .cse21 .cse18 (<= (+ |ULTIMATE.start_IofCallDriver_#res| ~DC~0 1073741830) ~s~0)) (and .cse24 .cse30 .cse25 .cse14 .cse26 .cse21 .cse19 .cse18) (and .cse29 .cse24 .cse30 .cse25 .cse31 .cse26 .cse21 .cse18) (and .cse24 .cse27 .cse21 (and .cse25 .cse31 .cse26 .cse29) .cse18) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 .cse20 .cse11 .cse12) (and .cse23 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse8 .cse20 .cse9 .cse12) (and .cse10 .cse12 .cse13 (= |ULTIMATE.start_FloppyCreateClose_#res| 0)))))))) [2019-11-20 02:21:38,300 INFO L440 ceAbstractionStarter]: At program point L838(lines 838 862) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)))) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) (or (and (= ~myStatus~0 0) .cse0) (and (<= (+ ~myStatus~0 1073741637) 0) .cse0))) [2019-11-20 02:21:38,300 INFO L444 ceAbstractionStarter]: For program point L1367(lines 1367 1534) no Hoare annotation was computed. [2019-11-20 02:21:38,300 INFO L444 ceAbstractionStarter]: For program point L972(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,300 INFO L440 ceAbstractionStarter]: At program point L972-1(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,300 INFO L444 ceAbstractionStarter]: For program point L972-2(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,300 INFO L440 ceAbstractionStarter]: At program point L972-3(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,301 INFO L444 ceAbstractionStarter]: For program point L972-4(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,301 INFO L440 ceAbstractionStarter]: At program point L972-5(lines 972 984) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= .cse18 0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16) (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-20 02:21:38,301 INFO L444 ceAbstractionStarter]: For program point L972-6(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,301 INFO L440 ceAbstractionStarter]: At program point L972-7(lines 972 984) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse2 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (= ~setEventCalled~0 1))))) (or (and (= ~myStatus~0 0) .cse0) (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)))) [2019-11-20 02:21:38,302 INFO L444 ceAbstractionStarter]: For program point L972-8(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,302 INFO L440 ceAbstractionStarter]: At program point L972-9(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,302 INFO L444 ceAbstractionStarter]: For program point L972-10(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,302 INFO L440 ceAbstractionStarter]: At program point L972-11(lines 972 984) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5) (and .cse0 (= 0 ~pended~0) .cse2 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse1 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse5))) [2019-11-20 02:21:38,302 INFO L444 ceAbstractionStarter]: For program point L972-12(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,302 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,302 INFO L440 ceAbstractionStarter]: At program point L972-13(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,302 INFO L444 ceAbstractionStarter]: For program point L972-14(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,303 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1503) no Hoare annotation was computed. [2019-11-20 02:21:38,303 INFO L440 ceAbstractionStarter]: At program point L972-15(lines 972 984) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-20 02:21:38,303 INFO L444 ceAbstractionStarter]: For program point L972-16(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,303 INFO L440 ceAbstractionStarter]: At program point L972-17(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,303 INFO L444 ceAbstractionStarter]: For program point L972-18(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,303 INFO L440 ceAbstractionStarter]: At program point L972-19(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,304 INFO L444 ceAbstractionStarter]: For program point L972-20(lines 972 984) no Hoare annotation was computed. [2019-11-20 02:21:38,304 INFO L440 ceAbstractionStarter]: At program point L972-21(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,304 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,304 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,304 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1120) no Hoare annotation was computed. [2019-11-20 02:21:38,304 INFO L444 ceAbstractionStarter]: For program point L1108-1(lines 1108 1120) no Hoare annotation was computed. [2019-11-20 02:21:38,304 INFO L440 ceAbstractionStarter]: At program point L1109(lines 1108 1120) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,304 INFO L440 ceAbstractionStarter]: At program point L1109-1(lines 1108 1120) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,304 INFO L444 ceAbstractionStarter]: For program point L1374(lines 1374 1532) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 329) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978-2(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978-4(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978-6(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L714(lines 714 717) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978-8(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L714-2(lines 714 717) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978-10(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978-12(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L582-2(lines 582 587) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978-14(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,305 INFO L444 ceAbstractionStarter]: For program point L978-16(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,306 INFO L444 ceAbstractionStarter]: For program point L978-18(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,306 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,306 INFO L444 ceAbstractionStarter]: For program point L978-20(lines 978 982) no Hoare annotation was computed. [2019-11-20 02:21:38,306 INFO L440 ceAbstractionStarter]: At program point L1111(lines 1110 1120) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,306 INFO L440 ceAbstractionStarter]: At program point L1111-1(lines 1110 1120) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,306 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,307 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 860) no Hoare annotation was computed. [2019-11-20 02:21:38,307 INFO L440 ceAbstractionStarter]: At program point L849(lines 848 860) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)))) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) (or (and (= ~myStatus~0 0) .cse0) (and (<= (+ ~myStatus~0 1073741637) 0) .cse0))) [2019-11-20 02:21:38,307 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 328) no Hoare annotation was computed. [2019-11-20 02:21:38,307 INFO L440 ceAbstractionStarter]: At program point L322-1(lines 1 1628) the Hoare annotation is: (and (= ~myStatus~0 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,307 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 02:21:38,308 INFO L440 ceAbstractionStarter]: At program point L851(lines 850 860) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)))) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) (or (and (= ~myStatus~0 0) .cse0) (and (<= (+ ~myStatus~0 1073741637) 0) .cse0))) [2019-11-20 02:21:38,308 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 193) no Hoare annotation was computed. [2019-11-20 02:21:38,308 INFO L444 ceAbstractionStarter]: For program point L191-2(lines 191 193) no Hoare annotation was computed. [2019-11-20 02:21:38,308 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1530) no Hoare annotation was computed. [2019-11-20 02:21:38,308 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,309 INFO L440 ceAbstractionStarter]: At program point L1382(lines 1374 1532) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-20 02:21:38,309 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,309 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,309 INFO L444 ceAbstractionStarter]: For program point L987(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,309 INFO L444 ceAbstractionStarter]: For program point L987-1(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,309 INFO L444 ceAbstractionStarter]: For program point L987-2(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,309 INFO L444 ceAbstractionStarter]: For program point L987-3(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,310 INFO L444 ceAbstractionStarter]: For program point L987-4(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,310 INFO L444 ceAbstractionStarter]: For program point L987-5(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,310 INFO L444 ceAbstractionStarter]: For program point L987-6(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,310 INFO L444 ceAbstractionStarter]: For program point L987-7(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,310 INFO L444 ceAbstractionStarter]: For program point L987-8(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,310 INFO L444 ceAbstractionStarter]: For program point L987-9(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,310 INFO L444 ceAbstractionStarter]: For program point L987-10(lines 987 1010) no Hoare annotation was computed. [2019-11-20 02:21:38,311 INFO L440 ceAbstractionStarter]: At program point L988(lines 987 1010) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,311 INFO L440 ceAbstractionStarter]: At program point L988-1(lines 987 1010) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,311 INFO L440 ceAbstractionStarter]: At program point L988-2(lines 987 1010) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= .cse18 0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16) (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-20 02:21:38,312 INFO L440 ceAbstractionStarter]: At program point L988-3(lines 987 1010) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-20 02:21:38,312 INFO L440 ceAbstractionStarter]: At program point L988-4(lines 987 1010) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,312 INFO L440 ceAbstractionStarter]: At program point L988-5(lines 987 1010) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and .cse0 (= 0 ~pended~0) .cse1 .cse2 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse3 (<= (+ ~s~0 2) ~MPR1~0) .cse4 .cse5) (and (= 1 ~pended~0) .cse0 .cse3 .cse1 .cse4 .cse2 .cse5))) [2019-11-20 02:21:38,312 INFO L440 ceAbstractionStarter]: At program point L988-6(lines 987 1010) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,313 INFO L440 ceAbstractionStarter]: At program point L988-7(lines 987 1010) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-20 02:21:38,313 INFO L440 ceAbstractionStarter]: At program point L988-8(lines 987 1010) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,313 INFO L440 ceAbstractionStarter]: At program point L988-9(lines 987 1010) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,313 INFO L440 ceAbstractionStarter]: At program point L988-10(lines 987 1010) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,313 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 204) no Hoare annotation was computed. [2019-11-20 02:21:38,314 INFO L440 ceAbstractionStarter]: At program point L1123(lines 1123 1144) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0))) (or (and (= |ULTIMATE.start_PsCreateSystemThread_#res| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_PsCreateSystemThread_#res| 1073741823) 0) .cse6 .cse7 .cse8 .cse9))) [2019-11-20 02:21:38,314 INFO L440 ceAbstractionStarter]: At program point L1123-1(lines 1123 1144) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0))) (or (and (= |ULTIMATE.start_PsCreateSystemThread_#res| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_PsCreateSystemThread_#res| 1073741823) 0) .cse6 .cse7 .cse8 .cse9))) [2019-11-20 02:21:38,314 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,314 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1528) no Hoare annotation was computed. [2019-11-20 02:21:38,314 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,314 INFO L444 ceAbstractionStarter]: For program point L992-1(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,315 INFO L444 ceAbstractionStarter]: For program point L992-2(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,315 INFO L444 ceAbstractionStarter]: For program point L992-3(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,315 INFO L444 ceAbstractionStarter]: For program point L992-4(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,315 INFO L444 ceAbstractionStarter]: For program point L992-5(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,315 INFO L444 ceAbstractionStarter]: For program point L992-6(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,315 INFO L444 ceAbstractionStarter]: For program point L992-7(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,315 INFO L444 ceAbstractionStarter]: For program point L728(lines 728 776) no Hoare annotation was computed. [2019-11-20 02:21:38,316 INFO L444 ceAbstractionStarter]: For program point L992-8(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,316 INFO L444 ceAbstractionStarter]: For program point L992-9(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,316 INFO L444 ceAbstractionStarter]: For program point L992-10(lines 992 1009) no Hoare annotation was computed. [2019-11-20 02:21:38,316 INFO L440 ceAbstractionStarter]: At program point L993(lines 992 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,316 INFO L440 ceAbstractionStarter]: At program point L993-1(lines 992 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,317 INFO L440 ceAbstractionStarter]: At program point L993-2(lines 992 1009) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= .cse18 0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16) (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-20 02:21:38,317 INFO L440 ceAbstractionStarter]: At program point L993-3(lines 992 1009) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-20 02:21:38,317 INFO L440 ceAbstractionStarter]: At program point L993-4(lines 992 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,317 INFO L440 ceAbstractionStarter]: At program point L993-5(lines 992 1009) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5) (and .cse0 (= 0 ~pended~0) .cse2 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse1 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse5))) [2019-11-20 02:21:38,318 INFO L440 ceAbstractionStarter]: At program point L993-6(lines 992 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,318 INFO L440 ceAbstractionStarter]: At program point L993-7(lines 992 1009) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-20 02:21:38,318 INFO L440 ceAbstractionStarter]: At program point L729(lines 728 776) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-20 02:21:38,318 INFO L440 ceAbstractionStarter]: At program point L993-8(lines 992 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,319 INFO L440 ceAbstractionStarter]: At program point L993-9(lines 992 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,319 INFO L440 ceAbstractionStarter]: At program point L993-10(lines 992 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,319 INFO L440 ceAbstractionStarter]: At program point L597(lines 432 599) the Hoare annotation is: (let ((.cse0 (and (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~s~0 5) ~IPC~0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (<= (+ ~NP~0 4) ~MPR1~0))))))) (or (and (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0) .cse0) (and (not (= 259 |ULTIMATE.start_FloppyStartDevice_#res|)) (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse0) (not (= 259 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))))) [2019-11-20 02:21:38,319 INFO L440 ceAbstractionStarter]: At program point L995(lines 994 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,320 INFO L440 ceAbstractionStarter]: At program point L995-1(lines 994 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,320 INFO L440 ceAbstractionStarter]: At program point L995-2(lines 994 1009) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= .cse18 0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16) (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-20 02:21:38,320 INFO L440 ceAbstractionStarter]: At program point L995-3(lines 994 1009) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse18 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse18)) (.cse14 (= 1 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (<= (+ ~myStatus~0 1073741637) 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))))) [2019-11-20 02:21:38,320 INFO L440 ceAbstractionStarter]: At program point L995-4(lines 994 1009) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,321 INFO L440 ceAbstractionStarter]: At program point L863(lines 863 883) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9 .cse10))) [2019-11-20 02:21:38,321 INFO L440 ceAbstractionStarter]: At program point L995-5(lines 994 1009) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5) (and .cse0 (= 0 ~pended~0) .cse2 .cse4 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) .cse1 (<= (+ ~s~0 2) ~MPR1~0) .cse3 .cse5))) [2019-11-20 02:21:38,321 INFO L440 ceAbstractionStarter]: At program point L995-6(lines 994 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,321 INFO L440 ceAbstractionStarter]: At program point L995-7(lines 994 1009) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-20 02:21:38,322 INFO L440 ceAbstractionStarter]: At program point L995-8(lines 994 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,322 INFO L440 ceAbstractionStarter]: At program point L995-9(lines 994 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,322 INFO L440 ceAbstractionStarter]: At program point L995-10(lines 994 1009) the Hoare annotation is: (and (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~s~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,322 INFO L440 ceAbstractionStarter]: At program point L1524(lines 1399 1525) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (<= (+ ~s~0 5) ~MPR3~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 (<= (+ ~DC~0 2) ~SKIP2~0) .cse1 .cse2 .cse3 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))))) [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 775) no Hoare annotation was computed. [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point L205(lines 205 424) no Hoare annotation was computed. [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point L1130(lines 1130 1142) no Hoare annotation was computed. [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point L1130-1(lines 1130 1142) no Hoare annotation was computed. [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,323 INFO L440 ceAbstractionStarter]: At program point L734(lines 733 775) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1526) no Hoare annotation was computed. [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 343) no Hoare annotation was computed. [2019-11-20 02:21:38,323 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 343) no Hoare annotation was computed. [2019-11-20 02:21:38,324 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 424) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (= ~NP~0 ~s~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~myStatus~0 1073741637) 0)))) [2019-11-20 02:21:38,324 INFO L440 ceAbstractionStarter]: At program point L1131(lines 1130 1142) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,324 INFO L440 ceAbstractionStarter]: At program point L1131-1(lines 1130 1142) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,324 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,324 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,324 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 423) no Hoare annotation was computed. [2019-11-20 02:21:38,324 INFO L440 ceAbstractionStarter]: At program point L1133(lines 1132 1142) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,324 INFO L440 ceAbstractionStarter]: At program point L1133-1(lines 1132 1142) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,324 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,324 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 881) no Hoare annotation was computed. [2019-11-20 02:21:38,324 INFO L440 ceAbstractionStarter]: At program point L1398(lines 1388 1528) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L870(lines 869 881) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9 .cse10))) [2019-11-20 02:21:38,325 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 774) no Hoare annotation was computed. [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L739(lines 738 774) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L607(lines 600 609) the Hoare annotation is: false [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L607-1(lines 600 609) the Hoare annotation is: false [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L607-2(lines 600 609) the Hoare annotation is: (let ((.cse14 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= .cse14 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= 0 .cse14)) (.cse11 (= ~NP~0 ~s~0)) (.cse12 (= 1 ~compRegistered~0)) (.cse13 (= ~setEventCalled~0 1))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ~myStatus~0 1073741637) 0) .cse13)))) [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L607-3(lines 600 609) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 .cse1) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~setEventCalled~0 1))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (= ~myStatus~0 0) .cse0))) [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L607-4(lines 600 609) the Hoare annotation is: false [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L607-5(lines 600 609) the Hoare annotation is: false [2019-11-20 02:21:38,325 INFO L440 ceAbstractionStarter]: At program point L607-6(lines 600 609) the Hoare annotation is: false [2019-11-20 02:21:38,326 INFO L440 ceAbstractionStarter]: At program point L607-7(lines 600 609) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (and (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~setEventCalled~0 1))) [2019-11-20 02:21:38,326 INFO L440 ceAbstractionStarter]: At program point L607-8(lines 600 609) the Hoare annotation is: false [2019-11-20 02:21:38,326 INFO L440 ceAbstractionStarter]: At program point L607-9(lines 600 609) the Hoare annotation is: false [2019-11-20 02:21:38,326 INFO L440 ceAbstractionStarter]: At program point L607-10(lines 600 609) the Hoare annotation is: false [2019-11-20 02:21:38,326 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 422) no Hoare annotation was computed. [2019-11-20 02:21:38,326 INFO L440 ceAbstractionStarter]: At program point L872(lines 871 881) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (and (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5 .cse6) .cse7 .cse8) .cse9 .cse10) (and (and (<= (+ ~DC~0 5) ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse8) .cse7 .cse9 .cse10))) [2019-11-20 02:21:38,326 INFO L440 ceAbstractionStarter]: At program point L212(lines 208 423) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,326 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 421) no Hoare annotation was computed. [2019-11-20 02:21:38,326 INFO L440 ceAbstractionStarter]: At program point L1007(lines 971 1035) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (= ~SKIP1~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse4 .cse5 .cse6 .cse7))) [2019-11-20 02:21:38,327 INFO L440 ceAbstractionStarter]: At program point L1007-1(lines 971 1035) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (= ~SKIP1~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse4 .cse5 .cse6 .cse7))) [2019-11-20 02:21:38,327 INFO L440 ceAbstractionStarter]: At program point L1007-2(lines 971 1035) the Hoare annotation is: (let ((.cse22 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse19 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse21 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (<= (+ ~myStatus~0 1073741637) 0)) (.cse0 (= ~s~0 ~MPR1~0)) (.cse20 (= ~myStatus~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= .cse23 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ .cse22 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= 0 .cse23)) (.cse14 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (= 1 ~compRegistered~0)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse18 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 (= ~myStatus~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5 .cse6 .cse4 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse4 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18)))) [2019-11-20 02:21:38,327 INFO L440 ceAbstractionStarter]: At program point L1007-3(lines 971 1035) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse2 (= ~s~0 ~MPR1~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (<= (+ ~DC~0 5) ~IPC~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse8 (<= .cse19 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse10 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse19)) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494))) (.cse17 (= ~setEventCalled~0 1))) (let ((.cse0 (and .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse14 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse15 .cse16 .cse17))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7 .cse9 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (and (= ~myStatus~0 0) .cse0))))) [2019-11-20 02:21:38,327 INFO L440 ceAbstractionStarter]: At program point L1007-4(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,327 INFO L440 ceAbstractionStarter]: At program point L1007-5(lines 971 1035) the Hoare annotation is: (let ((.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= 1 ~pended~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (= ~SKIP1~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (and .cse4 (and .cse1 (= 0 ~pended~0) .cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse3 .cse6 .cse5 .cse7)) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7))) [2019-11-20 02:21:38,327 INFO L440 ceAbstractionStarter]: At program point L1007-6(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,328 INFO L440 ceAbstractionStarter]: At program point L1007-7(lines 971 1035) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse17 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= .cse17 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ .cse16 1) 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse12 (<= 0 .cse17)) (.cse13 (= 1 ~compRegistered~0)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494))) (.cse15 (= ~setEventCalled~0 1))) (or (and (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse9 .cse10 .cse11 .cse12 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse13 .cse14 .cse15)))) [2019-11-20 02:21:38,328 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 773) no Hoare annotation was computed. [2019-11-20 02:21:38,328 INFO L440 ceAbstractionStarter]: At program point L1007-8(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,328 INFO L440 ceAbstractionStarter]: At program point L1007-9(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,328 INFO L440 ceAbstractionStarter]: At program point L1007-10(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-20 02:21:38,328 INFO L440 ceAbstractionStarter]: At program point L83(lines 705 777) the Hoare annotation is: (let ((.cse1 (+ ~s~0 5)) (.cse0 (+ ~s~0 2))) (and (= ~myStatus~0 0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 ~SKIP2~0) (<= .cse1 ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse0 ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-11-20 02:21:38,328 INFO L440 ceAbstractionStarter]: At program point L744(lines 743 773) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0)) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-20 02:21:38,329 INFO L444 ceAbstractionStarter]: For program point L1273(lines 1273 1285) no Hoare annotation was computed. [2019-11-20 02:21:38,329 INFO L444 ceAbstractionStarter]: For program point L1273-2(lines 1272 1561) no Hoare annotation was computed. [2019-11-20 02:21:38,329 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,329 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 420) no Hoare annotation was computed. [2019-11-20 02:21:38,329 INFO L440 ceAbstractionStarter]: At program point L746(lines 745 773) the Hoare annotation is: (= ~NP~0 ~s~0) [2019-11-20 02:21:38,329 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,329 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 02:21:38,329 INFO L440 ceAbstractionStarter]: At program point L218(lines 214 421) the Hoare annotation is: (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,330 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,330 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,330 INFO L444 ceAbstractionStarter]: For program point L1409(lines 1409 1413) no Hoare annotation was computed. [2019-11-20 02:21:38,330 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 419) no Hoare annotation was computed. [2019-11-20 02:21:38,330 INFO L440 ceAbstractionStarter]: At program point L1145(lines 1145 1165) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_FlQueueIrpToThread_~status~0 0) .cse4 .cse5 .cse6 (= 0 |ULTIMATE.start_ObReferenceObjectByHandle_#res|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ULTIMATE.start_FlQueueIrpToThread_~status~0 1073741823) 0) .cse9 (<= (+ |ULTIMATE.start_ObReferenceObjectByHandle_#res| 1073741823) 0)))) [2019-11-20 02:21:38,330 INFO L440 ceAbstractionStarter]: At program point L1145-1(lines 1145 1165) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,331 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,331 INFO L444 ceAbstractionStarter]: For program point L1278(lines 1278 1283) no Hoare annotation was computed. [2019-11-20 02:21:38,331 INFO L440 ceAbstractionStarter]: At program point L221(lines 220 419) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,331 INFO L444 ceAbstractionStarter]: For program point L1015(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,331 INFO L444 ceAbstractionStarter]: For program point L1015-1(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,331 INFO L444 ceAbstractionStarter]: For program point L1015-2(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,332 INFO L444 ceAbstractionStarter]: For program point L1015-3(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,332 INFO L444 ceAbstractionStarter]: For program point L1015-4(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,332 INFO L444 ceAbstractionStarter]: For program point L1015-5(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,332 INFO L444 ceAbstractionStarter]: For program point L1015-6(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,332 INFO L444 ceAbstractionStarter]: For program point L1015-7(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,332 INFO L444 ceAbstractionStarter]: For program point L1015-8(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,332 INFO L444 ceAbstractionStarter]: For program point L1015-9(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,332 INFO L444 ceAbstractionStarter]: For program point L1015-10(lines 1015 1032) no Hoare annotation was computed. [2019-11-20 02:21:38,333 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 418) no Hoare annotation was computed. [2019-11-20 02:21:38,333 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,333 INFO L444 ceAbstractionStarter]: For program point L1016-3(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,333 INFO L440 ceAbstractionStarter]: At program point L884(lines 884 906) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (not (= |ULTIMATE.start_IoQueryDeviceDescription_#res| 259)) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,333 INFO L444 ceAbstractionStarter]: For program point L1016-6(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,334 INFO L444 ceAbstractionStarter]: For program point L1016-9(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,334 INFO L444 ceAbstractionStarter]: For program point L1016-12(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,334 INFO L444 ceAbstractionStarter]: For program point L1016-15(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,334 INFO L444 ceAbstractionStarter]: For program point L1016-18(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,334 INFO L444 ceAbstractionStarter]: For program point L1016-21(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,334 INFO L440 ceAbstractionStarter]: At program point L224(lines 223 418) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,334 INFO L444 ceAbstractionStarter]: For program point L1016-24(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,335 INFO L444 ceAbstractionStarter]: For program point L1016-27(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,335 INFO L440 ceAbstractionStarter]: At program point L92(lines 88 94) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,335 INFO L444 ceAbstractionStarter]: For program point L1016-30(lines 1016 1022) no Hoare annotation was computed. [2019-11-20 02:21:38,335 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 501) no Hoare annotation was computed. [2019-11-20 02:21:38,335 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 364) no Hoare annotation was computed. [2019-11-20 02:21:38,335 INFO L440 ceAbstractionStarter]: At program point L226(lines 225 418) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,336 INFO L444 ceAbstractionStarter]: For program point L1151(lines 1151 1163) no Hoare annotation was computed. [2019-11-20 02:21:38,336 INFO L444 ceAbstractionStarter]: For program point L1151-1(lines 1151 1163) no Hoare annotation was computed. [2019-11-20 02:21:38,336 INFO L440 ceAbstractionStarter]: At program point L1152(lines 1151 1163) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_FlQueueIrpToThread_~status~0 0) .cse4 .cse5 .cse6 (= 0 |ULTIMATE.start_ObReferenceObjectByHandle_#res|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ULTIMATE.start_FlQueueIrpToThread_~status~0 1073741823) 0) .cse9 (<= (+ |ULTIMATE.start_ObReferenceObjectByHandle_#res| 1073741823) 0)))) [2019-11-20 02:21:38,336 INFO L440 ceAbstractionStarter]: At program point L1152-1(lines 1151 1163) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,336 INFO L444 ceAbstractionStarter]: For program point L625(lines 625 627) no Hoare annotation was computed. [2019-11-20 02:21:38,336 INFO L440 ceAbstractionStarter]: At program point L1154(lines 1153 1163) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_FlQueueIrpToThread_~status~0 0) .cse4 .cse5 .cse6 (= 0 |ULTIMATE.start_ObReferenceObjectByHandle_#res|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ULTIMATE.start_FlQueueIrpToThread_~status~0 1073741823) 0) .cse9 (<= (+ |ULTIMATE.start_ObReferenceObjectByHandle_#res| 1073741823) 0)))) [2019-11-20 02:21:38,336 INFO L440 ceAbstractionStarter]: At program point L1154-1(lines 1153 1163) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-20 02:21:38,336 INFO L444 ceAbstractionStarter]: For program point L494(lines 494 500) no Hoare annotation was computed. [2019-11-20 02:21:38,336 INFO L440 ceAbstractionStarter]: At program point L494-1(lines 1 1628) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~NP~0 ~s~0)) (.cse10 (= 1 ~compRegistered~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~myStatus~0 1073741637) 0)))) [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1552(lines 1552 1558) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L440 ceAbstractionStarter]: At program point L1552-1(lines 1552 1558) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1 .cse2 (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0)) (and (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse3 .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) .cse2 .cse4 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259))) (and .cse0 .cse3 .cse1 .cse2 .cse4))) [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1024(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1024-2(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1024-4(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L892(lines 892 904) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1024-6(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1024-8(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1024-10(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1024-12(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,337 INFO L444 ceAbstractionStarter]: For program point L1024-14(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,338 INFO L444 ceAbstractionStarter]: For program point L1024-16(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,338 INFO L444 ceAbstractionStarter]: For program point L1024-18(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,338 INFO L444 ceAbstractionStarter]: For program point L1024-20(lines 1024 1031) no Hoare annotation was computed. [2019-11-20 02:21:38,338 INFO L440 ceAbstractionStarter]: At program point L893(lines 892 904) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= .cse0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2019-11-20 02:21:38,338 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,338 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-20 02:21:38,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:21:38 BoogieIcfgContainer [2019-11-20 02:21:38,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:21:38,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:21:38,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:21:38,492 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:21:38,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:20:00" (3/4) ... [2019-11-20 02:21:38,496 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 02:21:38,530 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2019-11-20 02:21:38,535 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2019-11-20 02:21:38,539 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-20 02:21:38,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 02:21:38,574 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && !(status == 259)) && !(ntStatus == 259)) || ((((((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (NP + DC + 7 <= IPC + SKIP1 && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 259 == \result) && !(ntStatus == 259)) && !(259 == \result)) && !(status == 259)) && !(259 == ntStatus)) && !(259 == \result))) || (((1 == pended && 0 == compRegistered) && NP == s) && s + 5 <= MPR3)) || (((\result + 1073741738 <= 0 && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && status == 0) && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (NP + DC + 7 <= IPC + SKIP1 && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 259 == \result)) || ((((((SKIP2 == s && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((!(ntStatus == 259) && !(status == 259)) && !(259 == \result)) && !(259 == returnVal2)) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (NP + DC + 7 <= IPC + SKIP1 && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || ((((lowerDriverReturn == status && ((NP + DC + 7 <= IPC + SKIP1 && SKIP2 == s) && SKIP1 + 2 <= MPR1) && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((\result + 1073741536 <= 0 && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && !(\result == 259)) && !(status == 259)) && ntStatus + 1073741536 <= 0)) || ((((((((s == IPC && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == status) && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + DC + 1073741830 <= s)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) || ((((((((s == IPC && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == status) && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((lowerDriverReturn == status && lowerDriverReturn == \result) && lowerDriverReturn == \result) && ((NP + DC + 7 <= IPC + SKIP1 && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && s == IPC && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((s == IPC && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((0 == pended && s == DC) && status == 0) && \result == 0) [2019-11-20 02:21:38,574 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && !(status == 259)) && !(ntStatus == 259)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && (s == IPC && ((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((\result + 1073741738 <= 0 && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((((!(ntStatus == 259) && !(259 == \result)) && (((((((((NP + DC + 7 <= IPC + SKIP1 && (DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && s == DC) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(status == 259)) && !(259 == ntStatus)) && !(259 == \result))) || ((((myStatus == 0 && ntStatus == 0) && (((((((((NP + DC + 7 <= IPC + SKIP1 && (DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && s == DC) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 == \result) && status == 0)) || ((lowerDriverReturn == status && lowerDriverReturn == \result) && ((((((s == IPC && ((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && DC + 7 <= s)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && (s == IPC && ((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + DC + 1073741830 <= s)) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == status) && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || ((((!(ntStatus == 259) && !(status == 259)) && !(259 == \result)) && (((((((((NP + DC + 7 <= IPC + SKIP1 && (DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && s == DC) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(259 == returnVal2))) || (((((((s == IPC && ((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && s == DC) && s + 5 <= IPC) && \result + 1073741536 <= 0) && !(\result == 259)) && !(status == 259)) && ntStatus + 1073741536 <= 0)) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && lowerDriverReturn == \result) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((0 == pended && s == DC) && status == 0) && \result == 0) [2019-11-20 02:21:38,574 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && s == IPC && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + DC + 1073741830 <= s)) || ((((((s == IPC && status == 0) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((\result + 1073741738 <= 0 && status + 1073741738 <= 0) && s == DC)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && s == IPC && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((lowerDriverReturn == status && lowerDriverReturn == \result) && NP + DC + 7 <= IPC + SKIP1) && s == IPC && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || ((((lowerDriverReturn == status && lowerDriverReturn == \result) && lowerDriverReturn == \result) && ((NP + DC + 7 <= IPC + SKIP1 && SKIP2 == s) && SKIP1 + 2 <= MPR1) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) || ((status == 0 && s == DC) && \result == 0)) || (((((((lowerDriverReturn == status && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || ((((((((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(ntStatus == 259)) && !(status == 259)) && !(259 == \result)) && !(259 == returnVal2))) || (SKIP2 == s && (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (((((status == 0 && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)))) || ((((\result + 1073741536 <= 0 && ((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && !(\result == 259)) && !(status == 259)) && ntStatus + 1073741536 <= 0)) || (((((!(ntStatus == 259) && !(259 == \result)) && !(status == 259)) && (((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(259 == ntStatus)) && !(259 == \result))) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && status == 0) && (((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,575 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\result + 1073741738 <= 0 && status + 1073741738 <= 0) && s == DC) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && ((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && status == 0)) || ((((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && \result + 1073741536 <= 0) && !(\result == 259)) && !(status == 259)) && ntStatus + 1073741536 <= 0)) || (((((!(259 == \result) && !(ntStatus == 259)) && !(status == 259)) && ((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(259 == \result)) && !(259 == returnVal2))) || ((((((!(\result == 259) && ((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2))) && !(status == 259)) && returnVal2 + DC + 1073741825 <= s) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741825 <= s)) || (((\result + s + 1073741816 <= IPC && s + ntStatus + 1073741816 <= IPC) && status + 1073741816 <= 0) && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC)) || (DC + 2 <= s && (((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1)) || (((status + 1073741813 <= 0 && NP + 5 <= MPR3 && s == DC) && \result + s + 1073741813 <= SKIP2) && ntStatus + DC + 1073741813 <= SKIP2)) || (((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2)) || ((status == 0 && s == DC) && \result == 0)) || ((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 2 <= s && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered)) || ((((ntStatus == __cil_tmp91 && !(\result == 259)) && !(status == 259)) && DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) && !(ntStatus == 259))) || ((((((((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(ntStatus == 259)) && !(259 == \result)) && !(status == 259)) && !(259 == ntStatus)) && !(259 == \result))) || ((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((ntStatus + 1073741823 <= 0 && (((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status + 1073741823 <= 0) && \result + 1073741823 <= 0)) || (1 == pended && NP + 5 <= MPR3 && s == DC) [2019-11-20 02:21:38,576 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 [2019-11-20 02:21:38,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 [2019-11-20 02:21:38,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && s == DC) && status == 0) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || (((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && myStatus == 0) && ntStatus == 0) && 0 == \result)) || ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3)) || (((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && !(ntStatus == 259)) && !(259 == \result)) && !(259 == returnVal2))) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((!(ntStatus == 259) && !(259 == \result)) && !(259 == ntStatus)) && !(259 == \result)) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1)) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((lowerDriverReturn == \result && lowerDriverReturn == \result) && (((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2)) || ((((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) [2019-11-20 02:21:38,582 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-11-20 02:21:38,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-11-20 02:21:38,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ntStatus == 259) && (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1))) || ((((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-11-20 02:21:38,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((myStatus == 0 && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && ((NP + DC + 7 <= IPC + SKIP1 && (((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-11-20 02:21:38,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,585 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,585 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((myStatus == 0 && status == 0) && \result + 1073741802 <= 0) && DC + 2 <= SKIP2 && ((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && (0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-11-20 02:21:38,585 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-11-20 02:21:38,585 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-11-20 02:21:38,586 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,586 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && !(ntStatus == 259)) && !(259 == returnVal2)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || (ntStatus + 1073741823 <= 0 && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0)) || (((lowerDriverReturn == \result && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && ((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1)) || ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3)) || (((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && !(ntStatus == 259)) && !(259 == \result)) && !(259 == ntStatus))) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus == lowerDriverReturn)) || ((((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0)) || ((myStatus == 0 && ntStatus == 0) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) [2019-11-20 02:21:38,586 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,587 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && setEventCalled == 1 [2019-11-20 02:21:38,587 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\result == 0 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) [2019-11-20 02:21:38,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,590 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0)) || ((lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && ((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) [2019-11-20 02:21:38,591 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || (((((SKIP2 == s && \result == 0) && 0 == \result) && 0 == returnVal2) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == returnVal2)) || (((((((s == IPC && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((\result + 1073741738 <= 0 && 0 == pended) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((\result == lowerDriverReturn && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == returnVal2)) || (((((((((!(\result == 259) && 0 == pended) && 0 == compRegistered) && s + 5 <= IPC) && status == 0) && s == DC) && \result + 1073741536 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && ntStatus + 1073741536 <= 0)) || (((((((s == IPC && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == returnVal2)) || (((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s == DC) && !(ntStatus == 259))) || (((((s == IPC && \result == 0) && 0 == \result) && 0 == returnVal2) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,591 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-11-20 02:21:38,592 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-11-20 02:21:38,593 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-11-20 02:21:38,593 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (myStatus + 1073741637 <= 0 && (((((((((((\result + 1073741802 <= 0 && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && (((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (myStatus == 0 && (((((((((((\result + 1073741802 <= 0 && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && (((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-11-20 02:21:38,593 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((\result + 1073741802 <= 0 && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && (((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && myStatus + 1073741637 <= 0)) || ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (myStatus == 0 && ((((((((((((\result + 1073741802 <= 0 && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && (((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) [2019-11-20 02:21:38,594 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-11-20 02:21:38,594 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-11-20 02:21:38,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || ((((((((0 == pended && 0 == compRegistered) && s + 5 <= IPC) && status == 0) && s == DC) && \result + 1073741536 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && ntStatus + 1073741536 <= 0) [2019-11-20 02:21:38,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && setEventCalled == 1) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) [2019-11-20 02:21:38,618 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((status == 0 && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && ((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == s) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && myStatus == 0) && returnVal2 + 1073741823 <= 0) && ntStatus + 1073741823 <= 0) || ((((((((((((((((status == 0 && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && ((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == s) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && myStatus + 1073741637 <= 0) && returnVal2 + 1073741823 <= 0) && ntStatus + 1073741823 <= 0) [2019-11-20 02:21:38,618 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((((s == IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741830 <= s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,618 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && myStatus == 0) && ntStatus == 0) && status == 0) || ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && ntStatus == 0) && status == 0) && myStatus + 1073741637 <= 0) [2019-11-20 02:21:38,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && myStatus == 0) && ntStatus == 0) && status == 0) || ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && ntStatus == 0) && status == 0) && myStatus + 1073741637 <= 0) [2019-11-20 02:21:38,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && myStatus == 0) && ntStatus == 0) && status == 0) || ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && ntStatus == 0) && status == 0) && myStatus + 1073741637 <= 0) [2019-11-20 02:21:38,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || (((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && s + 5 <= MPR3) && status == 0) && \result + 1073741101 <= 0) [2019-11-20 02:21:38,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && myStatus == 0) && ntStatus == 0) && status == 0) || ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && ntStatus == 0) && status == 0) && myStatus + 1073741637 <= 0) [2019-11-20 02:21:38,620 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((((s == IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741830 <= s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,620 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\result == 0 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) [2019-11-20 02:21:38,620 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (myStatus == 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (myStatus + 1073741637 <= 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,620 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (myStatus == 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (myStatus + 1073741637 <= 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (myStatus == 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (myStatus + 1073741637 <= 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-20 02:21:38,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ntStatus + 1073741637 <= 0 && ntStatus == 0 && !(ntStatus == 259) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) || (\result + 1073741670 <= 0 && !(ntStatus == 259) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1)) || (!(259 == __cil_tmp11) && (((ntStatus == 0 && !(ntStatus == 259) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 0 == \result) && ntStatus == 0) && \result == 0) || (((myStatus == 0 && ntStatus == 0 && !(ntStatus == 259) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && \result == 0) [2019-11-20 02:21:38,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && \result + 1073741823 <= 0) || ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) [2019-11-20 02:21:38,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(259 == __cil_tmp11) && 0 == ntStatus) && (ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && ntStatus == 0) && 0 == returnVal2) && \result == 0) || ((((myStatus == 0 && 0 == ntStatus) && (ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && ntStatus == 0) && \result == 0) [2019-11-20 02:21:38,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\result == 259) && ((ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && !(259 == ntStatus)) || ((((myStatus == 0 && 0 == ntStatus) && (ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && ntStatus == 0) && \result == 0)) || (0 == returnVal2 && ((ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && !(259 == ntStatus)) [2019-11-20 02:21:38,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ntStatus == 0 && !(ntStatus == 259) && (lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && !(259 == ntStatus)) || ((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && !(ntStatus == 259) && (lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) [2019-11-20 02:21:38,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (myStatus == 0 && (((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && myStatus + 1073741637 <= 0) [2019-11-20 02:21:38,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && 0 == \result) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,623 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && !(ntStatus == 259) && (lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) || ((!(259 == \result) && ntStatus == 0 && !(ntStatus == 259) && (lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && !(259 == ntStatus)) [2019-11-20 02:21:38,623 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && NP == s) && \result + 1073741823 <= 0) [2019-11-20 02:21:38,623 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && NP == s) && \result + 1073741823 <= 0) [2019-11-20 02:21:38,623 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-11-20 02:21:38,623 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && NP == s) && \result + 1073741823 <= 0) [2019-11-20 02:21:38,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && myStatus + 1073741637 <= 0) || (ntStatus == 0 && (((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && 0 == returnVal2) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)))) || (myStatus == 0 && ((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-11-20 02:21:38,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ntStatus == 0 && status == 0) && !(259 == returnVal2)) && ((((((((DC + 2 <= SKIP2 && ((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && ((DC + 5 <= IPC && 0 == pended) && s + 5 <= MPR3) && NP == s) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && setEventCalled == 1) && lowerDriverReturn == returnVal2) && 0 == returnVal2) || (myStatus == 0 && ((((((((((((NP + DC + 7 <= IPC + SKIP1 && 1 == compRegistered && (((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (returnVal2 + 1073741823 <= 0 && ((ntStatus == 0 && status == 0) && !(259 == returnVal2)) && ((((((((DC + 2 <= SKIP2 && ((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && ((DC + 5 <= IPC && 0 == pended) && s + 5 <= MPR3) && NP == s) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && setEventCalled == 1) && lowerDriverReturn == returnVal2)) || ((((((((((((((NP + DC + 7 <= IPC + SKIP1 && 1 == compRegistered && (((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && myStatus + 1073741637 <= 0) [2019-11-20 02:21:38,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 == pended && DC + 5 <= IPC) && !(\result == 259)) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((myStatus == 0 && (((ntStatus == 0 && ((((((((DC + 2 <= SKIP2 && (((((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && status == 0) && 1 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 259 == returnVal2) && MPR3 == s) && 259 == \result) || ((((ntStatus == 0 && ((((((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && ((DC + 5 <= IPC && 0 == pended) && s + 5 <= MPR3) && NP == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && setEventCalled == 1) && status == 0) && !(259 == returnVal2)) && returnVal2 + 1073741823 <= 0)) || ((((ntStatus == 0 && ((((((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && ((DC + 5 <= IPC && 0 == pended) && s + 5 <= MPR3) && NP == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && setEventCalled == 1) && status == 0) && !(259 == returnVal2)) && 0 == returnVal2)) || (((((ntStatus == 0 && ((((((((DC + 2 <= SKIP2 && (((((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && status == 0) && 1 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 259 == returnVal2) && MPR3 == s) && 259 == \result) && myStatus + 1073741637 <= 0) [2019-11-20 02:21:38,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 [2019-11-20 02:21:38,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == MPR1 && myStatus == 0) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (myStatus + 1073741637 <= 0 && (((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) [2019-11-20 02:21:38,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && setEventCalled == 1) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && setEventCalled == 1) [2019-11-20 02:21:38,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) [2019-11-20 02:21:38,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 [2019-11-20 02:21:38,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) [2019-11-20 02:21:38,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) [2019-11-20 02:21:38,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) [2019-11-20 02:21:38,830 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_38da0288-54df-452f-9122-211d000b8c15/bin/uautomizer/witness.graphml [2019-11-20 02:21:38,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:21:38,832 INFO L168 Benchmark]: Toolchain (without parser) took 101533.23 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 946.1 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-20 02:21:38,832 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:21:38,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:38,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.10 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:38,833 INFO L168 Benchmark]: Boogie Preprocessor took 155.72 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:38,833 INFO L168 Benchmark]: RCFGBuilder took 2089.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.3 MB in the end (delta: 191.3 MB). Peak memory consumption was 191.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:38,834 INFO L168 Benchmark]: TraceAbstraction took 98001.27 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 891.3 MB in the beginning and 789.4 MB in the end (delta: 101.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 02:21:38,835 INFO L168 Benchmark]: Witness Printer took 338.78 ms. Allocated memory was 2.8 GB in the beginning and 2.9 GB in the end (delta: 86.5 MB). Free memory was 789.4 MB in the beginning and 2.8 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:38,836 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 755.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 184.10 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 155.72 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2089.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.3 MB in the end (delta: 191.3 MB). Peak memory consumption was 191.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98001.27 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 891.3 MB in the beginning and 789.4 MB in the end (delta: 101.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 338.78 ms. Allocated memory was 2.8 GB in the beginning and 2.9 GB in the end (delta: 86.5 MB). Free memory was 789.4 MB in the beginning and 2.8 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold - InvariantResult [Line: 1166]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1166]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 - InvariantResult [Line: 1110]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1088]: Loop Invariant Derived loop invariant: ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && myStatus == 0) && ntStatus == 0) && status == 0) || ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && ntStatus == 0) && status == 0) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1110]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1088]: Loop Invariant Derived loop invariant: ((ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) - InvariantResult [Line: 1088]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (((0 == pended && 0 == compRegistered) && s + 5 <= MPR3) && status == 0) && NP == s) && NP + 4 <= MPR1) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((((s == IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741830 <= s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) || (((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && NP + DC + 7 <= IPC + s) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP1 == s) - InvariantResult [Line: 1319]: Loop Invariant Derived loop invariant: (((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && NP == s) && s + 5 <= MPR3 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) || ((((NP + DC + 7 <= IPC + SKIP1 && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC && (((0 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 1 == compRegistered) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && 0 == \result) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 929]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 907]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 929]: Loop Invariant Derived loop invariant: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((((((((((((s == MPR1 && myStatus == 0) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (myStatus + 1073741637 <= 0 && (((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 863]: Loop Invariant Derived loop invariant: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1580]: Loop Invariant Derived loop invariant: ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || ((((((((0 == pended && 0 == compRegistered) && s + 5 <= IPC) && status == 0) && s == DC) && \result + 1073741536 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && ntStatus + 1073741536 <= 0) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: ((((((((((((((((status == 0 && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && ((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == s) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && myStatus == 0) && returnVal2 + 1073741823 <= 0) && ntStatus + 1073741823 <= 0) || ((((((((((((((((status == 0 && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp42 <= 259) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && ((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == s) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && myStatus + 1073741637 <= 0) && returnVal2 + 1073741823 <= 0) && ntStatus + 1073741823 <= 0) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((lowerDriverReturn == returnVal2 && (((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && DC + 2 <= SKIP2) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && myStatus == 0) && ntStatus == 0) && status == 0) || ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && ntStatus == 0) && status == 0) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (((0 == pended && 0 == compRegistered) && s + 5 <= MPR3) && status == 0) && NP == s) && NP + 4 <= MPR1) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((((((ntStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: ((((ntStatus + 1073741637 <= 0 && ntStatus == 0 && !(ntStatus == 259) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) || (\result + 1073741670 <= 0 && !(ntStatus == 259) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1)) || (!(259 == __cil_tmp11) && (((ntStatus == 0 && !(ntStatus == 259) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 0 == \result) && ntStatus == 0) && \result == 0) || (((myStatus == 0 && ntStatus == 0 && !(ntStatus == 259) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && \result == 0) - InvariantResult [Line: 1153]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && NP == s) && \result + 1073741823 <= 0) - InvariantResult [Line: 1153]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((lowerDriverReturn == returnVal2 && (((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && DC + 2 <= SKIP2) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) || (((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && NP + DC + 7 <= IPC + s) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == pended && DC + 5 <= IPC) && !(\result == 259)) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((myStatus == 0 && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && ((NP + DC + 7 <= IPC + SKIP1 && (((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: (myStatus == 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (myStatus + 1073741637 <= 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && !(status == 259)) && !(ntStatus == 259)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && (s == IPC && ((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((\result + 1073741738 <= 0 && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((((!(ntStatus == 259) && !(259 == \result)) && (((((((((NP + DC + 7 <= IPC + SKIP1 && (DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && s == DC) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(status == 259)) && !(259 == ntStatus)) && !(259 == \result))) || ((((myStatus == 0 && ntStatus == 0) && (((((((((NP + DC + 7 <= IPC + SKIP1 && (DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && s == DC) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 == \result) && status == 0)) || ((lowerDriverReturn == status && lowerDriverReturn == \result) && ((((((s == IPC && ((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && DC + 7 <= s)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && (s == IPC && ((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + DC + 1073741830 <= s)) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == status) && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || ((((!(ntStatus == 259) && !(status == 259)) && !(259 == \result)) && (((((((((NP + DC + 7 <= IPC + SKIP1 && (DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && s == DC) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(259 == returnVal2))) || (((((((s == IPC && ((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((((((DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && s == DC) && s + 5 <= IPC) && \result + 1073741536 <= 0) && !(\result == 259)) && !(status == 259)) && ntStatus + 1073741536 <= 0)) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && lowerDriverReturn == \result) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((0 == pended && s == DC) && status == 0) && \result == 0) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (myStatus == 0 && (((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((lowerDriverReturn == returnVal2 && (((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && DC + 2 <= SKIP2) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 786]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(status == 259)) && s == DC) && !(ntStatus == 259)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && s == IPC && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + DC + 1073741830 <= s)) || ((((((s == IPC && status == 0) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || ((\result + 1073741738 <= 0 && status + 1073741738 <= 0) && s == DC)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && s == IPC && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((lowerDriverReturn == status && lowerDriverReturn == \result) && NP + DC + 7 <= IPC + SKIP1) && s == IPC && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || ((((lowerDriverReturn == status && lowerDriverReturn == \result) && lowerDriverReturn == \result) && ((NP + DC + 7 <= IPC + SKIP1 && SKIP2 == s) && SKIP1 + 2 <= MPR1) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) || ((status == 0 && s == DC) && \result == 0)) || (((((((lowerDriverReturn == status && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || ((((((((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(ntStatus == 259)) && !(status == 259)) && !(259 == \result)) && !(259 == returnVal2))) || (SKIP2 == s && (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (((((status == 0 && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)))) || ((((\result + 1073741536 <= 0 && ((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && !(\result == 259)) && !(status == 259)) && ntStatus + 1073741536 <= 0)) || (((((!(ntStatus == 259) && !(259 == \result)) && !(status == 259)) && (((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(259 == ntStatus)) && !(259 == \result))) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && status == 0) && (((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && !(status == 259)) && !(ntStatus == 259)) || ((((((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (NP + DC + 7 <= IPC + SKIP1 && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 259 == \result) && !(ntStatus == 259)) && !(259 == \result)) && !(status == 259)) && !(259 == ntStatus)) && !(259 == \result))) || (((1 == pended && 0 == compRegistered) && NP == s) && s + 5 <= MPR3)) || (((\result + 1073741738 <= 0 && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && status == 0) && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (NP + DC + 7 <= IPC + SKIP1 && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 259 == \result)) || ((((((SKIP2 == s && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((!(ntStatus == 259) && !(status == 259)) && !(259 == \result)) && !(259 == returnVal2)) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (NP + DC + 7 <= IPC + SKIP1 && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || ((((lowerDriverReturn == status && ((NP + DC + 7 <= IPC + SKIP1 && SKIP2 == s) && SKIP1 + 2 <= MPR1) && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((\result + 1073741536 <= 0 && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (0 == pended && NP + 5 <= MPR3) && s == DC) && !(\result == 259)) && !(status == 259)) && ntStatus + 1073741536 <= 0)) || ((((((((s == IPC && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == status) && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + DC + 1073741830 <= s)) || (((((((lowerDriverReturn == status && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) || ((((((((s == IPC && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == status) && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((lowerDriverReturn == status && lowerDriverReturn == \result) && lowerDriverReturn == \result) && ((NP + DC + 7 <= IPC + SKIP1 && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && s == IPC && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((s == IPC && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((0 == pended && s == DC) && status == 0) && \result == 0) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1374]: Loop Invariant Derived loop invariant: (((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && NP == s) && s + 5 <= MPR3 - InvariantResult [Line: 1328]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1145]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && NP == s) && \result + 1073741823 <= 0) - InvariantResult [Line: 1123]: Loop Invariant Derived loop invariant: ((((((((((\result == 0 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) - InvariantResult [Line: 1101]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && \result + 1073741823 <= 0) || ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) - InvariantResult [Line: 1145]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1123]: Loop Invariant Derived loop invariant: ((((((((((\result == 0 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) - InvariantResult [Line: 1101]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 796]: Loop Invariant Derived loop invariant: ((((((((((((((((((\result + 1073741738 <= 0 && status + 1073741738 <= 0) && s == DC) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && ((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && status == 0)) || ((((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && \result + 1073741536 <= 0) && !(\result == 259)) && !(status == 259)) && ntStatus + 1073741536 <= 0)) || (((((!(259 == \result) && !(ntStatus == 259)) && !(status == 259)) && ((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(259 == \result)) && !(259 == returnVal2))) || ((((((!(\result == 259) && ((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2))) && !(status == 259)) && returnVal2 + DC + 1073741825 <= s) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741825 <= s)) || (((\result + s + 1073741816 <= IPC && s + ntStatus + 1073741816 <= IPC) && status + 1073741816 <= 0) && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC)) || (DC + 2 <= s && (((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1)) || (((status + 1073741813 <= 0 && NP + 5 <= MPR3 && s == DC) && \result + s + 1073741813 <= SKIP2) && ntStatus + DC + 1073741813 <= SKIP2)) || (((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2)) || ((status == 0 && s == DC) && \result == 0)) || ((((lowerDriverReturn == status && lowerDriverReturn == \result) && DC + 2 <= s && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered)) || ((((ntStatus == __cil_tmp91 && !(\result == 259)) && !(status == 259)) && DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) && !(ntStatus == 259))) || ((((((((((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(ntStatus == 259)) && !(259 == \result)) && !(status == 259)) && !(259 == ntStatus)) && !(259 == \result))) || ((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((ntStatus + 1073741823 <= 0 && (((DC + 5 <= IPC && DC + 2 <= SKIP2 && NP + 5 <= MPR3 && s == DC) || ((((lowerDriverReturn == status && \result == lowerDriverReturn) && lowerDriverReturn == \result) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2)) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status + 1073741823 <= 0) && \result + 1073741823 <= 0)) || (1 == pended && NP + 5 <= MPR3 && s == DC) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (!(ntStatus == 259) && (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1))) || ((((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == returnVal2) && SKIP1 == s) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && s == DC) && status == 0) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || (((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && myStatus == 0) && ntStatus == 0) && 0 == \result)) || ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3)) || (((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && !(ntStatus == 259)) && !(259 == \result)) && !(259 == returnVal2))) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((!(ntStatus == 259) && !(259 == \result)) && !(259 == ntStatus)) && !(259 == \result)) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1)) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((lowerDriverReturn == \result && lowerDriverReturn == \result) && (((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2)) || ((((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)) || ((((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && myStatus + 1073741637 <= 0) || (ntStatus == 0 && (((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && 0 == returnVal2) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1)))) || (myStatus == 0 && ((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1388]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) || ((DC + 2 <= SKIP2 && ((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP1 == s) && NP + 4 <= MPR1)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == returnVal2) && SKIP1 == s) - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: (((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || ((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s == DC) && !(ntStatus == 259))) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == returnVal2) && SKIP1 == s) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 1 == compRegistered) && setEventCalled == 1 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: (((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && NP == s) && s + 5 <= MPR3 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(259 == returnVal2)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((myStatus == 0 && status == 0) && \result + 1073741802 <= 0) && DC + 2 <= SKIP2 && ((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && (0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) || (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((((s == IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && DC + 7 <= s) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && status == 0) && SKIP1 + 2 <= MPR1) && \result + DC + 1073741830 <= s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == \result) && 0 == returnVal2) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || (((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && NP == s) && s + 5 <= MPR3) && !(ntStatus == 259)) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) || ((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 1 == compRegistered) && setEventCalled == 1) - InvariantResult [Line: 1088]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 1 == compRegistered) && setEventCalled == 1) && myStatus + 1073741637 <= 0) || ((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 1 == compRegistered) && setEventCalled == 1) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || ((((((((((((((\result + 1073741802 <= 0 && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && (((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && myStatus + 1073741637 <= 0)) || ((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (myStatus == 0 && ((((((((((((\result + 1073741802 <= 0 && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && (((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && 259 == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || ((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((myStatus == 0 && (((ntStatus == 0 && ((((((((DC + 2 <= SKIP2 && (((((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && status == 0) && 1 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 259 == returnVal2) && MPR3 == s) && 259 == \result) || ((((ntStatus == 0 && ((((((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && ((DC + 5 <= IPC && 0 == pended) && s + 5 <= MPR3) && NP == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && setEventCalled == 1) && status == 0) && !(259 == returnVal2)) && returnVal2 + 1073741823 <= 0)) || ((((ntStatus == 0 && ((((((((((((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && ((DC + 5 <= IPC && 0 == pended) && s + 5 <= MPR3) && NP == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && setEventCalled == 1) && status == 0) && !(259 == returnVal2)) && 0 == returnVal2)) || (((((ntStatus == 0 && ((((((((DC + 2 <= SKIP2 && (((((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && status == 0) && 1 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 259 == returnVal2) && MPR3 == s) && 259 == \result) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0)) || ((lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && ((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: (((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && setEventCalled == 1 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: ((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && setEventCalled == 1) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && setEventCalled == 1) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((!(259 == __cil_tmp11) && 0 == ntStatus) && (ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && ntStatus == 0) && 0 == returnVal2) && \result == 0) || ((((myStatus == 0 && 0 == ntStatus) && (ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && ntStatus == 0) && \result == 0) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: ((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && setEventCalled == 1) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && setEventCalled == 1) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && myStatus + 1073741637 <= 0) || ((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && 0 == \result) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && NP == s) && \result + 1073741823 <= 0) - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 914]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 892]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: (myStatus == 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (myStatus + 1073741637 <= 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 838]: Loop Invariant Derived loop invariant: (myStatus == 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (myStatus + 1073741637 <= 0 && ntStatus == 0 && (((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && NP == s) && s + 5 <= MPR3) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) || (((((((1 == pended && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || (((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && s + 5 <= MPR3) && status == 0) && \result + 1073741101 <= 0) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1346]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && myStatus + 1073741637 <= 0) || ((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) - InvariantResult [Line: 705]: Loop Invariant Derived loop invariant: (((((((((((((myStatus == 0 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && s + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2 - InvariantResult [Line: 1563]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((lowerDriverReturn == returnVal2 && (((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && DC + 2 <= SKIP2) && NP + 4 <= MPR1) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: ((!(\result == 259) && ((ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && !(259 == ntStatus)) || ((((myStatus == 0 && 0 == ntStatus) && (ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && ntStatus == 0) && \result == 0)) || (0 == returnVal2 && ((ntStatus == 0 && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && ((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && status == 0) && !(259 == ntStatus)) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && !(ntStatus == 259)) && !(259 == returnVal2)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || (ntStatus + 1073741823 <= 0 && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0)) || (((lowerDriverReturn == \result && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && ((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1)) || ((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3)) || (((((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && !(ntStatus == 259)) && !(259 == \result)) && !(259 == ntStatus))) || ((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || ((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus == lowerDriverReturn)) || ((((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0)) || ((myStatus == 0 && ntStatus == 0) && (((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && (NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 894]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) || (((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && NP + DC + 7 <= IPC + s) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP1 == s) - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || ((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && DC + 7 <= s) && NP + 4 <= MPR1) && lowerDriverReturn == returnVal2)) || ((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1)) || ((((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0)) || (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((ntStatus == 0 && !(ntStatus == 259) && (lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && !(259 == ntStatus)) || ((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && !(ntStatus == 259) && (lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && NP + DC + 7 <= IPC + s) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP1 == s) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2) || (lowerDriverReturn == returnVal2 && (((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && DC + 2 <= SKIP2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((1 == pended && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3 - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: NP == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && \result + 1073741802 <= 0) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + DC + 7 <= IPC + SKIP1) && myStatus == returnVal2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && setEventCalled == 1) || (((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (myStatus + 1073741637 <= 0 && (((((((((((\result + 1073741802 <= 0 && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && (((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (myStatus == 0 && (((((((((((\result + 1073741802 <= 0 && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && (((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) - InvariantResult [Line: 1108]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: ((ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (((0 == pended && 0 == compRegistered) && s + 5 <= MPR3) && status == 0) && NP == s) && NP + 4 <= MPR1) - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: ((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((ntStatus == 0 && status == 0) && !(259 == returnVal2)) && ((((((((DC + 2 <= SKIP2 && ((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && ((DC + 5 <= IPC && 0 == pended) && s + 5 <= MPR3) && NP == s) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && setEventCalled == 1) && lowerDriverReturn == returnVal2) && 0 == returnVal2) || (myStatus == 0 && ((((((((((((NP + DC + 7 <= IPC + SKIP1 && 1 == compRegistered && (((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1)) || (returnVal2 + 1073741823 <= 0 && ((ntStatus == 0 && status == 0) && !(259 == returnVal2)) && ((((((((DC + 2 <= SKIP2 && ((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && ((DC + 5 <= IPC && 0 == pended) && s + 5 <= MPR3) && NP == s) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && setEventCalled == 1) && lowerDriverReturn == returnVal2)) || ((((((((((((((NP + DC + 7 <= IPC + SKIP1 && 1 == compRegistered && (((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 987]: Loop Invariant Derived loop invariant: (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1130]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 1108]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && !(ntStatus == 259) && (lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) || ((!(259 == \result) && ntStatus == 0 && !(ntStatus == 259) && (lowerDriverReturn == \result && lowerDriverReturn == returnVal2) && (((((((((((((0 == pended && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status == 0) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 4 <= MPR1) && !(259 == ntStatus)) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && myStatus == 0) && ntStatus == 0) && status == 0) || ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && ntStatus == 0) && status == 0) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 1130]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && NP + 4 <= MPR1 - InvariantResult [Line: 937]: Loop Invariant Derived loop invariant: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == returnVal2) && lowerDriverReturn == returnVal2) || ((((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && returnVal2 + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2)) || ((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 871]: Loop Invariant Derived loop invariant: ((((((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && NP + 4 <= MPR1) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s) || (((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && NP + DC + 7 <= IPC + s) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP1 == s) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((NP + DC + 7 <= IPC + s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: (((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && 0 == returnVal2) && lowerDriverReturn == returnVal2) || ((((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && returnVal2 + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2)) || (((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2)) || ((((((((s == IPC && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && 0 == returnVal2) && lowerDriverReturn == returnVal2)) || (((((((((s == IPC && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && 0 == compRegistered) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && myStatus == 0) && ntStatus == 0) && status == 0) || ((((((258 < __cil_tmp42 && (((((((((((((DC + 5 <= IPC && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && __cil_tmp42 <= 259) && lowerDriverReturn == returnVal2) && ntStatus == 0) && status == 0) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 1181]: Loop Invariant Derived loop invariant: ((((((((((((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3) || (((((SKIP2 == s && \result == 0) && 0 == \result) && 0 == returnVal2) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == returnVal2)) || (((((((s == IPC && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && \result + DC + 1073741830 <= s) && lowerDriverReturn == returnVal2)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((\result + 1073741738 <= 0 && 0 == pended) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((\result == lowerDriverReturn && NP + DC + 7 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == returnVal2)) || (((((((((!(\result == 259) && 0 == pended) && 0 == compRegistered) && s + 5 <= IPC) && status == 0) && s == DC) && \result + 1073741536 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && ntStatus + 1073741536 <= 0)) || (((((((s == IPC && \result == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == \result) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == returnVal2)) || (((((((((ntStatus == __cil_tmp91 && DC + 5 <= IPC) && !(\result == 259)) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s == DC) && !(ntStatus == 259))) || (((((s == IPC && \result == 0) && 0 == \result) && 0 == returnVal2) && ((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == pended && 0 == compRegistered) && status == 0) && NP == s) && s + 5 <= MPR3 - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || (myStatus == 0 && ntStatus == 0 && ((((((((0 <= __cil_tmp7 + 1073741802 && 0 <= \result + 1073741802) && \result + 1073741802 <= 0) && lowerDriverReturn == \result) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((((((0 == pended && NP == s) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && NP + 4 <= MPR1) && 259 == __cil_tmp11) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) || (((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && (DC + 5 <= IPC && DC + 2 <= SKIP2) && (((0 == pended && 0 == compRegistered) && s + 5 <= MPR3) && status == 0) && NP == s) && NP + 4 <= MPR1) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP1 == s - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((((((((((((myStatus == 0 && 259 <= __cil_tmp30) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && __cil_tmp30 <= 259) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 937]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == pended && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && \result + 1073741802 <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 1 == compRegistered) && lowerDriverReturn == \result) && !(259 == ntStatus)) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2 - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((s == MPR1 && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((s == MPR1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP + 4 <= MPR1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 570 locations, 53 error locations. Result: SAFE, OverallTime: 97.7s, OverallIterations: 64, TraceHistogramMax: 1, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 70.3s, HoareTripleCheckerStatistics: 29519 SDtfs, 28784 SDslu, 62511 SDs, 0 SdLazy, 9738 SolverSat, 913 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 609 GetRequests, 161 SyntacticMatches, 4 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=723occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 64 MinimizatonAttempts, 4446 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 216 LocationsWithAnnotation, 216 PreInvPairs, 832 NumberOfFragments, 24254 HoareAnnotationTreeSize, 216 FomulaSimplifications, 2860121977542867 FormulaSimplificationTreeSizeReduction, 12.2s HoareSimplificationTime, 216 FomulaSimplificationsInter, 454811986474635 FormulaSimplificationTreeSizeReductionInter, 57.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2781 NumberOfCodeBlocks, 2781 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2717 ConstructedInterpolants, 0 QuantifiedInterpolants, 325163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 64 PerfectInterpolantSequences, 0/0 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...