./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/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-cad4683 [2019-11-15 23:51:26,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:51:26,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:51:26,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:51:26,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:51:26,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:51:26,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:51:26,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:51:26,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:51:26,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:51:26,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:51:26,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:51:26,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:51:26,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:51:26,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:51:26,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:51:26,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:51:26,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:51:26,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:51:26,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:51:26,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:51:26,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:51:26,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:51:26,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:51:26,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:51:26,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:51:26,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:51:26,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:51:26,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:51:26,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:51:26,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:51:26,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:51:26,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:51:26,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:51:26,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:51:26,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:51:26,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:51:26,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:51:26,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:51:26,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:51:26,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:51:26,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:51:26,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:51:26,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:51:26,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:51:26,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:51:26,597 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:51:26,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:51:26,598 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:51:26,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:51:26,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:51:26,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:51:26,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:51:26,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:51:26,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:51:26,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:51:26,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:51:26,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:51:26,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:51:26,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:51:26,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:51:26,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:51:26,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:51:26,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:51:26,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:51:26,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:51:26,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:51:26,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:51:26,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:51:26,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:51:26,604 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_33d2c80a-9488-48b8-a694-3c297fcdede4/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-15 23:51:26,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:51:26,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:51:26,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:51:26,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:51:26,652 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:51:26,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-15 23:51:26,709 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/data/933294b12/bec5331a26974e76a33c8263f1185cbb/FLAG7598790ef [2019-11-15 23:51:27,163 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:51:27,165 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-15 23:51:27,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/data/933294b12/bec5331a26974e76a33c8263f1185cbb/FLAG7598790ef [2019-11-15 23:51:27,437 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/data/933294b12/bec5331a26974e76a33c8263f1185cbb [2019-11-15 23:51:27,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:51:27,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:51:27,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:51:27,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:51:27,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:51:27,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:51:27" (1/1) ... [2019-11-15 23:51:27,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f773146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:27, skipping insertion in model container [2019-11-15 23:51:27,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:51:27" (1/1) ... [2019-11-15 23:51:27,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:51:27,500 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:51:27,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:51:27,922 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:51:28,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:51:28,045 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:51:28,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28 WrapperNode [2019-11-15 23:51:28,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:51:28,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:51:28,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:51:28,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:51:28,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:51:28,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:51:28,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:51:28,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:51:28,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... [2019-11-15 23:51:28,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:51:28,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:51:28,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:51:28,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:51:28,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/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-15 23:51:28,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:51:28,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:51:28,601 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,618 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,623 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,633 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,650 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,652 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,659 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,665 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,670 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,673 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,675 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,677 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,680 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,684 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,685 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,686 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,689 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,691 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,692 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,693 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,695 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,697 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,701 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,709 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,711 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,716 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,722 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,723 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,724 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:28,726 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:51:29,957 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-11-15 23:51:29,957 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-11-15 23:51:29,960 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-11-15 23:51:29,960 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-11-15 23:51:29,961 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-11-15 23:51:29,962 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-11-15 23:51:29,962 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-11-15 23:51:29,962 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-11-15 23:51:29,962 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-11-15 23:51:29,962 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-11-15 23:51:29,963 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-15 23:51:29,963 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-15 23:51:29,964 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-15 23:51:29,964 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-15 23:51:29,964 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-11-15 23:51:29,965 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-11-15 23:51:29,965 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-11-15 23:51:29,965 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-11-15 23:51:29,965 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-15 23:51:29,965 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-15 23:51:29,966 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-11-15 23:51:29,968 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-15 23:51:29,969 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-15 23:51:29,969 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-11-15 23:51:29,969 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-11-15 23:51:29,969 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-11-15 23:51:29,969 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-11-15 23:51:29,970 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-11-15 23:51:29,970 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-11-15 23:51:29,970 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-11-15 23:51:29,970 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-11-15 23:51:29,970 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-11-15 23:51:29,971 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-11-15 23:51:29,971 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-11-15 23:51:29,972 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-11-15 23:51:29,972 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-11-15 23:51:29,974 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-15 23:51:29,974 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-15 23:51:29,974 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-11-15 23:51:29,975 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-11-15 23:51:29,975 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-11-15 23:51:29,975 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-11-15 23:51:29,976 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-11-15 23:51:29,976 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-11-15 23:51:29,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-11-15 23:51:29,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-11-15 23:51:29,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-11-15 23:51:29,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-11-15 23:51:29,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-11-15 23:51:29,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-11-15 23:51:29,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-11-15 23:51:29,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-11-15 23:51:29,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-11-15 23:51:29,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-11-15 23:51:29,979 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-15 23:51:29,979 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-15 23:51:29,979 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-11-15 23:51:29,979 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-11-15 23:51:29,979 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-15 23:51:29,980 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-15 23:51:29,982 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:51:29,983 INFO L284 CfgBuilder]: Removed 275 assume(true) statements. [2019-11-15 23:51:29,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:51:29 BoogieIcfgContainer [2019-11-15 23:51:29,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:51:29,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:51:29,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:51:29,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:51:29,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:51:27" (1/3) ... [2019-11-15 23:51:29,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f326d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:51:29, skipping insertion in model container [2019-11-15 23:51:29,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:51:28" (2/3) ... [2019-11-15 23:51:29,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f326d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:51:29, skipping insertion in model container [2019-11-15 23:51:29,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:51:29" (3/3) ... [2019-11-15 23:51:29,995 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-11-15 23:51:30,003 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:51:30,013 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2019-11-15 23:51:30,026 INFO L249 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2019-11-15 23:51:30,068 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:51:30,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:51:30,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:51:30,069 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:51:30,069 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:51:30,069 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:51:30,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:51:30,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:51:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states. [2019-11-15 23:51:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:51:30,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:30,111 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:30,115 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:30,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2019-11-15 23:51:30,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:30,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587626666] [2019-11-15 23:51:30,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:30,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:30,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:30,311 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-15 23:51:30,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587626666] [2019-11-15 23:51:30,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:30,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:30,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091302824] [2019-11-15 23:51:30,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:30,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:30,331 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 3 states. [2019-11-15 23:51:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:30,773 INFO L93 Difference]: Finished difference Result 1130 states and 1620 transitions. [2019-11-15 23:51:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:30,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 23:51:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:30,793 INFO L225 Difference]: With dead ends: 1130 [2019-11-15 23:51:30,795 INFO L226 Difference]: Without dead ends: 686 [2019-11-15 23:51:30,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-15 23:51:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 663. [2019-11-15 23:51:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-15 23:51:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 902 transitions. [2019-11-15 23:51:30,932 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 902 transitions. Word has length 10 [2019-11-15 23:51:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:30,933 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 902 transitions. [2019-11-15 23:51:30,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 902 transitions. [2019-11-15 23:51:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:51:30,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:30,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:30,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:30,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2019-11-15 23:51:30,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:30,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734792551] [2019-11-15 23:51:30,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:30,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:30,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:31,046 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-15 23:51:31,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734792551] [2019-11-15 23:51:31,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:31,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:31,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140013800] [2019-11-15 23:51:31,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:31,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:31,049 INFO L87 Difference]: Start difference. First operand 663 states and 902 transitions. Second operand 3 states. [2019-11-15 23:51:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:31,099 INFO L93 Difference]: Finished difference Result 682 states and 924 transitions. [2019-11-15 23:51:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:31,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 23:51:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:31,105 INFO L225 Difference]: With dead ends: 682 [2019-11-15 23:51:31,106 INFO L226 Difference]: Without dead ends: 663 [2019-11-15 23:51:31,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-15 23:51:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-11-15 23:51:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-15 23:51:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 901 transitions. [2019-11-15 23:51:31,136 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 901 transitions. Word has length 11 [2019-11-15 23:51:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:31,136 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 901 transitions. [2019-11-15 23:51:31,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 901 transitions. [2019-11-15 23:51:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:51:31,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:31,138 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:31,139 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:31,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2019-11-15 23:51:31,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:31,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755458060] [2019-11-15 23:51:31,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:31,220 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-15 23:51:31,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755458060] [2019-11-15 23:51:31,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:31,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:31,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642629152] [2019-11-15 23:51:31,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:31,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:31,222 INFO L87 Difference]: Start difference. First operand 663 states and 901 transitions. Second operand 3 states. [2019-11-15 23:51:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:31,278 INFO L93 Difference]: Finished difference Result 756 states and 1015 transitions. [2019-11-15 23:51:31,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:31,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 23:51:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:31,283 INFO L225 Difference]: With dead ends: 756 [2019-11-15 23:51:31,283 INFO L226 Difference]: Without dead ends: 732 [2019-11-15 23:51:31,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-11-15 23:51:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 677. [2019-11-15 23:51:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-15 23:51:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 929 transitions. [2019-11-15 23:51:31,313 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 929 transitions. Word has length 16 [2019-11-15 23:51:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:31,313 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 929 transitions. [2019-11-15 23:51:31,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 929 transitions. [2019-11-15 23:51:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:51:31,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:31,317 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:31,318 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2019-11-15 23:51:31,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:31,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943789656] [2019-11-15 23:51:31,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:31,392 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-15 23:51:31,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943789656] [2019-11-15 23:51:31,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:31,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:31,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839067753] [2019-11-15 23:51:31,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:31,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:31,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:31,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:31,394 INFO L87 Difference]: Start difference. First operand 677 states and 929 transitions. Second operand 3 states. [2019-11-15 23:51:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:31,661 INFO L93 Difference]: Finished difference Result 705 states and 963 transitions. [2019-11-15 23:51:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:31,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:51:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:31,666 INFO L225 Difference]: With dead ends: 705 [2019-11-15 23:51:31,666 INFO L226 Difference]: Without dead ends: 700 [2019-11-15 23:51:31,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-11-15 23:51:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2019-11-15 23:51:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-11-15 23:51:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 958 transitions. [2019-11-15 23:51:31,699 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 958 transitions. Word has length 19 [2019-11-15 23:51:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:31,700 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 958 transitions. [2019-11-15 23:51:31,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 958 transitions. [2019-11-15 23:51:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:51:31,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:31,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:31,710 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2019-11-15 23:51:31,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:31,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010397603] [2019-11-15 23:51:31,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:31,781 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-15 23:51:31,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010397603] [2019-11-15 23:51:31,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:31,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:31,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446192365] [2019-11-15 23:51:31,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:31,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:31,782 INFO L87 Difference]: Start difference. First operand 700 states and 958 transitions. Second operand 3 states. [2019-11-15 23:51:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:31,856 INFO L93 Difference]: Finished difference Result 1205 states and 1636 transitions. [2019-11-15 23:51:31,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:31,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:51:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:31,862 INFO L225 Difference]: With dead ends: 1205 [2019-11-15 23:51:31,862 INFO L226 Difference]: Without dead ends: 843 [2019-11-15 23:51:31,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-11-15 23:51:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 682. [2019-11-15 23:51:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-11-15 23:51:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 934 transitions. [2019-11-15 23:51:31,894 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 934 transitions. Word has length 19 [2019-11-15 23:51:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:31,895 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 934 transitions. [2019-11-15 23:51:31,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 934 transitions. [2019-11-15 23:51:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:51:31,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:31,896 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:31,897 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash -946930085, now seen corresponding path program 1 times [2019-11-15 23:51:31,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:31,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024112163] [2019-11-15 23:51:31,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:31,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:31,940 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-15 23:51:31,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024112163] [2019-11-15 23:51:31,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:31,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:31,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454206962] [2019-11-15 23:51:31,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:31,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:31,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:31,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:31,942 INFO L87 Difference]: Start difference. First operand 682 states and 934 transitions. Second operand 4 states. [2019-11-15 23:51:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:32,003 INFO L93 Difference]: Finished difference Result 694 states and 947 transitions. [2019-11-15 23:51:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:32,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-15 23:51:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:32,007 INFO L225 Difference]: With dead ends: 694 [2019-11-15 23:51:32,007 INFO L226 Difference]: Without dead ends: 674 [2019-11-15 23:51:32,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:32,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-11-15 23:51:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2019-11-15 23:51:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-15 23:51:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 924 transitions. [2019-11-15 23:51:32,039 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 924 transitions. Word has length 20 [2019-11-15 23:51:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:32,039 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 924 transitions. [2019-11-15 23:51:32,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 924 transitions. [2019-11-15 23:51:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:51:32,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:32,040 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:32,041 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2019-11-15 23:51:32,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:32,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984041683] [2019-11-15 23:51:32,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:32,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:32,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:32,096 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-15 23:51:32,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984041683] [2019-11-15 23:51:32,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:32,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:32,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179388073] [2019-11-15 23:51:32,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:32,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:32,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:32,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:32,098 INFO L87 Difference]: Start difference. First operand 674 states and 924 transitions. Second operand 3 states. [2019-11-15 23:51:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:32,285 INFO L93 Difference]: Finished difference Result 674 states and 924 transitions. [2019-11-15 23:51:32,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:32,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:51:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:32,289 INFO L225 Difference]: With dead ends: 674 [2019-11-15 23:51:32,289 INFO L226 Difference]: Without dead ends: 658 [2019-11-15 23:51:32,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-15 23:51:32,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-11-15 23:51:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-15 23:51:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 907 transitions. [2019-11-15 23:51:32,323 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 907 transitions. Word has length 23 [2019-11-15 23:51:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:32,323 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 907 transitions. [2019-11-15 23:51:32,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 907 transitions. [2019-11-15 23:51:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:51:32,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:32,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:32,327 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1059264480, now seen corresponding path program 1 times [2019-11-15 23:51:32,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:32,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686162967] [2019-11-15 23:51:32,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:32,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:32,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:32,387 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-15 23:51:32,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686162967] [2019-11-15 23:51:32,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:32,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:32,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168594795] [2019-11-15 23:51:32,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:32,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:32,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:32,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:32,389 INFO L87 Difference]: Start difference. First operand 658 states and 907 transitions. Second operand 4 states. [2019-11-15 23:51:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:32,452 INFO L93 Difference]: Finished difference Result 671 states and 921 transitions. [2019-11-15 23:51:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:32,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 23:51:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:32,457 INFO L225 Difference]: With dead ends: 671 [2019-11-15 23:51:32,457 INFO L226 Difference]: Without dead ends: 656 [2019-11-15 23:51:32,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-15 23:51:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-11-15 23:51:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-15 23:51:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-11-15 23:51:32,488 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 24 [2019-11-15 23:51:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:32,489 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-11-15 23:51:32,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-11-15 23:51:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:51:32,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:32,491 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:32,491 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2019-11-15 23:51:32,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:32,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949903833] [2019-11-15 23:51:32,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:32,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:32,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:32,523 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-15 23:51:32,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949903833] [2019-11-15 23:51:32,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:32,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:32,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094229684] [2019-11-15 23:51:32,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:32,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:32,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:32,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:32,525 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-11-15 23:51:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:32,762 INFO L93 Difference]: Finished difference Result 855 states and 1170 transitions. [2019-11-15 23:51:32,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:32,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:51:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:32,768 INFO L225 Difference]: With dead ends: 855 [2019-11-15 23:51:32,768 INFO L226 Difference]: Without dead ends: 847 [2019-11-15 23:51:32,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-11-15 23:51:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 674. [2019-11-15 23:51:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-15 23:51:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 931 transitions. [2019-11-15 23:51:32,806 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 931 transitions. Word has length 25 [2019-11-15 23:51:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:32,807 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 931 transitions. [2019-11-15 23:51:32,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 931 transitions. [2019-11-15 23:51:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:51:32,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:32,808 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:32,809 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash 417423376, now seen corresponding path program 1 times [2019-11-15 23:51:32,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:32,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718222204] [2019-11-15 23:51:32,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:32,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:32,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:32,882 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-15 23:51:32,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718222204] [2019-11-15 23:51:32,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:32,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:51:32,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108764467] [2019-11-15 23:51:32,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:51:32,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:51:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:32,885 INFO L87 Difference]: Start difference. First operand 674 states and 931 transitions. Second operand 7 states. [2019-11-15 23:51:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:33,667 INFO L93 Difference]: Finished difference Result 998 states and 1339 transitions. [2019-11-15 23:51:33,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:33,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-15 23:51:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:33,673 INFO L225 Difference]: With dead ends: 998 [2019-11-15 23:51:33,673 INFO L226 Difference]: Without dead ends: 749 [2019-11-15 23:51:33,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:51:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-11-15 23:51:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 657. [2019-11-15 23:51:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-15 23:51:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 895 transitions. [2019-11-15 23:51:33,712 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 895 transitions. Word has length 26 [2019-11-15 23:51:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:33,712 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 895 transitions. [2019-11-15 23:51:33,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:51:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 895 transitions. [2019-11-15 23:51:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:51:33,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:33,717 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:33,718 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -65691980, now seen corresponding path program 1 times [2019-11-15 23:51:33,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:33,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353315682] [2019-11-15 23:51:33,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:33,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:33,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:33,749 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-15 23:51:33,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353315682] [2019-11-15 23:51:33,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:33,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:33,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575122647] [2019-11-15 23:51:33,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:33,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:33,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:33,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:33,751 INFO L87 Difference]: Start difference. First operand 657 states and 895 transitions. Second operand 4 states. [2019-11-15 23:51:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:33,804 INFO L93 Difference]: Finished difference Result 670 states and 909 transitions. [2019-11-15 23:51:33,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:33,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-15 23:51:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:33,809 INFO L225 Difference]: With dead ends: 670 [2019-11-15 23:51:33,809 INFO L226 Difference]: Without dead ends: 655 [2019-11-15 23:51:33,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-15 23:51:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-11-15 23:51:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-15 23:51:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 892 transitions. [2019-11-15 23:51:33,841 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 892 transitions. Word has length 26 [2019-11-15 23:51:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:33,842 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 892 transitions. [2019-11-15 23:51:33,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 892 transitions. [2019-11-15 23:51:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:51:33,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:33,844 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:33,844 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2019-11-15 23:51:33,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:33,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845562887] [2019-11-15 23:51:33,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:33,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:33,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:33,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-15 23:51:33,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845562887] [2019-11-15 23:51:33,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:33,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:33,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91528061] [2019-11-15 23:51:33,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:33,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:33,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:33,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:33,877 INFO L87 Difference]: Start difference. First operand 655 states and 892 transitions. Second operand 4 states. [2019-11-15 23:51:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:33,945 INFO L93 Difference]: Finished difference Result 693 states and 933 transitions. [2019-11-15 23:51:33,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:33,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-15 23:51:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:33,949 INFO L225 Difference]: With dead ends: 693 [2019-11-15 23:51:33,949 INFO L226 Difference]: Without dead ends: 672 [2019-11-15 23:51:33,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-15 23:51:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 657. [2019-11-15 23:51:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-15 23:51:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 894 transitions. [2019-11-15 23:51:33,980 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 894 transitions. Word has length 27 [2019-11-15 23:51:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:33,980 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 894 transitions. [2019-11-15 23:51:33,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 894 transitions. [2019-11-15 23:51:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:51:33,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:33,982 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:33,982 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2019-11-15 23:51:33,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:33,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658867752] [2019-11-15 23:51:33,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:33,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:33,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:34,010 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-15 23:51:34,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658867752] [2019-11-15 23:51:34,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:34,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:34,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383360919] [2019-11-15 23:51:34,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:34,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:34,011 INFO L87 Difference]: Start difference. First operand 657 states and 894 transitions. Second operand 3 states. [2019-11-15 23:51:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:34,052 INFO L93 Difference]: Finished difference Result 697 states and 943 transitions. [2019-11-15 23:51:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:34,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:51:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:34,056 INFO L225 Difference]: With dead ends: 697 [2019-11-15 23:51:34,057 INFO L226 Difference]: Without dead ends: 634 [2019-11-15 23:51:34,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-15 23:51:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-11-15 23:51:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-15 23:51:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 857 transitions. [2019-11-15 23:51:34,086 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 857 transitions. Word has length 27 [2019-11-15 23:51:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:34,086 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 857 transitions. [2019-11-15 23:51:34,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 857 transitions. [2019-11-15 23:51:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:51:34,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:34,088 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:34,088 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2019-11-15 23:51:34,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:34,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224707032] [2019-11-15 23:51:34,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:34,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:34,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:34,118 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-15 23:51:34,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224707032] [2019-11-15 23:51:34,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:34,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:34,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353520820] [2019-11-15 23:51:34,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:34,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:34,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:34,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:34,120 INFO L87 Difference]: Start difference. First operand 632 states and 857 transitions. Second operand 4 states. [2019-11-15 23:51:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:34,192 INFO L93 Difference]: Finished difference Result 670 states and 898 transitions. [2019-11-15 23:51:34,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:34,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-15 23:51:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:34,197 INFO L225 Difference]: With dead ends: 670 [2019-11-15 23:51:34,197 INFO L226 Difference]: Without dead ends: 649 [2019-11-15 23:51:34,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-15 23:51:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 632. [2019-11-15 23:51:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-15 23:51:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 857 transitions. [2019-11-15 23:51:34,226 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 857 transitions. Word has length 28 [2019-11-15 23:51:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:34,227 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 857 transitions. [2019-11-15 23:51:34,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 857 transitions. [2019-11-15 23:51:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:51:34,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:34,228 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:34,229 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash 615415176, now seen corresponding path program 1 times [2019-11-15 23:51:34,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:34,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248870183] [2019-11-15 23:51:34,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:34,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:34,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:34,298 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-15 23:51:34,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248870183] [2019-11-15 23:51:34,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:34,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:51:34,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114731081] [2019-11-15 23:51:34,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:51:34,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:34,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:51:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:51:34,300 INFO L87 Difference]: Start difference. First operand 632 states and 857 transitions. Second operand 8 states. [2019-11-15 23:51:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:34,916 INFO L93 Difference]: Finished difference Result 654 states and 879 transitions. [2019-11-15 23:51:34,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:51:34,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-15 23:51:34,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:34,920 INFO L225 Difference]: With dead ends: 654 [2019-11-15 23:51:34,920 INFO L226 Difference]: Without dead ends: 649 [2019-11-15 23:51:34,920 INFO L600 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-15 23:51:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-15 23:51:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 642. [2019-11-15 23:51:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-15 23:51:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 867 transitions. [2019-11-15 23:51:34,952 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 867 transitions. Word has length 29 [2019-11-15 23:51:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:34,953 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 867 transitions. [2019-11-15 23:51:34,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:51:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 867 transitions. [2019-11-15 23:51:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:51:34,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:34,954 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:34,955 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1368733509, now seen corresponding path program 1 times [2019-11-15 23:51:34,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:34,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724553994] [2019-11-15 23:51:34,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:34,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:34,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:35,028 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-15 23:51:35,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724553994] [2019-11-15 23:51:35,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:35,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:51:35,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152916096] [2019-11-15 23:51:35,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:51:35,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:51:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:51:35,029 INFO L87 Difference]: Start difference. First operand 642 states and 867 transitions. Second operand 8 states. [2019-11-15 23:51:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:35,669 INFO L93 Difference]: Finished difference Result 654 states and 878 transitions. [2019-11-15 23:51:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:51:35,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-15 23:51:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:35,673 INFO L225 Difference]: With dead ends: 654 [2019-11-15 23:51:35,674 INFO L226 Difference]: Without dead ends: 649 [2019-11-15 23:51:35,674 INFO L600 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-15 23:51:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-15 23:51:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2019-11-15 23:51:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-15 23:51:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 868 transitions. [2019-11-15 23:51:35,716 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 868 transitions. Word has length 30 [2019-11-15 23:51:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:35,717 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 868 transitions. [2019-11-15 23:51:35,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:51:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 868 transitions. [2019-11-15 23:51:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:51:35,718 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:35,718 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:35,719 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:35,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1926882852, now seen corresponding path program 1 times [2019-11-15 23:51:35,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:35,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874804100] [2019-11-15 23:51:35,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:35,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:35,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:35,771 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-15 23:51:35,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874804100] [2019-11-15 23:51:35,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:35,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:51:35,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087903482] [2019-11-15 23:51:35,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:51:35,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:35,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:51:35,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:35,773 INFO L87 Difference]: Start difference. First operand 643 states and 868 transitions. Second operand 6 states. [2019-11-15 23:51:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:35,961 INFO L93 Difference]: Finished difference Result 697 states and 927 transitions. [2019-11-15 23:51:35,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:51:35,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-15 23:51:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:35,965 INFO L225 Difference]: With dead ends: 697 [2019-11-15 23:51:35,966 INFO L226 Difference]: Without dead ends: 640 [2019-11-15 23:51:35,966 INFO L600 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-15 23:51:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-15 23:51:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2019-11-15 23:51:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-11-15 23:51:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 827 transitions. [2019-11-15 23:51:35,999 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 827 transitions. Word has length 30 [2019-11-15 23:51:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:36,000 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 827 transitions. [2019-11-15 23:51:36,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:51:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 827 transitions. [2019-11-15 23:51:36,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:51:36,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:36,001 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:36,002 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:36,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:36,002 INFO L82 PathProgramCache]: Analyzing trace with hash 455111851, now seen corresponding path program 1 times [2019-11-15 23:51:36,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:36,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835047779] [2019-11-15 23:51:36,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:36,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:36,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:36,115 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-15 23:51:36,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835047779] [2019-11-15 23:51:36,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:36,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:51:36,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641938186] [2019-11-15 23:51:36,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:51:36,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:51:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:51:36,116 INFO L87 Difference]: Start difference. First operand 620 states and 827 transitions. Second operand 9 states. [2019-11-15 23:51:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:36,827 INFO L93 Difference]: Finished difference Result 637 states and 844 transitions. [2019-11-15 23:51:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:51:36,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-15 23:51:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:36,831 INFO L225 Difference]: With dead ends: 637 [2019-11-15 23:51:36,832 INFO L226 Difference]: Without dead ends: 632 [2019-11-15 23:51:36,832 INFO L600 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-15 23:51:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-15 23:51:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2019-11-15 23:51:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-11-15 23:51:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 826 transitions. [2019-11-15 23:51:36,870 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 826 transitions. Word has length 30 [2019-11-15 23:51:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:36,870 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 826 transitions. [2019-11-15 23:51:36,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:51:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 826 transitions. [2019-11-15 23:51:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:51:36,872 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:36,872 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:36,872 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2019-11-15 23:51:36,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:36,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584192613] [2019-11-15 23:51:36,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:36,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:36,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:36,905 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-15 23:51:36,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584192613] [2019-11-15 23:51:36,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:36,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:36,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156200139] [2019-11-15 23:51:36,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:36,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:36,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:36,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:36,906 INFO L87 Difference]: Start difference. First operand 620 states and 826 transitions. Second operand 3 states. [2019-11-15 23:51:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:37,137 INFO L93 Difference]: Finished difference Result 801 states and 1053 transitions. [2019-11-15 23:51:37,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:37,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 23:51:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:37,144 INFO L225 Difference]: With dead ends: 801 [2019-11-15 23:51:37,144 INFO L226 Difference]: Without dead ends: 778 [2019-11-15 23:51:37,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-11-15 23:51:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 658. [2019-11-15 23:51:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-15 23:51:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 869 transitions. [2019-11-15 23:51:37,186 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 869 transitions. Word has length 31 [2019-11-15 23:51:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:37,186 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 869 transitions. [2019-11-15 23:51:37,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 869 transitions. [2019-11-15 23:51:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:51:37,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:37,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:37,188 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash 694297730, now seen corresponding path program 1 times [2019-11-15 23:51:37,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:37,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496532775] [2019-11-15 23:51:37,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:37,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:37,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:37,306 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-15 23:51:37,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496532775] [2019-11-15 23:51:37,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:37,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:51:37,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295335848] [2019-11-15 23:51:37,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:51:37,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:37,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:51:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:51:37,307 INFO L87 Difference]: Start difference. First operand 658 states and 869 transitions. Second operand 9 states. [2019-11-15 23:51:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:38,008 INFO L93 Difference]: Finished difference Result 675 states and 885 transitions. [2019-11-15 23:51:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:51:38,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-15 23:51:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:38,012 INFO L225 Difference]: With dead ends: 675 [2019-11-15 23:51:38,012 INFO L226 Difference]: Without dead ends: 670 [2019-11-15 23:51:38,013 INFO L600 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-15 23:51:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-15 23:51:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 658. [2019-11-15 23:51:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-15 23:51:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 868 transitions. [2019-11-15 23:51:38,051 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 868 transitions. Word has length 31 [2019-11-15 23:51:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:38,052 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 868 transitions. [2019-11-15 23:51:38,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:51:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 868 transitions. [2019-11-15 23:51:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:51:38,053 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:38,053 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:38,053 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2019-11-15 23:51:38,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:38,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974454652] [2019-11-15 23:51:38,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:38,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:38,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:38,097 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-15 23:51:38,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974454652] [2019-11-15 23:51:38,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:38,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:38,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051587568] [2019-11-15 23:51:38,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:38,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:38,099 INFO L87 Difference]: Start difference. First operand 658 states and 868 transitions. Second operand 3 states. [2019-11-15 23:51:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:38,295 INFO L93 Difference]: Finished difference Result 866 states and 1144 transitions. [2019-11-15 23:51:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:38,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 23:51:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:38,299 INFO L225 Difference]: With dead ends: 866 [2019-11-15 23:51:38,299 INFO L226 Difference]: Without dead ends: 660 [2019-11-15 23:51:38,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-11-15 23:51:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-11-15 23:51:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-11-15 23:51:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 871 transitions. [2019-11-15 23:51:38,341 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 871 transitions. Word has length 31 [2019-11-15 23:51:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:38,341 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 871 transitions. [2019-11-15 23:51:38,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 871 transitions. [2019-11-15 23:51:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:51:38,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:38,343 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:38,343 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:38,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1153548271, now seen corresponding path program 1 times [2019-11-15 23:51:38,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:38,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087252250] [2019-11-15 23:51:38,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:38,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:38,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:38,420 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-15 23:51:38,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087252250] [2019-11-15 23:51:38,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:38,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:51:38,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605936243] [2019-11-15 23:51:38,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:51:38,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:51:38,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:38,421 INFO L87 Difference]: Start difference. First operand 660 states and 871 transitions. Second operand 6 states. [2019-11-15 23:51:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:38,793 INFO L93 Difference]: Finished difference Result 1317 states and 1722 transitions. [2019-11-15 23:51:38,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:38,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-15 23:51:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:38,799 INFO L225 Difference]: With dead ends: 1317 [2019-11-15 23:51:38,799 INFO L226 Difference]: Without dead ends: 1044 [2019-11-15 23:51:38,800 INFO L600 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-15 23:51:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-11-15 23:51:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 723. [2019-11-15 23:51:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-15 23:51:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 958 transitions. [2019-11-15 23:51:38,845 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 958 transitions. Word has length 32 [2019-11-15 23:51:38,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:38,845 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 958 transitions. [2019-11-15 23:51:38,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:51:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 958 transitions. [2019-11-15 23:51:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:51:38,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:38,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:38,847 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1153536355, now seen corresponding path program 1 times [2019-11-15 23:51:38,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:38,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910479650] [2019-11-15 23:51:38,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:38,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:38,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:38,892 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-15 23:51:38,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910479650] [2019-11-15 23:51:38,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:38,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:51:38,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605374893] [2019-11-15 23:51:38,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:51:38,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:38,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:51:38,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:38,894 INFO L87 Difference]: Start difference. First operand 723 states and 958 transitions. Second operand 6 states. [2019-11-15 23:51:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:39,221 INFO L93 Difference]: Finished difference Result 780 states and 1019 transitions. [2019-11-15 23:51:39,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:39,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-15 23:51:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:39,226 INFO L225 Difference]: With dead ends: 780 [2019-11-15 23:51:39,226 INFO L226 Difference]: Without dead ends: 764 [2019-11-15 23:51:39,227 INFO L600 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-15 23:51:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-11-15 23:51:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 719. [2019-11-15 23:51:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-11-15 23:51:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 952 transitions. [2019-11-15 23:51:39,271 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 952 transitions. Word has length 32 [2019-11-15 23:51:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:39,272 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 952 transitions. [2019-11-15 23:51:39,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:51:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 952 transitions. [2019-11-15 23:51:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:51:39,273 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:39,273 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:39,274 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:39,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:39,274 INFO L82 PathProgramCache]: Analyzing trace with hash -311870270, now seen corresponding path program 1 times [2019-11-15 23:51:39,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:39,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85158226] [2019-11-15 23:51:39,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:39,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:39,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:39,327 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-15 23:51:39,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85158226] [2019-11-15 23:51:39,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:39,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:51:39,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665123202] [2019-11-15 23:51:39,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:51:39,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:39,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:51:39,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:39,328 INFO L87 Difference]: Start difference. First operand 719 states and 952 transitions. Second operand 6 states. [2019-11-15 23:51:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:39,437 INFO L93 Difference]: Finished difference Result 731 states and 963 transitions. [2019-11-15 23:51:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:51:39,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-15 23:51:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:39,441 INFO L225 Difference]: With dead ends: 731 [2019-11-15 23:51:39,442 INFO L226 Difference]: Without dead ends: 710 [2019-11-15 23:51:39,443 INFO L600 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-15 23:51:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-11-15 23:51:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2019-11-15 23:51:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2019-11-15 23:51:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 940 transitions. [2019-11-15 23:51:39,485 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 940 transitions. Word has length 32 [2019-11-15 23:51:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:39,486 INFO L462 AbstractCegarLoop]: Abstraction has 710 states and 940 transitions. [2019-11-15 23:51:39,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:51:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 940 transitions. [2019-11-15 23:51:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:51:39,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:39,487 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:39,488 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:39,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:39,488 INFO L82 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2019-11-15 23:51:39,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:39,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287885960] [2019-11-15 23:51:39,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:39,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:39,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:39,514 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-15 23:51:39,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287885960] [2019-11-15 23:51:39,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:39,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:39,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303983525] [2019-11-15 23:51:39,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:39,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:39,516 INFO L87 Difference]: Start difference. First operand 710 states and 940 transitions. Second operand 3 states. [2019-11-15 23:51:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:39,584 INFO L93 Difference]: Finished difference Result 893 states and 1175 transitions. [2019-11-15 23:51:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:39,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-15 23:51:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:39,588 INFO L225 Difference]: With dead ends: 893 [2019-11-15 23:51:39,588 INFO L226 Difference]: Without dead ends: 686 [2019-11-15 23:51:39,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-15 23:51:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 670. [2019-11-15 23:51:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-15 23:51:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 882 transitions. [2019-11-15 23:51:39,629 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 882 transitions. Word has length 32 [2019-11-15 23:51:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:39,630 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 882 transitions. [2019-11-15 23:51:39,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 882 transitions. [2019-11-15 23:51:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:51:39,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:39,631 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:39,632 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:39,632 INFO L82 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2019-11-15 23:51:39,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:39,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592592324] [2019-11-15 23:51:39,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:39,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:39,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:39,666 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-15 23:51:39,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592592324] [2019-11-15 23:51:39,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:39,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:39,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922751629] [2019-11-15 23:51:39,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:39,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:39,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:39,667 INFO L87 Difference]: Start difference. First operand 670 states and 882 transitions. Second operand 5 states. [2019-11-15 23:51:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:39,746 INFO L93 Difference]: Finished difference Result 771 states and 1000 transitions. [2019-11-15 23:51:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:51:39,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-15 23:51:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:39,750 INFO L225 Difference]: With dead ends: 771 [2019-11-15 23:51:39,751 INFO L226 Difference]: Without dead ends: 747 [2019-11-15 23:51:39,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-15 23:51:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 670. [2019-11-15 23:51:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-15 23:51:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 881 transitions. [2019-11-15 23:51:39,795 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 881 transitions. Word has length 33 [2019-11-15 23:51:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:39,795 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 881 transitions. [2019-11-15 23:51:39,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 881 transitions. [2019-11-15 23:51:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:51:39,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:39,799 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:39,799 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:39,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:39,799 INFO L82 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2019-11-15 23:51:39,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:39,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678207974] [2019-11-15 23:51:39,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:39,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:39,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:39,826 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-15 23:51:39,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678207974] [2019-11-15 23:51:39,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:39,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:39,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209412782] [2019-11-15 23:51:39,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:39,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:39,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:39,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:39,827 INFO L87 Difference]: Start difference. First operand 670 states and 881 transitions. Second operand 3 states. [2019-11-15 23:51:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:40,029 INFO L93 Difference]: Finished difference Result 808 states and 1046 transitions. [2019-11-15 23:51:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:40,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 23:51:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:40,034 INFO L225 Difference]: With dead ends: 808 [2019-11-15 23:51:40,034 INFO L226 Difference]: Without dead ends: 765 [2019-11-15 23:51:40,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-15 23:51:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 706. [2019-11-15 23:51:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-15 23:51:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 918 transitions. [2019-11-15 23:51:40,081 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 918 transitions. Word has length 33 [2019-11-15 23:51:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:40,081 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 918 transitions. [2019-11-15 23:51:40,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 918 transitions. [2019-11-15 23:51:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:51:40,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:40,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:40,083 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2019-11-15 23:51:40,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:40,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088331401] [2019-11-15 23:51:40,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:40,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:40,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:40,115 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-15 23:51:40,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088331401] [2019-11-15 23:51:40,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:40,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:40,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972627250] [2019-11-15 23:51:40,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:40,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:40,116 INFO L87 Difference]: Start difference. First operand 706 states and 918 transitions. Second operand 4 states. [2019-11-15 23:51:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:40,337 INFO L93 Difference]: Finished difference Result 725 states and 938 transitions. [2019-11-15 23:51:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:40,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 23:51:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:40,341 INFO L225 Difference]: With dead ends: 725 [2019-11-15 23:51:40,341 INFO L226 Difference]: Without dead ends: 599 [2019-11-15 23:51:40,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-11-15 23:51:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 587. [2019-11-15 23:51:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-15 23:51:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 755 transitions. [2019-11-15 23:51:40,395 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 755 transitions. Word has length 33 [2019-11-15 23:51:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:40,395 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 755 transitions. [2019-11-15 23:51:40,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 755 transitions. [2019-11-15 23:51:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:51:40,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:40,397 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:40,401 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1819353560, now seen corresponding path program 1 times [2019-11-15 23:51:40,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:40,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838356691] [2019-11-15 23:51:40,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:40,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:40,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:40,529 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-15 23:51:40,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838356691] [2019-11-15 23:51:40,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:40,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:51:40,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089489148] [2019-11-15 23:51:40,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:51:40,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:51:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:51:40,531 INFO L87 Difference]: Start difference. First operand 587 states and 755 transitions. Second operand 10 states. [2019-11-15 23:51:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:41,528 INFO L93 Difference]: Finished difference Result 668 states and 849 transitions. [2019-11-15 23:51:41,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:51:41,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-15 23:51:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:41,532 INFO L225 Difference]: With dead ends: 668 [2019-11-15 23:51:41,532 INFO L226 Difference]: Without dead ends: 652 [2019-11-15 23:51:41,532 INFO L600 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-15 23:51:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-11-15 23:51:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 589. [2019-11-15 23:51:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-11-15 23:51:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 757 transitions. [2019-11-15 23:51:41,578 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 757 transitions. Word has length 33 [2019-11-15 23:51:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:41,578 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 757 transitions. [2019-11-15 23:51:41,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:51:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 757 transitions. [2019-11-15 23:51:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:51:41,580 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:41,580 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:41,580 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -471627368, now seen corresponding path program 1 times [2019-11-15 23:51:41,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:41,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454469109] [2019-11-15 23:51:41,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:41,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:41,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:41,629 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-15 23:51:41,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454469109] [2019-11-15 23:51:41,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:41,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:41,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127534439] [2019-11-15 23:51:41,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:41,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:41,631 INFO L87 Difference]: Start difference. First operand 589 states and 757 transitions. Second operand 5 states. [2019-11-15 23:51:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:41,925 INFO L93 Difference]: Finished difference Result 599 states and 766 transitions. [2019-11-15 23:51:41,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:51:41,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-15 23:51:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:41,929 INFO L225 Difference]: With dead ends: 599 [2019-11-15 23:51:41,929 INFO L226 Difference]: Without dead ends: 583 [2019-11-15 23:51:41,931 INFO L600 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-15 23:51:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-11-15 23:51:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 578. [2019-11-15 23:51:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-15 23:51:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 743 transitions. [2019-11-15 23:51:41,974 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 743 transitions. Word has length 33 [2019-11-15 23:51:41,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:41,975 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 743 transitions. [2019-11-15 23:51:41,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 743 transitions. [2019-11-15 23:51:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:51:41,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:41,976 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:41,977 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash -935653763, now seen corresponding path program 1 times [2019-11-15 23:51:41,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:41,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605815846] [2019-11-15 23:51:41,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:41,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:41,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:51:42,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605815846] [2019-11-15 23:51:42,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:42,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:51:42,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543947345] [2019-11-15 23:51:42,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:51:42,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:51:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:51:42,067 INFO L87 Difference]: Start difference. First operand 578 states and 743 transitions. Second operand 9 states. [2019-11-15 23:51:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:42,927 INFO L93 Difference]: Finished difference Result 947 states and 1209 transitions. [2019-11-15 23:51:42,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:51:42,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-15 23:51:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:42,931 INFO L225 Difference]: With dead ends: 947 [2019-11-15 23:51:42,931 INFO L226 Difference]: Without dead ends: 924 [2019-11-15 23:51:42,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:51:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-11-15 23:51:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 576. [2019-11-15 23:51:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-11-15 23:51:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 739 transitions. [2019-11-15 23:51:42,979 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 739 transitions. Word has length 35 [2019-11-15 23:51:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:42,979 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 739 transitions. [2019-11-15 23:51:42,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:51:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 739 transitions. [2019-11-15 23:51:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:51:42,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:42,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:42,981 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash 749897277, now seen corresponding path program 1 times [2019-11-15 23:51:42,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:42,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013456542] [2019-11-15 23:51:42,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:42,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:42,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:43,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-15 23:51:43,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013456542] [2019-11-15 23:51:43,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:43,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:43,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620686742] [2019-11-15 23:51:43,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:43,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:43,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:43,017 INFO L87 Difference]: Start difference. First operand 576 states and 739 transitions. Second operand 4 states. [2019-11-15 23:51:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:43,183 INFO L93 Difference]: Finished difference Result 637 states and 818 transitions. [2019-11-15 23:51:43,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:43,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:51:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:43,186 INFO L225 Difference]: With dead ends: 637 [2019-11-15 23:51:43,186 INFO L226 Difference]: Without dead ends: 598 [2019-11-15 23:51:43,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-15 23:51:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 542. [2019-11-15 23:51:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-15 23:51:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 701 transitions. [2019-11-15 23:51:43,230 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 701 transitions. Word has length 35 [2019-11-15 23:51:43,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:43,231 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 701 transitions. [2019-11-15 23:51:43,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 701 transitions. [2019-11-15 23:51:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:51:43,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:43,233 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:43,233 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:43,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:43,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2019-11-15 23:51:43,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:43,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746083188] [2019-11-15 23:51:43,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:43,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:43,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:43,270 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-15 23:51:43,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746083188] [2019-11-15 23:51:43,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:43,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:43,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067976896] [2019-11-15 23:51:43,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:43,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:43,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:43,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:43,272 INFO L87 Difference]: Start difference. First operand 542 states and 701 transitions. Second operand 5 states. [2019-11-15 23:51:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:43,548 INFO L93 Difference]: Finished difference Result 1248 states and 1619 transitions. [2019-11-15 23:51:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:43,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-15 23:51:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:43,552 INFO L225 Difference]: With dead ends: 1248 [2019-11-15 23:51:43,552 INFO L226 Difference]: Without dead ends: 1062 [2019-11-15 23:51:43,553 INFO L600 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-15 23:51:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-15 23:51:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 549. [2019-11-15 23:51:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-11-15 23:51:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 708 transitions. [2019-11-15 23:51:43,592 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 708 transitions. Word has length 35 [2019-11-15 23:51:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:43,593 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 708 transitions. [2019-11-15 23:51:43,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 708 transitions. [2019-11-15 23:51:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:51:43,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:43,594 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:43,595 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2019-11-15 23:51:43,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:43,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222044130] [2019-11-15 23:51:43,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:43,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:43,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:43,627 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-15 23:51:43,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222044130] [2019-11-15 23:51:43,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:43,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:43,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213248771] [2019-11-15 23:51:43,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:43,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:43,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:43,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:43,629 INFO L87 Difference]: Start difference. First operand 549 states and 708 transitions. Second operand 3 states. [2019-11-15 23:51:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:43,695 INFO L93 Difference]: Finished difference Result 809 states and 1043 transitions. [2019-11-15 23:51:43,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:43,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:51:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:43,698 INFO L225 Difference]: With dead ends: 809 [2019-11-15 23:51:43,698 INFO L226 Difference]: Without dead ends: 610 [2019-11-15 23:51:43,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-15 23:51:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 537. [2019-11-15 23:51:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-15 23:51:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 690 transitions. [2019-11-15 23:51:43,746 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 690 transitions. Word has length 36 [2019-11-15 23:51:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:43,746 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 690 transitions. [2019-11-15 23:51:43,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 690 transitions. [2019-11-15 23:51:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:51:43,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:43,748 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:43,748 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:43,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1515814519, now seen corresponding path program 1 times [2019-11-15 23:51:43,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:43,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785667203] [2019-11-15 23:51:43,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:43,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:43,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:43,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-15 23:51:43,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785667203] [2019-11-15 23:51:43,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:43,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:43,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266129746] [2019-11-15 23:51:43,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:43,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:43,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:43,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:43,779 INFO L87 Difference]: Start difference. First operand 537 states and 690 transitions. Second operand 5 states. [2019-11-15 23:51:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:43,869 INFO L93 Difference]: Finished difference Result 553 states and 706 transitions. [2019-11-15 23:51:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:51:43,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-15 23:51:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:43,872 INFO L225 Difference]: With dead ends: 553 [2019-11-15 23:51:43,872 INFO L226 Difference]: Without dead ends: 536 [2019-11-15 23:51:43,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-15 23:51:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-11-15 23:51:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-15 23:51:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 688 transitions. [2019-11-15 23:51:43,918 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 688 transitions. Word has length 37 [2019-11-15 23:51:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:43,918 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 688 transitions. [2019-11-15 23:51:43,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 688 transitions. [2019-11-15 23:51:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:51:43,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:43,920 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:43,920 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash -604803074, now seen corresponding path program 1 times [2019-11-15 23:51:43,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:43,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473056030] [2019-11-15 23:51:43,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:43,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:43,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:43,957 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-15 23:51:43,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473056030] [2019-11-15 23:51:43,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:43,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:51:43,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646991342] [2019-11-15 23:51:43,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:51:43,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:43,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:51:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:43,958 INFO L87 Difference]: Start difference. First operand 536 states and 688 transitions. Second operand 6 states. [2019-11-15 23:51:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:44,212 INFO L93 Difference]: Finished difference Result 564 states and 714 transitions. [2019-11-15 23:51:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:44,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-15 23:51:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:44,215 INFO L225 Difference]: With dead ends: 564 [2019-11-15 23:51:44,215 INFO L226 Difference]: Without dead ends: 530 [2019-11-15 23:51:44,216 INFO L600 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-15 23:51:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-15 23:51:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 520. [2019-11-15 23:51:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-11-15 23:51:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 668 transitions. [2019-11-15 23:51:44,259 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 668 transitions. Word has length 37 [2019-11-15 23:51:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:44,260 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 668 transitions. [2019-11-15 23:51:44,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:51:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 668 transitions. [2019-11-15 23:51:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:51:44,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:44,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:44,262 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:44,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:44,262 INFO L82 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2019-11-15 23:51:44,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:44,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304689025] [2019-11-15 23:51:44,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:44,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:44,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:44,389 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-15 23:51:44,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304689025] [2019-11-15 23:51:44,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:44,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:44,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946800277] [2019-11-15 23:51:44,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:44,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:44,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:44,390 INFO L87 Difference]: Start difference. First operand 520 states and 668 transitions. Second operand 4 states. [2019-11-15 23:51:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:44,506 INFO L93 Difference]: Finished difference Result 709 states and 910 transitions. [2019-11-15 23:51:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:44,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 23:51:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:44,518 INFO L225 Difference]: With dead ends: 709 [2019-11-15 23:51:44,518 INFO L226 Difference]: Without dead ends: 490 [2019-11-15 23:51:44,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-15 23:51:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 485. [2019-11-15 23:51:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-15 23:51:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 617 transitions. [2019-11-15 23:51:44,570 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 617 transitions. Word has length 37 [2019-11-15 23:51:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:44,570 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 617 transitions. [2019-11-15 23:51:44,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 617 transitions. [2019-11-15 23:51:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:51:44,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:44,572 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:44,572 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2019-11-15 23:51:44,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:44,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89896886] [2019-11-15 23:51:44,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:44,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:44,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:44,608 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-15 23:51:44,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89896886] [2019-11-15 23:51:44,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:44,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:44,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966761022] [2019-11-15 23:51:44,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:44,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:44,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:44,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:44,609 INFO L87 Difference]: Start difference. First operand 485 states and 617 transitions. Second operand 4 states. [2019-11-15 23:51:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:44,786 INFO L93 Difference]: Finished difference Result 666 states and 850 transitions. [2019-11-15 23:51:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:44,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 23:51:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:44,795 INFO L225 Difference]: With dead ends: 666 [2019-11-15 23:51:44,795 INFO L226 Difference]: Without dead ends: 482 [2019-11-15 23:51:44,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-15 23:51:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-11-15 23:51:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-11-15 23:51:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 608 transitions. [2019-11-15 23:51:44,851 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 608 transitions. Word has length 38 [2019-11-15 23:51:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:44,852 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 608 transitions. [2019-11-15 23:51:44,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 608 transitions. [2019-11-15 23:51:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:51:44,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:44,853 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:44,853 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:44,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash -147578755, now seen corresponding path program 1 times [2019-11-15 23:51:44,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:44,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659563501] [2019-11-15 23:51:44,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:44,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:44,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:44,882 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-15 23:51:44,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659563501] [2019-11-15 23:51:44,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:44,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:44,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495143735] [2019-11-15 23:51:44,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:44,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:44,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:44,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:44,883 INFO L87 Difference]: Start difference. First operand 482 states and 608 transitions. Second operand 3 states. [2019-11-15 23:51:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:45,047 INFO L93 Difference]: Finished difference Result 843 states and 1061 transitions. [2019-11-15 23:51:45,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:45,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-15 23:51:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:45,050 INFO L225 Difference]: With dead ends: 843 [2019-11-15 23:51:45,050 INFO L226 Difference]: Without dead ends: 662 [2019-11-15 23:51:45,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-15 23:51:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 485. [2019-11-15 23:51:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-15 23:51:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 611 transitions. [2019-11-15 23:51:45,111 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 611 transitions. Word has length 41 [2019-11-15 23:51:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:45,111 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 611 transitions. [2019-11-15 23:51:45,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 611 transitions. [2019-11-15 23:51:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:51:45,112 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:45,113 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:45,114 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:45,115 INFO L82 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2019-11-15 23:51:45,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:45,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676717401] [2019-11-15 23:51:45,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:45,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:45,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:45,195 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-15 23:51:45,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676717401] [2019-11-15 23:51:45,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:45,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:45,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691446208] [2019-11-15 23:51:45,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:45,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:45,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:45,196 INFO L87 Difference]: Start difference. First operand 485 states and 611 transitions. Second operand 5 states. [2019-11-15 23:51:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:45,472 INFO L93 Difference]: Finished difference Result 828 states and 1031 transitions. [2019-11-15 23:51:45,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:51:45,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-15 23:51:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:45,474 INFO L225 Difference]: With dead ends: 828 [2019-11-15 23:51:45,475 INFO L226 Difference]: Without dead ends: 672 [2019-11-15 23:51:45,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-15 23:51:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 485. [2019-11-15 23:51:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-15 23:51:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 607 transitions. [2019-11-15 23:51:45,548 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 607 transitions. Word has length 41 [2019-11-15 23:51:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:45,548 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 607 transitions. [2019-11-15 23:51:45,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 607 transitions. [2019-11-15 23:51:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:51:45,549 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:45,550 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:45,550 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2019-11-15 23:51:45,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:45,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866905973] [2019-11-15 23:51:45,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:45,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:45,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:45,587 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-15 23:51:45,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866905973] [2019-11-15 23:51:45,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:45,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:45,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071636778] [2019-11-15 23:51:45,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:45,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:45,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:45,588 INFO L87 Difference]: Start difference. First operand 485 states and 607 transitions. Second operand 4 states. [2019-11-15 23:51:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:45,708 INFO L93 Difference]: Finished difference Result 657 states and 807 transitions. [2019-11-15 23:51:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:45,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 23:51:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:45,710 INFO L225 Difference]: With dead ends: 657 [2019-11-15 23:51:45,710 INFO L226 Difference]: Without dead ends: 580 [2019-11-15 23:51:45,710 INFO L600 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-15 23:51:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-15 23:51:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 489. [2019-11-15 23:51:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-11-15 23:51:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 611 transitions. [2019-11-15 23:51:45,784 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 611 transitions. Word has length 42 [2019-11-15 23:51:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:45,785 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 611 transitions. [2019-11-15 23:51:45,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 611 transitions. [2019-11-15 23:51:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:51:45,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:45,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:45,787 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:45,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:45,787 INFO L82 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2019-11-15 23:51:45,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:45,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227017772] [2019-11-15 23:51:45,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:45,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:45,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:45,882 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-15 23:51:45,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227017772] [2019-11-15 23:51:45,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:45,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:51:45,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729246892] [2019-11-15 23:51:45,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:51:45,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:45,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:51:45,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:45,884 INFO L87 Difference]: Start difference. First operand 489 states and 611 transitions. Second operand 7 states. [2019-11-15 23:51:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:46,051 INFO L93 Difference]: Finished difference Result 635 states and 779 transitions. [2019-11-15 23:51:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:46,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-15 23:51:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:46,053 INFO L225 Difference]: With dead ends: 635 [2019-11-15 23:51:46,053 INFO L226 Difference]: Without dead ends: 536 [2019-11-15 23:51:46,054 INFO L600 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-15 23:51:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-15 23:51:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 484. [2019-11-15 23:51:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-15 23:51:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 602 transitions. [2019-11-15 23:51:46,112 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 602 transitions. Word has length 42 [2019-11-15 23:51:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:46,113 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 602 transitions. [2019-11-15 23:51:46,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:51:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 602 transitions. [2019-11-15 23:51:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:51:46,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:46,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:46,115 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:46,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:46,115 INFO L82 PathProgramCache]: Analyzing trace with hash -823105571, now seen corresponding path program 1 times [2019-11-15 23:51:46,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:46,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274658439] [2019-11-15 23:51:46,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:46,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:46,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:46,165 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-15 23:51:46,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274658439] [2019-11-15 23:51:46,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:46,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:51:46,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126362309] [2019-11-15 23:51:46,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:51:46,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:46,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:51:46,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:46,166 INFO L87 Difference]: Start difference. First operand 484 states and 602 transitions. Second operand 7 states. [2019-11-15 23:51:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:46,440 INFO L93 Difference]: Finished difference Result 512 states and 628 transitions. [2019-11-15 23:51:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:51:46,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-15 23:51:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:46,441 INFO L225 Difference]: With dead ends: 512 [2019-11-15 23:51:46,441 INFO L226 Difference]: Without dead ends: 346 [2019-11-15 23:51:46,442 INFO L600 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-15 23:51:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-15 23:51:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2019-11-15 23:51:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-15 23:51:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 399 transitions. [2019-11-15 23:51:46,480 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 399 transitions. Word has length 42 [2019-11-15 23:51:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:46,482 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 399 transitions. [2019-11-15 23:51:46,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:51:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 399 transitions. [2019-11-15 23:51:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:51:46,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:46,483 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:46,483 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:46,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:46,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2019-11-15 23:51:46,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:46,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851402722] [2019-11-15 23:51:46,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:46,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:46,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:46,546 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-15 23:51:46,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851402722] [2019-11-15 23:51:46,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:46,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:46,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137036311] [2019-11-15 23:51:46,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:46,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:46,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:46,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:46,547 INFO L87 Difference]: Start difference. First operand 323 states and 399 transitions. Second operand 5 states. [2019-11-15 23:51:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:46,725 INFO L93 Difference]: Finished difference Result 707 states and 889 transitions. [2019-11-15 23:51:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:46,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 23:51:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:46,727 INFO L225 Difference]: With dead ends: 707 [2019-11-15 23:51:46,727 INFO L226 Difference]: Without dead ends: 577 [2019-11-15 23:51:46,728 INFO L600 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-15 23:51:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-15 23:51:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 323. [2019-11-15 23:51:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-15 23:51:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 398 transitions. [2019-11-15 23:51:46,768 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 398 transitions. Word has length 44 [2019-11-15 23:51:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:46,768 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 398 transitions. [2019-11-15 23:51:46,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 398 transitions. [2019-11-15 23:51:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:51:46,769 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:46,769 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:46,769 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:46,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:46,770 INFO L82 PathProgramCache]: Analyzing trace with hash -702658274, now seen corresponding path program 1 times [2019-11-15 23:51:46,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:46,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062322778] [2019-11-15 23:51:46,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:46,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:46,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:46,806 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-15 23:51:46,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062322778] [2019-11-15 23:51:46,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:46,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:46,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426555536] [2019-11-15 23:51:46,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:46,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:46,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:46,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:46,807 INFO L87 Difference]: Start difference. First operand 323 states and 398 transitions. Second operand 4 states. [2019-11-15 23:51:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:46,864 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2019-11-15 23:51:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:46,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-15 23:51:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:46,865 INFO L225 Difference]: With dead ends: 355 [2019-11-15 23:51:46,866 INFO L226 Difference]: Without dead ends: 322 [2019-11-15 23:51:46,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-15 23:51:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-11-15 23:51:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-15 23:51:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 396 transitions. [2019-11-15 23:51:46,911 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 396 transitions. Word has length 47 [2019-11-15 23:51:46,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:46,912 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 396 transitions. [2019-11-15 23:51:46,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 396 transitions. [2019-11-15 23:51:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:51:46,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:46,913 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:46,913 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:46,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1085716830, now seen corresponding path program 1 times [2019-11-15 23:51:46,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:46,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148683694] [2019-11-15 23:51:46,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:46,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:46,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:46,973 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-15 23:51:46,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148683694] [2019-11-15 23:51:46,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:46,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:51:46,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841779849] [2019-11-15 23:51:46,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:51:46,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:46,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:51:46,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:46,974 INFO L87 Difference]: Start difference. First operand 322 states and 396 transitions. Second operand 7 states. [2019-11-15 23:51:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:47,067 INFO L93 Difference]: Finished difference Result 327 states and 400 transitions. [2019-11-15 23:51:47,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:47,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-15 23:51:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:47,068 INFO L225 Difference]: With dead ends: 327 [2019-11-15 23:51:47,069 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 23:51:47,069 INFO L600 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-15 23:51:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 23:51:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-11-15 23:51:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-15 23:51:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 321 transitions. [2019-11-15 23:51:47,102 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 321 transitions. Word has length 47 [2019-11-15 23:51:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:47,103 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 321 transitions. [2019-11-15 23:51:47,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:51:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 321 transitions. [2019-11-15 23:51:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:51:47,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:47,104 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:47,104 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2019-11-15 23:51:47,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:47,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125771302] [2019-11-15 23:51:47,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:47,128 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-15 23:51:47,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125771302] [2019-11-15 23:51:47,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:47,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:47,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079698340] [2019-11-15 23:51:47,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:51:47,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:47,129 INFO L87 Difference]: Start difference. First operand 261 states and 321 transitions. Second operand 3 states. [2019-11-15 23:51:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:47,210 INFO L93 Difference]: Finished difference Result 394 states and 491 transitions. [2019-11-15 23:51:47,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:47,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 23:51:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:47,212 INFO L225 Difference]: With dead ends: 394 [2019-11-15 23:51:47,212 INFO L226 Difference]: Without dead ends: 223 [2019-11-15 23:51:47,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-15 23:51:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-11-15 23:51:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 23:51:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2019-11-15 23:51:47,240 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 48 [2019-11-15 23:51:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:47,240 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2019-11-15 23:51:47,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2019-11-15 23:51:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:51:47,241 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:47,242 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:47,242 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:47,242 INFO L82 PathProgramCache]: Analyzing trace with hash -624507704, now seen corresponding path program 1 times [2019-11-15 23:51:47,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:47,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581919569] [2019-11-15 23:51:47,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:47,297 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-15 23:51:47,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581919569] [2019-11-15 23:51:47,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:47,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:51:47,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660796905] [2019-11-15 23:51:47,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:51:47,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:51:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:47,298 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 7 states. [2019-11-15 23:51:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:47,489 INFO L93 Difference]: Finished difference Result 313 states and 380 transitions. [2019-11-15 23:51:47,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:51:47,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 23:51:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:47,491 INFO L225 Difference]: With dead ends: 313 [2019-11-15 23:51:47,491 INFO L226 Difference]: Without dead ends: 295 [2019-11-15 23:51:47,492 INFO L600 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-15 23:51:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-15 23:51:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 223. [2019-11-15 23:51:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 23:51:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 271 transitions. [2019-11-15 23:51:47,523 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 271 transitions. Word has length 54 [2019-11-15 23:51:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:47,523 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 271 transitions. [2019-11-15 23:51:47,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:51:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 271 transitions. [2019-11-15 23:51:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:51:47,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:47,524 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:47,524 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2071877734, now seen corresponding path program 1 times [2019-11-15 23:51:47,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:47,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537704101] [2019-11-15 23:51:47,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:47,604 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-15 23:51:47,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537704101] [2019-11-15 23:51:47,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:47,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:51:47,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115053075] [2019-11-15 23:51:47,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:51:47,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:51:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:51:47,606 INFO L87 Difference]: Start difference. First operand 223 states and 271 transitions. Second operand 8 states. [2019-11-15 23:51:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:47,762 INFO L93 Difference]: Finished difference Result 289 states and 351 transitions. [2019-11-15 23:51:47,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:51:47,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-11-15 23:51:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:47,763 INFO L225 Difference]: With dead ends: 289 [2019-11-15 23:51:47,763 INFO L226 Difference]: Without dead ends: 223 [2019-11-15 23:51:47,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:51:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-15 23:51:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-11-15 23:51:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 23:51:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 270 transitions. [2019-11-15 23:51:47,801 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 270 transitions. Word has length 59 [2019-11-15 23:51:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:47,801 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 270 transitions. [2019-11-15 23:51:47,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:51:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 270 transitions. [2019-11-15 23:51:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:51:47,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:47,803 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:47,803 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash -121361867, now seen corresponding path program 1 times [2019-11-15 23:51:47,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:47,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68762326] [2019-11-15 23:51:47,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:47,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-15 23:51:47,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68762326] [2019-11-15 23:51:47,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:47,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:47,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270948201] [2019-11-15 23:51:47,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:47,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:47,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:47,853 INFO L87 Difference]: Start difference. First operand 223 states and 270 transitions. Second operand 5 states. [2019-11-15 23:51:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:47,969 INFO L93 Difference]: Finished difference Result 378 states and 455 transitions. [2019-11-15 23:51:47,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:51:47,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-15 23:51:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:47,970 INFO L225 Difference]: With dead ends: 378 [2019-11-15 23:51:47,970 INFO L226 Difference]: Without dead ends: 327 [2019-11-15 23:51:47,971 INFO L600 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-15 23:51:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-15 23:51:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 190. [2019-11-15 23:51:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-15 23:51:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2019-11-15 23:51:47,996 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 59 [2019-11-15 23:51:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:47,997 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2019-11-15 23:51:47,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2019-11-15 23:51:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:51:47,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:47,998 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:47,998 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1291714983, now seen corresponding path program 1 times [2019-11-15 23:51:47,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:47,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215636718] [2019-11-15 23:51:47,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:47,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:48,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:48,037 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-15 23:51:48,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215636718] [2019-11-15 23:51:48,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:48,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:48,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311154360] [2019-11-15 23:51:48,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:48,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:48,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:48,038 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand 5 states. [2019-11-15 23:51:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:48,136 INFO L93 Difference]: Finished difference Result 278 states and 328 transitions. [2019-11-15 23:51:48,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:51:48,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-15 23:51:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:48,138 INFO L225 Difference]: With dead ends: 278 [2019-11-15 23:51:48,138 INFO L226 Difference]: Without dead ends: 244 [2019-11-15 23:51:48,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-15 23:51:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 179. [2019-11-15 23:51:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 23:51:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 209 transitions. [2019-11-15 23:51:48,164 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 209 transitions. Word has length 60 [2019-11-15 23:51:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:48,164 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 209 transitions. [2019-11-15 23:51:48,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2019-11-15 23:51:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:51:48,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:48,165 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:48,166 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1525268266, now seen corresponding path program 1 times [2019-11-15 23:51:48,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:48,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358570858] [2019-11-15 23:51:48,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:48,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:48,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:48,222 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-15 23:51:48,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358570858] [2019-11-15 23:51:48,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:48,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:51:48,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906340292] [2019-11-15 23:51:48,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:51:48,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:51:48,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:48,224 INFO L87 Difference]: Start difference. First operand 179 states and 209 transitions. Second operand 6 states. [2019-11-15 23:51:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:48,354 INFO L93 Difference]: Finished difference Result 324 states and 382 transitions. [2019-11-15 23:51:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:51:48,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 23:51:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:48,356 INFO L225 Difference]: With dead ends: 324 [2019-11-15 23:51:48,356 INFO L226 Difference]: Without dead ends: 269 [2019-11-15 23:51:48,357 INFO L600 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-15 23:51:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-15 23:51:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 146. [2019-11-15 23:51:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:51:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 172 transitions. [2019-11-15 23:51:48,380 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 172 transitions. Word has length 61 [2019-11-15 23:51:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:48,380 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 172 transitions. [2019-11-15 23:51:48,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:51:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 172 transitions. [2019-11-15 23:51:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:51:48,381 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:48,381 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:48,382 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:48,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1218638889, now seen corresponding path program 1 times [2019-11-15 23:51:48,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:48,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261743153] [2019-11-15 23:51:48,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:48,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:48,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:48,449 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-15 23:51:48,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261743153] [2019-11-15 23:51:48,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:48,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:51:48,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126370994] [2019-11-15 23:51:48,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:51:48,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:48,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:51:48,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:48,450 INFO L87 Difference]: Start difference. First operand 146 states and 172 transitions. Second operand 7 states. [2019-11-15 23:51:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:48,673 INFO L93 Difference]: Finished difference Result 376 states and 447 transitions. [2019-11-15 23:51:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:51:48,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-15 23:51:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:48,675 INFO L225 Difference]: With dead ends: 376 [2019-11-15 23:51:48,675 INFO L226 Difference]: Without dead ends: 356 [2019-11-15 23:51:48,675 INFO L600 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-15 23:51:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-15 23:51:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 162. [2019-11-15 23:51:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-15 23:51:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2019-11-15 23:51:48,699 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 74 [2019-11-15 23:51:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:48,699 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2019-11-15 23:51:48,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:51:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2019-11-15 23:51:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:51:48,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:48,701 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:48,701 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1172490426, now seen corresponding path program 1 times [2019-11-15 23:51:48,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:48,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810065444] [2019-11-15 23:51:48,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:48,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:48,819 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-15 23:51:48,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810065444] [2019-11-15 23:51:48,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:48,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:51:48,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724074573] [2019-11-15 23:51:48,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:51:48,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:51:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:51:48,821 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand 11 states. [2019-11-15 23:51:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:49,234 INFO L93 Difference]: Finished difference Result 358 states and 429 transitions. [2019-11-15 23:51:49,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:51:49,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-11-15 23:51:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:49,236 INFO L225 Difference]: With dead ends: 358 [2019-11-15 23:51:49,236 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 23:51:49,236 INFO L600 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-15 23:51:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 23:51:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 162. [2019-11-15 23:51:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-15 23:51:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-11-15 23:51:49,263 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 75 [2019-11-15 23:51:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:49,264 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-11-15 23:51:49,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:51:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-11-15 23:51:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 23:51:49,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:49,265 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:49,265 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:49,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:49,266 INFO L82 PathProgramCache]: Analyzing trace with hash 645027120, now seen corresponding path program 1 times [2019-11-15 23:51:49,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:49,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017071592] [2019-11-15 23:51:49,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:49,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:49,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:49,310 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-15 23:51:49,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017071592] [2019-11-15 23:51:49,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:49,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:49,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934276556] [2019-11-15 23:51:49,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:49,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:49,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:49,311 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 4 states. [2019-11-15 23:51:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:49,378 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2019-11-15 23:51:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:49,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 23:51:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:49,379 INFO L225 Difference]: With dead ends: 215 [2019-11-15 23:51:49,380 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 23:51:49,380 INFO L600 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-15 23:51:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 23:51:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 162. [2019-11-15 23:51:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-15 23:51:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-11-15 23:51:49,408 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 79 [2019-11-15 23:51:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:49,408 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-11-15 23:51:49,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-11-15 23:51:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 23:51:49,409 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:49,409 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:49,410 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:49,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:49,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1091776138, now seen corresponding path program 1 times [2019-11-15 23:51:49,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:49,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142849062] [2019-11-15 23:51:49,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:49,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:49,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:49,468 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-15 23:51:49,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142849062] [2019-11-15 23:51:49,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:49,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:51:49,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613653439] [2019-11-15 23:51:49,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:51:49,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:49,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:51:49,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:49,470 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 6 states. [2019-11-15 23:51:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:49,596 INFO L93 Difference]: Finished difference Result 277 states and 333 transitions. [2019-11-15 23:51:49,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:51:49,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-11-15 23:51:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:49,597 INFO L225 Difference]: With dead ends: 277 [2019-11-15 23:51:49,598 INFO L226 Difference]: Without dead ends: 212 [2019-11-15 23:51:49,598 INFO L600 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-15 23:51:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-15 23:51:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 152. [2019-11-15 23:51:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 23:51:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2019-11-15 23:51:49,625 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 80 [2019-11-15 23:51:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:49,625 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2019-11-15 23:51:49,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:51:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2019-11-15 23:51:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:51:49,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:49,626 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:49,626 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:49,627 INFO L82 PathProgramCache]: Analyzing trace with hash -839306980, now seen corresponding path program 1 times [2019-11-15 23:51:49,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:49,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422150526] [2019-11-15 23:51:49,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:49,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:49,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:49,728 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-15 23:51:49,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422150526] [2019-11-15 23:51:49,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:49,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:51:49,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186317760] [2019-11-15 23:51:49,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:51:49,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:49,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:51:49,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:51:49,730 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand 10 states. [2019-11-15 23:51:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:50,029 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2019-11-15 23:51:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:51:50,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-11-15 23:51:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:50,031 INFO L225 Difference]: With dead ends: 381 [2019-11-15 23:51:50,031 INFO L226 Difference]: Without dead ends: 281 [2019-11-15 23:51:50,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:51:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-15 23:51:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 219. [2019-11-15 23:51:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-15 23:51:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2019-11-15 23:51:50,066 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 81 [2019-11-15 23:51:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:50,067 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2019-11-15 23:51:50,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:51:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2019-11-15 23:51:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:51:50,068 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:50,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:50,068 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -273318, now seen corresponding path program 1 times [2019-11-15 23:51:50,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:50,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723328592] [2019-11-15 23:51:50,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:50,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:50,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:50,137 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-15 23:51:50,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723328592] [2019-11-15 23:51:50,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:50,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:51:50,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326121596] [2019-11-15 23:51:50,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:51:50,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:51:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:50,139 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand 6 states. [2019-11-15 23:51:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:50,343 INFO L93 Difference]: Finished difference Result 400 states and 466 transitions. [2019-11-15 23:51:50,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:51:50,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-15 23:51:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:50,344 INFO L225 Difference]: With dead ends: 400 [2019-11-15 23:51:50,344 INFO L226 Difference]: Without dead ends: 380 [2019-11-15 23:51:50,346 INFO L600 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-15 23:51:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-15 23:51:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2019-11-15 23:51:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-15 23:51:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2019-11-15 23:51:50,390 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 81 [2019-11-15 23:51:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:50,391 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2019-11-15 23:51:50,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:51:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2019-11-15 23:51:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:51:50,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:50,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:50,393 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash 288160049, now seen corresponding path program 1 times [2019-11-15 23:51:50,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:50,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327969938] [2019-11-15 23:51:50,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:50,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:50,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:50,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-15 23:51:50,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327969938] [2019-11-15 23:51:50,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:50,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:51:50,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702723771] [2019-11-15 23:51:50,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:50,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:50,449 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand 5 states. [2019-11-15 23:51:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:50,552 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2019-11-15 23:51:50,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:51:50,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-11-15 23:51:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:50,554 INFO L225 Difference]: With dead ends: 314 [2019-11-15 23:51:50,554 INFO L226 Difference]: Without dead ends: 274 [2019-11-15 23:51:50,554 INFO L600 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-15 23:51:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-15 23:51:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 214. [2019-11-15 23:51:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-15 23:51:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 244 transitions. [2019-11-15 23:51:50,591 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 244 transitions. Word has length 84 [2019-11-15 23:51:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:50,591 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 244 transitions. [2019-11-15 23:51:50,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 244 transitions. [2019-11-15 23:51:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 23:51:50,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:50,592 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:50,593 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1873856217, now seen corresponding path program 1 times [2019-11-15 23:51:50,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:50,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257683804] [2019-11-15 23:51:50,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:50,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:50,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:50,639 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-15 23:51:50,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257683804] [2019-11-15 23:51:50,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:50,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:51:50,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310361709] [2019-11-15 23:51:50,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:51:50,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:51:50,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:51:50,641 INFO L87 Difference]: Start difference. First operand 214 states and 244 transitions. Second operand 4 states. [2019-11-15 23:51:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:50,697 INFO L93 Difference]: Finished difference Result 262 states and 294 transitions. [2019-11-15 23:51:50,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:51:50,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 23:51:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:50,698 INFO L225 Difference]: With dead ends: 262 [2019-11-15 23:51:50,698 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 23:51:50,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 23:51:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2019-11-15 23:51:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-15 23:51:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 246 transitions. [2019-11-15 23:51:50,734 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 246 transitions. Word has length 86 [2019-11-15 23:51:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:50,734 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 246 transitions. [2019-11-15 23:51:50,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:51:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2019-11-15 23:51:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 23:51:50,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:50,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:50,736 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash 481659239, now seen corresponding path program 1 times [2019-11-15 23:51:50,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:50,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83158010] [2019-11-15 23:51:50,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:50,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:50,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:50,839 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-15 23:51:50,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83158010] [2019-11-15 23:51:50,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:50,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:51:50,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769928528] [2019-11-15 23:51:50,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:51:50,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:51:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:51:50,841 INFO L87 Difference]: Start difference. First operand 216 states and 246 transitions. Second operand 9 states. [2019-11-15 23:51:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:51,260 INFO L93 Difference]: Finished difference Result 426 states and 492 transitions. [2019-11-15 23:51:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:51:51,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-11-15 23:51:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:51,261 INFO L225 Difference]: With dead ends: 426 [2019-11-15 23:51:51,261 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 23:51:51,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:51:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 23:51:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 213. [2019-11-15 23:51:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-15 23:51:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 239 transitions. [2019-11-15 23:51:51,294 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 239 transitions. Word has length 86 [2019-11-15 23:51:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:51,294 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 239 transitions. [2019-11-15 23:51:51,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:51:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2019-11-15 23:51:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:51:51,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:51,296 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:51,296 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1016683280, now seen corresponding path program 1 times [2019-11-15 23:51:51,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:51,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519601810] [2019-11-15 23:51:51,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:51,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:51,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:51,467 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-15 23:51:51,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519601810] [2019-11-15 23:51:51,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:51,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 23:51:51,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939922154] [2019-11-15 23:51:51,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:51:51,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:51,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:51:51,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:51:51,469 INFO L87 Difference]: Start difference. First operand 213 states and 239 transitions. Second operand 12 states. [2019-11-15 23:51:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:51,846 INFO L93 Difference]: Finished difference Result 392 states and 442 transitions. [2019-11-15 23:51:51,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:51:51,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-11-15 23:51:51,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:51,848 INFO L225 Difference]: With dead ends: 392 [2019-11-15 23:51:51,848 INFO L226 Difference]: Without dead ends: 357 [2019-11-15 23:51:51,848 INFO L600 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-15 23:51:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-15 23:51:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 220. [2019-11-15 23:51:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-15 23:51:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2019-11-15 23:51:51,874 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 87 [2019-11-15 23:51:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:51,874 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2019-11-15 23:51:51,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:51:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2019-11-15 23:51:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:51:51,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:51,875 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:51,875 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash 895193670, now seen corresponding path program 1 times [2019-11-15 23:51:51,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:51,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719934727] [2019-11-15 23:51:51,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:51,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:51,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:51,965 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-15 23:51:51,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719934727] [2019-11-15 23:51:51,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:51,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:51:51,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446370781] [2019-11-15 23:51:51,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:51:51,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:51,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:51:51,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:51:51,966 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 9 states. [2019-11-15 23:51:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:52,294 INFO L93 Difference]: Finished difference Result 321 states and 364 transitions. [2019-11-15 23:51:52,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:51:52,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-11-15 23:51:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:52,295 INFO L225 Difference]: With dead ends: 321 [2019-11-15 23:51:52,295 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 23:51:52,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:51:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 23:51:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2019-11-15 23:51:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 23:51:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2019-11-15 23:51:52,312 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 91 [2019-11-15 23:51:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:52,312 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2019-11-15 23:51:52,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:51:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2019-11-15 23:51:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:51:52,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:52,313 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:52,314 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 116218975, now seen corresponding path program 1 times [2019-11-15 23:51:52,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:52,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593189759] [2019-11-15 23:51:52,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:52,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:52,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:52,437 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-15 23:51:52,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593189759] [2019-11-15 23:51:52,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:52,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 23:51:52,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726733529] [2019-11-15 23:51:52,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:51:52,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:52,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:51:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:51:52,439 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand 12 states. [2019-11-15 23:51:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:52,667 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2019-11-15 23:51:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:51:52,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-11-15 23:51:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:52,668 INFO L225 Difference]: With dead ends: 166 [2019-11-15 23:51:52,668 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:51:52,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:51:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:51:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:51:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:51:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:51:52,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-11-15 23:51:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:52,669 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:51:52,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:51:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:51:52,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:51:52,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:51:52,940 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 155 [2019-11-15 23:51:53,157 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 157 [2019-11-15 23:51:53,483 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-15 23:51:53,852 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 198 [2019-11-15 23:51:54,330 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 155 [2019-11-15 23:51:54,539 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 191 [2019-11-15 23:51:54,741 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 190 [2019-11-15 23:51:54,985 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 180 [2019-11-15 23:51:55,132 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-15 23:51:55,920 WARN L191 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 469 DAG size of output: 442 [2019-11-15 23:51:56,725 WARN L191 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 472 DAG size of output: 403 [2019-11-15 23:51:57,527 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 470 DAG size of output: 446 [2019-11-15 23:51:57,678 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-15 23:51:59,264 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 485 DAG size of output: 451 [2019-11-15 23:51:59,657 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 268 [2019-11-15 23:51:59,774 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 131 [2019-11-15 23:52:00,188 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 158 [2019-11-15 23:52:00,362 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2019-11-15 23:52:00,501 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-11-15 23:52:00,630 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-15 23:52:00,761 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-15 23:52:00,958 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 176 [2019-11-15 23:52:01,226 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 275 [2019-11-15 23:52:01,365 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2019-11-15 23:52:01,500 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-11-15 23:52:01,740 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 185 [2019-11-15 23:52:02,125 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 208 [2019-11-15 23:52:02,513 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-15 23:52:03,158 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-15 23:52:03,769 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-15 23:52:04,083 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-11-15 23:52:04,187 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-15 23:52:04,523 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-11-15 23:52:04,634 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-15 23:52:05,186 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 68 [2019-11-15 23:52:05,774 WARN L191 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-11-15 23:52:05,972 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:52:06,757 WARN L191 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 69 [2019-11-15 23:52:06,995 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-15 23:52:07,264 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-11-15 23:52:07,486 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-15 23:52:07,739 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-15 23:52:07,929 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-15 23:52:08,112 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-15 23:52:08,455 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-15 23:52:09,031 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-15 23:52:10,173 WARN L191 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 92 [2019-11-15 23:52:10,277 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-15 23:52:10,458 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-15 23:52:10,562 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-15 23:52:11,305 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-15 23:52:12,090 WARN L191 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 66 [2019-11-15 23:52:12,326 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-11-15 23:52:12,815 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-11-15 23:52:13,012 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:52:15,838 WARN L191 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 438 DAG size of output: 148 [2019-11-15 23:52:16,039 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-11-15 23:52:16,189 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-15 23:52:18,796 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 393 DAG size of output: 143 [2019-11-15 23:52:22,541 WARN L191 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 440 DAG size of output: 148 [2019-11-15 23:52:23,087 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-11-15 23:52:23,285 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-15 23:52:23,514 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-15 23:52:23,683 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-15 23:52:23,823 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-15 23:52:27,705 WARN L191 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 450 DAG size of output: 148 [2019-11-15 23:52:28,041 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-15 23:52:29,600 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 257 DAG size of output: 102 [2019-11-15 23:52:30,158 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-11-15 23:52:30,647 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 74 [2019-11-15 23:52:30,905 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-11-15 23:52:31,288 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-15 23:52:31,526 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-11-15 23:52:31,734 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-15 23:52:31,926 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-15 23:52:32,113 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-15 23:52:32,333 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-11-15 23:52:32,550 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-11-15 23:52:32,710 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-15 23:52:32,955 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-11-15 23:52:33,537 WARN L191 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-11-15 23:52:34,286 WARN L191 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 91 [2019-11-15 23:52:34,411 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-15 23:52:34,674 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-11-15 23:52:34,876 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-15 23:52:35,362 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2019-11-15 23:52:35,500 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-11-15 23:52:35,735 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-15 23:52:36,362 WARN L191 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 69 [2019-11-15 23:52:37,004 WARN L191 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 61 [2019-11-15 23:52:37,540 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-11-15 23:52:38,056 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-11-15 23:52:38,158 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-11-15 23:52:38,615 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-15 23:52:39,372 WARN L191 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 81 [2019-11-15 23:52:41,223 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 265 DAG size of output: 100 [2019-11-15 23:52:41,817 WARN L191 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 69 [2019-11-15 23:52:42,462 WARN L191 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 61 [2019-11-15 23:52:42,662 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-15 23:52:42,993 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2019-11-15 23:52:43,274 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-11-15 23:52:43,950 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 77 [2019-11-15 23:52:44,130 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-11-15 23:52:44,899 WARN L191 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-11-15 23:52:45,420 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-15 23:52:45,699 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-15 23:52:46,331 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2019-11-15 23:52:46,531 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:52:47,434 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 82 [2019-11-15 23:52:47,783 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-15 23:52:48,014 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-15 23:52:48,203 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-11-15 23:52:48,359 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-11-15 23:52:48,556 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-15 23:52:48,733 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-15 23:52:48,876 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-15 23:52:49,128 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-11-15 23:52:49,483 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-15 23:52:49,814 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-11-15 23:52:50,340 WARN L191 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-15 23:52:50,686 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-15 23:52:51,225 WARN L191 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-11-15 23:52:51,425 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:52:51,438 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1426) no Hoare annotation was computed. [2019-11-15 23:52:51,438 INFO L443 ceAbstractionStarter]: For program point L234-1(lines 227 415) no Hoare annotation was computed. [2019-11-15 23:52:51,439 INFO L439 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-15 23:52:51,439 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,439 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,439 INFO L443 ceAbstractionStarter]: For program point L1295(lines 1295 1309) no Hoare annotation was computed. [2019-11-15 23:52:51,439 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-11-15 23:52:51,439 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 640) no Hoare annotation was computed. [2019-11-15 23:52:51,439 INFO L443 ceAbstractionStarter]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2019-11-15 23:52:51,440 INFO L439 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-15 23:52:51,440 INFO L443 ceAbstractionStarter]: For program point L1296(lines 1296 1302) no Hoare annotation was computed. [2019-11-15 23:52:51,440 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-11-15 23:52:51,440 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-11-15 23:52:51,440 INFO L439 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-15 23:52:51,440 INFO L439 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-15 23:52:51,441 INFO L439 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-15 23:52:51,441 INFO L439 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-15 23:52:51,441 INFO L439 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-15 23:52:51,441 INFO L439 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-15 23:52:51,441 INFO L439 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-15 23:52:51,442 INFO L439 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-15 23:52:51,442 INFO L439 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-15 23:52:51,442 INFO L439 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-15 23:52:51,442 INFO L439 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-15 23:52:51,442 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1436) no Hoare annotation was computed. [2019-11-15 23:52:51,442 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-11-15 23:52:51,442 INFO L439 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-15 23:52:51,442 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 515) no Hoare annotation was computed. [2019-11-15 23:52:51,442 INFO L443 ceAbstractionStarter]: For program point L510-2(lines 510 515) no Hoare annotation was computed. [2019-11-15 23:52:51,442 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L439 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-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 146) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L116-2(lines 108 156) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L116-3(lines 116 146) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041-2(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L116-5(lines 108 156) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041-4(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041-6(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041-8(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041-10(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041-12(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041-14(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1041-16(lines 1041 1047) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 783) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L1572(lines 1572 1576) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-11-15 23:52:51,443 INFO L443 ceAbstractionStarter]: For program point L119-2(lines 119 121) no Hoare annotation was computed. [2019-11-15 23:52:51,444 INFO L443 ceAbstractionStarter]: For program point L119-3(lines 119 121) no Hoare annotation was computed. [2019-11-15 23:52:51,444 INFO L443 ceAbstractionStarter]: For program point L119-5(lines 119 121) no Hoare annotation was computed. [2019-11-15 23:52:51,444 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,444 INFO L439 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-15 23:52:51,444 INFO L439 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-15 23:52:51,444 INFO L443 ceAbstractionStarter]: For program point L914(lines 914 926) no Hoare annotation was computed. [2019-11-15 23:52:51,444 INFO L439 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-15 23:52:51,444 INFO L439 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-15 23:52:51,444 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,444 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,444 INFO L439 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-15 23:52:51,445 INFO L439 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-15 23:52:51,445 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 394) no Hoare annotation was computed. [2019-11-15 23:52:51,445 INFO L443 ceAbstractionStarter]: For program point L389-2(lines 227 415) no Hoare annotation was computed. [2019-11-15 23:52:51,445 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1548) no Hoare annotation was computed. [2019-11-15 23:52:51,445 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,445 INFO L439 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-15 23:52:51,445 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 289) no Hoare annotation was computed. [2019-11-15 23:52:51,445 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2019-11-15 23:52:51,445 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 134) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 127 134) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point L1450(lines 1450 1453) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 591) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 526 591) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point L1319(lines 1319 1546) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point L130-2(lines 130 132) no Hoare annotation was computed. [2019-11-15 23:52:51,446 INFO L443 ceAbstractionStarter]: For program point L130-3(lines 130 132) no Hoare annotation was computed. [2019-11-15 23:52:51,447 INFO L443 ceAbstractionStarter]: For program point L130-5(lines 130 132) no Hoare annotation was computed. [2019-11-15 23:52:51,447 INFO L443 ceAbstractionStarter]: For program point L395-1(lines 395 399) no Hoare annotation was computed. [2019-11-15 23:52:51,447 INFO L439 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-15 23:52:51,447 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-11-15 23:52:51,447 INFO L443 ceAbstractionStarter]: For program point L263-2(lines 263 265) no Hoare annotation was computed. [2019-11-15 23:52:51,447 INFO L439 ceAbstractionStarter]: At program point L1056(lines 1051 1058) the Hoare annotation is: false [2019-11-15 23:52:51,447 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:52:51,448 INFO L439 ceAbstractionStarter]: At program point L1056-1(lines 1051 1058) the Hoare annotation is: false [2019-11-15 23:52:51,448 INFO L439 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-15 23:52:51,448 INFO L439 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-15 23:52:51,448 INFO L439 ceAbstractionStarter]: At program point L1056-4(lines 1051 1058) the Hoare annotation is: false [2019-11-15 23:52:51,448 INFO L439 ceAbstractionStarter]: At program point L1056-5(lines 1051 1058) the Hoare annotation is: false [2019-11-15 23:52:51,448 INFO L439 ceAbstractionStarter]: At program point L1056-6(lines 1051 1058) the Hoare annotation is: false [2019-11-15 23:52:51,449 INFO L439 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-15 23:52:51,449 INFO L439 ceAbstractionStarter]: At program point L1056-8(lines 1051 1058) the Hoare annotation is: false [2019-11-15 23:52:51,449 INFO L439 ceAbstractionStarter]: At program point L1056-9(lines 1051 1058) the Hoare annotation is: false [2019-11-15 23:52:51,449 INFO L439 ceAbstractionStarter]: At program point L1056-10(lines 1051 1058) the Hoare annotation is: false [2019-11-15 23:52:51,449 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 568) no Hoare annotation was computed. [2019-11-15 23:52:51,450 INFO L439 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-15 23:52:51,450 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 539) no Hoare annotation was computed. [2019-11-15 23:52:51,450 INFO L446 ceAbstractionStarter]: At program point L794(lines 778 833) the Hoare annotation is: true [2019-11-15 23:52:51,450 INFO L439 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-15 23:52:51,451 INFO L439 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-15 23:52:51,451 INFO L439 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-15 23:52:51,451 INFO L439 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-15 23:52:51,452 INFO L439 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-15 23:52:51,452 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,452 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 830) no Hoare annotation was computed. [2019-11-15 23:52:51,452 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,452 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,452 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 829) no Hoare annotation was computed. [2019-11-15 23:52:51,453 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1591) no Hoare annotation was computed. [2019-11-15 23:52:51,453 INFO L443 ceAbstractionStarter]: For program point L1589-2(lines 1587 1618) no Hoare annotation was computed. [2019-11-15 23:52:51,453 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,453 INFO L439 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-15 23:52:51,453 INFO L439 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-15 23:52:51,454 INFO L443 ceAbstractionStarter]: For program point L797(lines 797 807) no Hoare annotation was computed. [2019-11-15 23:52:51,454 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 536) no Hoare annotation was computed. [2019-11-15 23:52:51,454 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 275) no Hoare annotation was computed. [2019-11-15 23:52:51,454 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 804) no Hoare annotation was computed. [2019-11-15 23:52:51,454 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 1592 1616) no Hoare annotation was computed. [2019-11-15 23:52:51,454 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1480) no Hoare annotation was computed. [2019-11-15 23:52:51,454 INFO L443 ceAbstractionStarter]: For program point L1328(lines 1328 1544) no Hoare annotation was computed. [2019-11-15 23:52:51,455 INFO L443 ceAbstractionStarter]: For program point L1064(lines 1064 1083) no Hoare annotation was computed. [2019-11-15 23:52:51,455 INFO L443 ceAbstractionStarter]: For program point L1064-1(lines 1064 1083) no Hoare annotation was computed. [2019-11-15 23:52:51,455 INFO L443 ceAbstractionStarter]: For program point L1064-2(lines 1064 1083) no Hoare annotation was computed. [2019-11-15 23:52:51,455 INFO L443 ceAbstractionStarter]: For program point L1064-3(lines 1064 1083) no Hoare annotation was computed. [2019-11-15 23:52:51,455 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1464) no Hoare annotation was computed. [2019-11-15 23:52:51,455 INFO L443 ceAbstractionStarter]: For program point L1065(lines 1065 1070) no Hoare annotation was computed. [2019-11-15 23:52:51,455 INFO L443 ceAbstractionStarter]: For program point L1065-2(lines 1065 1070) no Hoare annotation was computed. [2019-11-15 23:52:51,455 INFO L443 ceAbstractionStarter]: For program point L1065-4(lines 1065 1070) no Hoare annotation was computed. [2019-11-15 23:52:51,456 INFO L443 ceAbstractionStarter]: For program point L1065-6(lines 1065 1070) no Hoare annotation was computed. [2019-11-15 23:52:51,456 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 144) no Hoare annotation was computed. [2019-11-15 23:52:51,456 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 142 144) no Hoare annotation was computed. [2019-11-15 23:52:51,456 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 947) no Hoare annotation was computed. [2019-11-15 23:52:51,456 INFO L443 ceAbstractionStarter]: For program point L935-1(lines 935 947) no Hoare annotation was computed. [2019-11-15 23:52:51,456 INFO L439 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-15 23:52:51,457 INFO L439 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-15 23:52:51,457 INFO L439 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-15 23:52:51,457 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1479) no Hoare annotation was computed. [2019-11-15 23:52:51,458 INFO L439 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-15 23:52:51,458 INFO L439 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-15 23:52:51,458 INFO L443 ceAbstractionStarter]: For program point L542-1(lines 542 545) no Hoare annotation was computed. [2019-11-15 23:52:51,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,458 INFO L443 ceAbstractionStarter]: For program point L1600(lines 1600 1602) no Hoare annotation was computed. [2019-11-15 23:52:51,459 INFO L443 ceAbstractionStarter]: For program point L1600-2(lines 1600 1602) no Hoare annotation was computed. [2019-11-15 23:52:51,459 INFO L439 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-15 23:52:51,459 INFO L439 ceAbstractionStarter]: At program point L1072-1(lines 1064 1083) the Hoare annotation is: false [2019-11-15 23:52:51,459 INFO L439 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-15 23:52:51,459 INFO L439 ceAbstractionStarter]: At program point L1072-3(lines 1064 1083) the Hoare annotation is: false [2019-11-15 23:52:51,460 INFO L443 ceAbstractionStarter]: For program point L1337(lines 1337 1542) no Hoare annotation was computed. [2019-11-15 23:52:51,460 INFO L439 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-15 23:52:51,460 INFO L443 ceAbstractionStarter]: For program point L1470(lines 1470 1478) no Hoare annotation was computed. [2019-11-15 23:52:51,461 INFO L439 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-15 23:52:51,461 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 813) no Hoare annotation was computed. [2019-11-15 23:52:51,461 INFO L439 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-15 23:52:51,461 INFO L439 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-15 23:52:51,462 INFO L443 ceAbstractionStarter]: For program point L1077(lines 1077 1081) no Hoare annotation was computed. [2019-11-15 23:52:51,462 INFO L439 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-15 23:52:51,462 INFO L443 ceAbstractionStarter]: For program point L1077-2(lines 1077 1081) no Hoare annotation was computed. [2019-11-15 23:52:51,462 INFO L439 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-15 23:52:51,463 INFO L443 ceAbstractionStarter]: For program point L1077-4(lines 1077 1081) no Hoare annotation was computed. [2019-11-15 23:52:51,463 INFO L439 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-15 23:52:51,463 INFO L443 ceAbstractionStarter]: For program point L1077-6(lines 1077 1081) no Hoare annotation was computed. [2019-11-15 23:52:51,463 INFO L439 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-15 23:52:51,463 INFO L443 ceAbstractionStarter]: For program point L549(lines 548 564) no Hoare annotation was computed. [2019-11-15 23:52:51,463 INFO L443 ceAbstractionStarter]: For program point L1474(lines 1474 1477) no Hoare annotation was computed. [2019-11-15 23:52:51,464 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 827) no Hoare annotation was computed. [2019-11-15 23:52:51,464 INFO L443 ceAbstractionStarter]: For program point L1608(lines 1608 1614) no Hoare annotation was computed. [2019-11-15 23:52:51,464 INFO L439 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-15 23:52:51,464 INFO L439 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-15 23:52:51,464 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,464 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 820) no Hoare annotation was computed. [2019-11-15 23:52:51,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,465 INFO L443 ceAbstractionStarter]: For program point L1346(lines 1346 1540) no Hoare annotation was computed. [2019-11-15 23:52:51,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:52:51,466 INFO L439 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-15 23:52:51,466 INFO L443 ceAbstractionStarter]: For program point L293-1(lines 227 415) no Hoare annotation was computed. [2019-11-15 23:52:51,466 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,466 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1098) no Hoare annotation was computed. [2019-11-15 23:52:51,466 INFO L443 ceAbstractionStarter]: For program point L1086-1(lines 1086 1098) no Hoare annotation was computed. [2019-11-15 23:52:51,466 INFO L443 ceAbstractionStarter]: For program point L1086-2(lines 1086 1098) no Hoare annotation was computed. [2019-11-15 23:52:51,466 INFO L443 ceAbstractionStarter]: For program point L1086-3(lines 1086 1098) no Hoare annotation was computed. [2019-11-15 23:52:51,466 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,467 INFO L443 ceAbstractionStarter]: For program point L954-2(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,467 INFO L443 ceAbstractionStarter]: For program point L954-4(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,467 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 826) no Hoare annotation was computed. [2019-11-15 23:52:51,467 INFO L443 ceAbstractionStarter]: For program point L954-6(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,467 INFO L443 ceAbstractionStarter]: For program point L954-8(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,467 INFO L443 ceAbstractionStarter]: For program point L954-10(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,467 INFO L443 ceAbstractionStarter]: For program point L954-12(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,468 INFO L443 ceAbstractionStarter]: For program point L954-14(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,468 INFO L443 ceAbstractionStarter]: For program point L954-16(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,468 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-11-15 23:52:51,468 INFO L443 ceAbstractionStarter]: For program point L954-18(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,468 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 426 428) no Hoare annotation was computed. [2019-11-15 23:52:51,468 INFO L443 ceAbstractionStarter]: For program point L954-20(lines 954 960) no Hoare annotation was computed. [2019-11-15 23:52:51,468 INFO L439 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-15 23:52:51,469 INFO L439 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-15 23:52:51,469 INFO L439 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-15 23:52:51,469 INFO L439 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-15 23:52:51,470 INFO L439 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-15 23:52:51,470 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 562) no Hoare annotation was computed. [2019-11-15 23:52:51,470 INFO L439 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-15 23:52:51,470 INFO L439 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-15 23:52:51,471 INFO L439 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-15 23:52:51,471 INFO L439 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-15 23:52:51,471 INFO L439 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-15 23:52:51,472 INFO L443 ceAbstractionStarter]: For program point L1355(lines 1355 1538) no Hoare annotation was computed. [2019-11-15 23:52:51,472 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,472 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,472 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 305) no Hoare annotation was computed. [2019-11-15 23:52:51,472 INFO L439 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-15 23:52:51,472 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1536) no Hoare annotation was computed. [2019-11-15 23:52:51,473 INFO L443 ceAbstractionStarter]: For program point L1625(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,473 INFO L443 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,473 INFO L443 ceAbstractionStarter]: For program point L1625-2(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,473 INFO L443 ceAbstractionStarter]: For program point L1625-3(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,473 INFO L443 ceAbstractionStarter]: For program point L1625-4(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,473 INFO L443 ceAbstractionStarter]: For program point L1493(lines 1493 1496) no Hoare annotation was computed. [2019-11-15 23:52:51,473 INFO L443 ceAbstractionStarter]: For program point L1625-5(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,473 INFO L443 ceAbstractionStarter]: For program point L1625-6(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,474 INFO L443 ceAbstractionStarter]: For program point L1625-7(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,474 INFO L443 ceAbstractionStarter]: For program point L1625-8(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,474 INFO L443 ceAbstractionStarter]: For program point L1625-9(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,474 INFO L443 ceAbstractionStarter]: For program point L1625-10(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,474 INFO L443 ceAbstractionStarter]: For program point L1625-11(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,474 INFO L443 ceAbstractionStarter]: For program point L1625-12(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,474 INFO L443 ceAbstractionStarter]: For program point L1625-13(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,474 INFO L443 ceAbstractionStarter]: For program point L1625-14(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,475 INFO L443 ceAbstractionStarter]: For program point L1625-15(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,475 INFO L443 ceAbstractionStarter]: For program point L1625-16(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,475 INFO L443 ceAbstractionStarter]: For program point L1625-17(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,475 INFO L443 ceAbstractionStarter]: For program point L1625-18(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,475 INFO L443 ceAbstractionStarter]: For program point L1625-19(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,475 INFO L443 ceAbstractionStarter]: For program point L1625-20(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,475 INFO L443 ceAbstractionStarter]: For program point L1625-21(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,476 INFO L443 ceAbstractionStarter]: For program point L1625-22(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,476 INFO L443 ceAbstractionStarter]: For program point L1625-23(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,476 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,476 INFO L443 ceAbstractionStarter]: For program point L1625-24(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,476 INFO L443 ceAbstractionStarter]: For program point L1625-25(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,476 INFO L443 ceAbstractionStarter]: For program point L1625-26(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,476 INFO L443 ceAbstractionStarter]: For program point L1625-27(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,476 INFO L443 ceAbstractionStarter]: For program point L1625-28(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,477 INFO L443 ceAbstractionStarter]: For program point L1625-29(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,477 INFO L443 ceAbstractionStarter]: For program point L1625-30(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,477 INFO L439 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-15 23:52:51,477 INFO L443 ceAbstractionStarter]: For program point L1625-31(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,477 INFO L439 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-15 23:52:51,477 INFO L443 ceAbstractionStarter]: For program point L1625-32(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,478 INFO L439 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-15 23:52:51,478 INFO L443 ceAbstractionStarter]: For program point L1625-33(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,478 INFO L439 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-15 23:52:51,478 INFO L443 ceAbstractionStarter]: For program point L1625-34(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,478 INFO L439 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-15 23:52:51,478 INFO L443 ceAbstractionStarter]: For program point L1625-35(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,478 INFO L439 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-15 23:52:51,479 INFO L443 ceAbstractionStarter]: For program point L1625-36(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,479 INFO L443 ceAbstractionStarter]: For program point L1625-37(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,479 INFO L439 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-15 23:52:51,479 INFO L443 ceAbstractionStarter]: For program point L1625-38(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,479 INFO L439 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-15 23:52:51,480 INFO L443 ceAbstractionStarter]: For program point L1625-39(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,480 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,480 INFO L439 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-15 23:52:51,480 INFO L443 ceAbstractionStarter]: For program point L1625-40(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,480 INFO L443 ceAbstractionStarter]: For program point L1625-41(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,480 INFO L439 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-15 23:52:51,481 INFO L443 ceAbstractionStarter]: For program point L1625-42(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,481 INFO L443 ceAbstractionStarter]: For program point L1625-43(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,481 INFO L439 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-15 23:52:51,481 INFO L443 ceAbstractionStarter]: For program point L1625-44(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,481 INFO L443 ceAbstractionStarter]: For program point L1625-45(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,481 INFO L443 ceAbstractionStarter]: For program point L1625-46(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,481 INFO L443 ceAbstractionStarter]: For program point L1625-47(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,482 INFO L439 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-15 23:52:51,482 INFO L443 ceAbstractionStarter]: For program point L1625-48(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,482 INFO L443 ceAbstractionStarter]: For program point L1625-49(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,482 INFO L443 ceAbstractionStarter]: For program point L1625-50(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,483 INFO L439 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-15 23:52:51,483 INFO L443 ceAbstractionStarter]: For program point L1625-51(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,483 INFO L443 ceAbstractionStarter]: For program point L1625-52(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,483 INFO L439 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-15 23:52:51,483 INFO L439 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-15 23:52:51,484 INFO L439 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-15 23:52:51,484 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,484 INFO L439 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-15 23:52:51,484 INFO L439 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-15 23:52:51,485 INFO L439 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-15 23:52:51,485 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 577) no Hoare annotation was computed. [2019-11-15 23:52:51,485 INFO L439 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-15 23:52:51,485 INFO L443 ceAbstractionStarter]: For program point L570-2(lines 570 577) no Hoare annotation was computed. [2019-11-15 23:52:51,485 INFO L439 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-15 23:52:51,486 INFO L439 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-15 23:52:51,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,486 INFO L439 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-15 23:52:51,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,486 INFO L439 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-15 23:52:51,487 INFO L439 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-15 23:52:51,487 INFO L439 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-15 23:52:51,487 INFO L439 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-15 23:52:51,487 INFO L439 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-15 23:52:51,487 INFO L446 ceAbstractionStarter]: At program point L835(lines 665 837) the Hoare annotation is: true [2019-11-15 23:52:51,488 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,488 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,488 INFO L439 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-15 23:52:51,488 INFO L439 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-15 23:52:51,489 INFO L439 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-15 23:52:51,489 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,489 INFO L439 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-15 23:52:51,489 INFO L443 ceAbstractionStarter]: For program point L1367(lines 1367 1534) no Hoare annotation was computed. [2019-11-15 23:52:51,489 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,490 INFO L443 ceAbstractionStarter]: For program point L972(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,490 INFO L439 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-15 23:52:51,490 INFO L443 ceAbstractionStarter]: For program point L972-2(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,490 INFO L439 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-15 23:52:51,490 INFO L443 ceAbstractionStarter]: For program point L972-4(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,491 INFO L439 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-15 23:52:51,491 INFO L443 ceAbstractionStarter]: For program point L972-6(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,491 INFO L439 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-15 23:52:51,491 INFO L443 ceAbstractionStarter]: For program point L972-8(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,491 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,491 INFO L439 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-15 23:52:51,492 INFO L443 ceAbstractionStarter]: For program point L972-10(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,492 INFO L439 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-15 23:52:51,492 INFO L443 ceAbstractionStarter]: For program point L972-12(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,492 INFO L439 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-15 23:52:51,492 INFO L443 ceAbstractionStarter]: For program point L972-14(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,492 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1503) no Hoare annotation was computed. [2019-11-15 23:52:51,493 INFO L439 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-15 23:52:51,493 INFO L443 ceAbstractionStarter]: For program point L972-16(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,493 INFO L439 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-15 23:52:51,493 INFO L443 ceAbstractionStarter]: For program point L972-18(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,493 INFO L439 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-15 23:52:51,493 INFO L443 ceAbstractionStarter]: For program point L972-20(lines 972 984) no Hoare annotation was computed. [2019-11-15 23:52:51,494 INFO L439 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-15 23:52:51,494 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1120) no Hoare annotation was computed. [2019-11-15 23:52:51,494 INFO L443 ceAbstractionStarter]: For program point L1108-1(lines 1108 1120) no Hoare annotation was computed. [2019-11-15 23:52:51,494 INFO L439 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-15 23:52:51,494 INFO L439 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-15 23:52:51,494 INFO L443 ceAbstractionStarter]: For program point L1374(lines 1374 1532) no Hoare annotation was computed. [2019-11-15 23:52:51,495 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 329) no Hoare annotation was computed. [2019-11-15 23:52:51,495 INFO L443 ceAbstractionStarter]: For program point L978(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,495 INFO L443 ceAbstractionStarter]: For program point L978-2(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,495 INFO L443 ceAbstractionStarter]: For program point L978-4(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,495 INFO L443 ceAbstractionStarter]: For program point L978-6(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,495 INFO L443 ceAbstractionStarter]: For program point L714(lines 714 717) no Hoare annotation was computed. [2019-11-15 23:52:51,495 INFO L443 ceAbstractionStarter]: For program point L978-8(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,495 INFO L443 ceAbstractionStarter]: For program point L714-2(lines 714 717) no Hoare annotation was computed. [2019-11-15 23:52:51,496 INFO L443 ceAbstractionStarter]: For program point L978-10(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,496 INFO L443 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2019-11-15 23:52:51,496 INFO L443 ceAbstractionStarter]: For program point L978-12(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,496 INFO L443 ceAbstractionStarter]: For program point L582-2(lines 582 587) no Hoare annotation was computed. [2019-11-15 23:52:51,496 INFO L443 ceAbstractionStarter]: For program point L978-14(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,496 INFO L443 ceAbstractionStarter]: For program point L978-16(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,496 INFO L443 ceAbstractionStarter]: For program point L978-18(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,497 INFO L443 ceAbstractionStarter]: For program point L978-20(lines 978 982) no Hoare annotation was computed. [2019-11-15 23:52:51,497 INFO L439 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-15 23:52:51,497 INFO L439 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-15 23:52:51,497 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 860) no Hoare annotation was computed. [2019-11-15 23:52:51,497 INFO L439 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-15 23:52:51,498 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 328) no Hoare annotation was computed. [2019-11-15 23:52:51,498 INFO L439 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-15 23:52:51,498 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:52:51,498 INFO L439 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-15 23:52:51,498 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 193) no Hoare annotation was computed. [2019-11-15 23:52:51,498 INFO L443 ceAbstractionStarter]: For program point L191-2(lines 191 193) no Hoare annotation was computed. [2019-11-15 23:52:51,499 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1530) no Hoare annotation was computed. [2019-11-15 23:52:51,499 INFO L439 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-15 23:52:51,499 INFO L443 ceAbstractionStarter]: For program point L987(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,499 INFO L443 ceAbstractionStarter]: For program point L987-1(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,499 INFO L443 ceAbstractionStarter]: For program point L987-2(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,499 INFO L443 ceAbstractionStarter]: For program point L987-3(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,499 INFO L443 ceAbstractionStarter]: For program point L987-4(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,500 INFO L443 ceAbstractionStarter]: For program point L987-5(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,500 INFO L443 ceAbstractionStarter]: For program point L987-6(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,500 INFO L443 ceAbstractionStarter]: For program point L987-7(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,500 INFO L443 ceAbstractionStarter]: For program point L987-8(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,500 INFO L443 ceAbstractionStarter]: For program point L987-9(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,500 INFO L443 ceAbstractionStarter]: For program point L987-10(lines 987 1010) no Hoare annotation was computed. [2019-11-15 23:52:51,500 INFO L439 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-15 23:52:51,501 INFO L439 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-15 23:52:51,501 INFO L439 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-15 23:52:51,501 INFO L439 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-15 23:52:51,501 INFO L439 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-15 23:52:51,502 INFO L439 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-15 23:52:51,502 INFO L439 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-15 23:52:51,502 INFO L439 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-15 23:52:51,502 INFO L439 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-15 23:52:51,503 INFO L439 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-15 23:52:51,503 INFO L439 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-15 23:52:51,503 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 204) no Hoare annotation was computed. [2019-11-15 23:52:51,503 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,503 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,503 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,504 INFO L439 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-15 23:52:51,504 INFO L439 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-15 23:52:51,504 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1528) no Hoare annotation was computed. [2019-11-15 23:52:51,504 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,504 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,504 INFO L443 ceAbstractionStarter]: For program point L992-1(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,505 INFO L443 ceAbstractionStarter]: For program point L992-2(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,505 INFO L443 ceAbstractionStarter]: For program point L992-3(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,505 INFO L443 ceAbstractionStarter]: For program point L992-4(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,505 INFO L443 ceAbstractionStarter]: For program point L992-5(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,505 INFO L443 ceAbstractionStarter]: For program point L992-6(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,505 INFO L443 ceAbstractionStarter]: For program point L992-7(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,505 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 776) no Hoare annotation was computed. [2019-11-15 23:52:51,505 INFO L443 ceAbstractionStarter]: For program point L992-8(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,506 INFO L443 ceAbstractionStarter]: For program point L992-9(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,506 INFO L443 ceAbstractionStarter]: For program point L992-10(lines 992 1009) no Hoare annotation was computed. [2019-11-15 23:52:51,506 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,506 INFO L439 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-15 23:52:51,506 INFO L439 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-15 23:52:51,507 INFO L439 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-15 23:52:51,507 INFO L439 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-15 23:52:51,507 INFO L439 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-15 23:52:51,507 INFO L439 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-15 23:52:51,507 INFO L439 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-15 23:52:51,508 INFO L439 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-15 23:52:51,508 INFO L439 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-15 23:52:51,508 INFO L439 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-15 23:52:51,508 INFO L439 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-15 23:52:51,509 INFO L439 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-15 23:52:51,509 INFO L439 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-15 23:52:51,509 INFO L439 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-15 23:52:51,509 INFO L439 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-15 23:52:51,510 INFO L439 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-15 23:52:51,510 INFO L439 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-15 23:52:51,510 INFO L439 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-15 23:52:51,510 INFO L439 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-15 23:52:51,511 INFO L439 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-15 23:52:51,511 INFO L439 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-15 23:52:51,511 INFO L439 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-15 23:52:51,511 INFO L439 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-15 23:52:51,512 INFO L439 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-15 23:52:51,512 INFO L439 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-15 23:52:51,512 INFO L439 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-15 23:52:51,512 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 775) no Hoare annotation was computed. [2019-11-15 23:52:51,512 INFO L443 ceAbstractionStarter]: For program point L205(lines 205 424) no Hoare annotation was computed. [2019-11-15 23:52:51,512 INFO L443 ceAbstractionStarter]: For program point L1130(lines 1130 1142) no Hoare annotation was computed. [2019-11-15 23:52:51,513 INFO L443 ceAbstractionStarter]: For program point L1130-1(lines 1130 1142) no Hoare annotation was computed. [2019-11-15 23:52:51,513 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,513 INFO L439 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-15 23:52:51,513 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1526) no Hoare annotation was computed. [2019-11-15 23:52:51,513 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 343) no Hoare annotation was computed. [2019-11-15 23:52:51,513 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 343) no Hoare annotation was computed. [2019-11-15 23:52:51,513 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,514 INFO L439 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-15 23:52:51,514 INFO L439 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-15 23:52:51,514 INFO L439 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-15 23:52:51,514 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 423) no Hoare annotation was computed. [2019-11-15 23:52:51,514 INFO L439 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-15 23:52:51,515 INFO L439 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-15 23:52:51,515 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 881) no Hoare annotation was computed. [2019-11-15 23:52:51,515 INFO L439 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-15 23:52:51,515 INFO L439 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-15 23:52:51,515 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 774) no Hoare annotation was computed. [2019-11-15 23:52:51,516 INFO L439 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-15 23:52:51,516 INFO L439 ceAbstractionStarter]: At program point L607(lines 600 609) the Hoare annotation is: false [2019-11-15 23:52:51,516 INFO L439 ceAbstractionStarter]: At program point L607-1(lines 600 609) the Hoare annotation is: false [2019-11-15 23:52:51,516 INFO L439 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-15 23:52:51,516 INFO L439 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-15 23:52:51,516 INFO L439 ceAbstractionStarter]: At program point L607-4(lines 600 609) the Hoare annotation is: false [2019-11-15 23:52:51,517 INFO L439 ceAbstractionStarter]: At program point L607-5(lines 600 609) the Hoare annotation is: false [2019-11-15 23:52:51,517 INFO L439 ceAbstractionStarter]: At program point L607-6(lines 600 609) the Hoare annotation is: false [2019-11-15 23:52:51,517 INFO L439 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-15 23:52:51,517 INFO L439 ceAbstractionStarter]: At program point L607-8(lines 600 609) the Hoare annotation is: false [2019-11-15 23:52:51,517 INFO L439 ceAbstractionStarter]: At program point L607-9(lines 600 609) the Hoare annotation is: false [2019-11-15 23:52:51,517 INFO L439 ceAbstractionStarter]: At program point L607-10(lines 600 609) the Hoare annotation is: false [2019-11-15 23:52:51,517 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 422) no Hoare annotation was computed. [2019-11-15 23:52:51,518 INFO L439 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-15 23:52:51,518 INFO L439 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-15 23:52:51,518 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,518 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 421) no Hoare annotation was computed. [2019-11-15 23:52:51,518 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,518 INFO L439 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-15 23:52:51,518 INFO L439 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-15 23:52:51,519 INFO L439 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-15 23:52:51,519 INFO L439 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-15 23:52:51,519 INFO L439 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-15 23:52:51,519 INFO L439 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-15 23:52:51,519 INFO L439 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-15 23:52:51,519 INFO L439 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-15 23:52:51,520 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 773) no Hoare annotation was computed. [2019-11-15 23:52:51,520 INFO L439 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-15 23:52:51,520 INFO L439 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-15 23:52:51,520 INFO L439 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-15 23:52:51,520 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,520 INFO L439 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-15 23:52:51,520 INFO L439 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-15 23:52:51,520 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,520 INFO L443 ceAbstractionStarter]: For program point L1273(lines 1273 1285) no Hoare annotation was computed. [2019-11-15 23:52:51,520 INFO L443 ceAbstractionStarter]: For program point L1273-2(lines 1272 1561) no Hoare annotation was computed. [2019-11-15 23:52:51,520 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,520 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 420) no Hoare annotation was computed. [2019-11-15 23:52:51,521 INFO L439 ceAbstractionStarter]: At program point L746(lines 745 773) the Hoare annotation is: (= ~NP~0 ~s~0) [2019-11-15 23:52:51,521 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:52:51,521 INFO L439 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-15 23:52:51,521 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,521 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,521 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,521 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,521 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1413) no Hoare annotation was computed. [2019-11-15 23:52:51,521 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 419) no Hoare annotation was computed. [2019-11-15 23:52:51,521 INFO L439 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-15 23:52:51,521 INFO L439 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-15 23:52:51,521 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1278(lines 1278 1283) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L439 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-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-1(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-2(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-3(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-4(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-5(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-6(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-7(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-8(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-9(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1015-10(lines 1015 1032) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 418) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,522 INFO L443 ceAbstractionStarter]: For program point L1016-3(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L439 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-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-6(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-9(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-12(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-15(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-18(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-21(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L439 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-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-24(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-27(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L439 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-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L1016-30(lines 1016 1022) no Hoare annotation was computed. [2019-11-15 23:52:51,523 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 501) no Hoare annotation was computed. [2019-11-15 23:52:51,524 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 364) no Hoare annotation was computed. [2019-11-15 23:52:51,524 INFO L439 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-15 23:52:51,524 INFO L443 ceAbstractionStarter]: For program point L1151(lines 1151 1163) no Hoare annotation was computed. [2019-11-15 23:52:51,524 INFO L443 ceAbstractionStarter]: For program point L1151-1(lines 1151 1163) no Hoare annotation was computed. [2019-11-15 23:52:51,524 INFO L439 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-15 23:52:51,524 INFO L439 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-15 23:52:51,524 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 627) no Hoare annotation was computed. [2019-11-15 23:52:51,524 INFO L439 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-15 23:52:51,524 INFO L439 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-15 23:52:51,524 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 500) no Hoare annotation was computed. [2019-11-15 23:52:51,525 INFO L439 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-15 23:52:51,525 INFO L443 ceAbstractionStarter]: For program point L1552(lines 1552 1558) no Hoare annotation was computed. [2019-11-15 23:52:51,525 INFO L439 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-15 23:52:51,525 INFO L443 ceAbstractionStarter]: For program point L1024(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,525 INFO L443 ceAbstractionStarter]: For program point L1024-2(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,525 INFO L443 ceAbstractionStarter]: For program point L1024-4(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,525 INFO L443 ceAbstractionStarter]: For program point L892(lines 892 904) no Hoare annotation was computed. [2019-11-15 23:52:51,525 INFO L443 ceAbstractionStarter]: For program point L1024-6(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,526 INFO L443 ceAbstractionStarter]: For program point L1024-8(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,526 INFO L443 ceAbstractionStarter]: For program point L1024-10(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,526 INFO L443 ceAbstractionStarter]: For program point L1024-12(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,526 INFO L443 ceAbstractionStarter]: For program point L1024-14(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,526 INFO L443 ceAbstractionStarter]: For program point L1024-16(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,526 INFO L443 ceAbstractionStarter]: For program point L1024-18(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,526 INFO L443 ceAbstractionStarter]: For program point L1024-20(lines 1024 1031) no Hoare annotation was computed. [2019-11-15 23:52:51,527 INFO L439 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-15 23:52:51,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:52:51 BoogieIcfgContainer [2019-11-15 23:52:51,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:52:51,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:52:51,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:52:51,710 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:52:51,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:51:29" (3/4) ... [2019-11-15 23:52:51,714 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:52:51,759 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2019-11-15 23:52:51,764 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2019-11-15 23:52:51,769 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-15 23:52:51,773 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:52:51,819 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-15 23:52:51,819 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-15 23:52:51,820 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-15 23:52:51,820 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-15 23:52:51,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 [2019-11-15 23:52:51,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && status == 0) && s == DC) && \result == 0 [2019-11-15 23:52:51,831 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-15 23:52:51,832 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-15 23:52:51,832 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-15 23:52:51,833 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-15 23:52:51,833 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-15 23:52:51,833 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-15 23:52:51,834 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-15 23:52:51,834 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-15 23:52:51,834 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-15 23:52:51,834 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-15 23:52:51,834 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-15 23:52:51,835 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-15 23:52:51,835 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-15 23:52:51,835 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-15 23:52:51,836 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-15 23:52:51,836 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-15 23:52:51,837 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-15 23:52:51,837 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-15 23:52:51,838 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-15 23:52:51,838 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-15 23:52:51,838 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-15 23:52:51,838 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-15 23:52:51,838 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-15 23:52:51,838 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-15 23:52:51,838 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-15 23:52:51,839 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-15 23:52:51,840 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-15 23:52:51,840 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-15 23:52:51,841 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-15 23:52:51,841 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-15 23:52:51,841 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-15 23:52:51,842 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-15 23:52:51,842 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-15 23:52:51,842 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-15 23:52:51,842 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-15 23:52:51,843 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-15 23:52:51,843 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-15 23:52:51,844 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-15 23:52:51,844 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-15 23:52:51,844 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-15 23:52:51,844 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-15 23:52:51,845 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-15 23:52:51,845 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-15 23:52:51,845 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-15 23:52:51,845 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-15 23:52:51,846 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-15 23:52:51,846 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-15 23:52:51,846 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-15 23:52:51,846 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-15 23:52:51,846 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-15 23:52:51,847 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-15 23:52:51,847 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-15 23:52:51,847 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-15 23:52:51,848 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-15 23:52:51,848 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-15 23:52:51,848 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-15 23:52:51,848 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-15 23:52:51,848 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-15 23:52:51,849 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-15 23:52:51,849 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-15 23:52:51,849 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-15 23:52:51,849 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-15 23:52:51,849 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-15 23:52:51,849 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-15 23:52:51,850 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-15 23:52:51,850 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-15 23:52:51,850 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-15 23:52:51,850 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-15 23:52:51,850 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-15 23:52:51,850 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-15 23:52:51,851 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-15 23:52:51,851 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-15 23:52:51,851 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-15 23:52:51,851 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-15 23:52:51,851 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-15 23:52:51,852 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-15 23:52:51,852 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-15 23:52:51,852 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-15 23:52:51,852 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-15 23:52:51,852 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-15 23:52:51,852 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-15 23:52:52,054 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_33d2c80a-9488-48b8-a694-3c297fcdede4/bin/uautomizer/witness.graphml [2019-11-15 23:52:52,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:52:52,057 INFO L168 Benchmark]: Toolchain (without parser) took 84616.49 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 944.7 MB in the beginning and 1.4 GB in the end (delta: -459.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 23:52:52,057 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:52:52,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:52,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:52,058 INFO L168 Benchmark]: Boogie Preprocessor took 137.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:52,058 INFO L168 Benchmark]: RCFGBuilder took 1683.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.9 MB in the end (delta: 198.0 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:52,059 INFO L168 Benchmark]: TraceAbstraction took 81722.63 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 933.9 MB in the beginning and 1.5 GB in the end (delta: -558.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:52:52,059 INFO L168 Benchmark]: Witness Printer took 345.42 ms. Allocated memory is still 2.8 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 88.6 MB). Peak memory consumption was 88.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:52,061 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1683.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.9 MB in the end (delta: 198.0 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 81722.63 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 933.9 MB in the beginning and 1.5 GB in the end (delta: -558.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 345.42 ms. Allocated memory is still 2.8 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 88.6 MB). Peak memory consumption was 88.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: 81.4s, OverallIterations: 64, TraceHistogramMax: 1, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 58.7s, HoareTripleCheckerStatistics: 29519 SDtfs, 28784 SDslu, 62511 SDs, 0 SdLazy, 9738 SolverSat, 913 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 609 GetRequests, 161 SyntacticMatches, 4 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 4.1s 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: 2.4s AutomataMinimizationTime, 64 MinimizatonAttempts, 4446 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 216 LocationsWithAnnotation, 216 PreInvPairs, 832 NumberOfFragments, 24254 HoareAnnotationTreeSize, 216 FomulaSimplifications, 2860121977542867 FormulaSimplificationTreeSizeReduction, 9.8s HoareSimplificationTime, 216 FomulaSimplificationsInter, 454811986474635 FormulaSimplificationTreeSizeReductionInter, 48.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s 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...