./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/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 c23505adeafc05501dae695d01ba5b7f16426196 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:24:28,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:24:28,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:24:28,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:24:28,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:24:28,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:24:28,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:24:28,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:24:28,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:24:28,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:24:28,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:24:28,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:24:28,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:24:28,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:24:28,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:24:28,631 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:24:28,632 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:24:28,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:24:28,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:24:28,635 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:24:28,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:24:28,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:24:28,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:24:28,639 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:24:28,639 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:24:28,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:24:28,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:24:28,641 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:24:28,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:24:28,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:24:28,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:24:28,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:24:28,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:24:28,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:24:28,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:24:28,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:24:28,644 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 01:24:28,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:24:28,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:24:28,655 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:24:28,655 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:24:28,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:24:28,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:24:28,656 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:24:28,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:24:28,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:24:28,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:24:28,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:24:28,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:24:28,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:24:28,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:24:28,656 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:24:28,657 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:24:28,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:24:28,657 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:24:28,657 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:24:28,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:24:28,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:24:28,657 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:24:28,657 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:24:28,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:24:28,658 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:24:28,658 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:24:28,658 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:24:28,658 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:24:28,658 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:24:28,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:24:28,658 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/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 -> c23505adeafc05501dae695d01ba5b7f16426196 [2018-11-23 01:24:28,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:24:28,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:24:28,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:24:28,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:24:28,692 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:24:28,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 01:24:28,728 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/data/1ee056a6d/6f83fafb2fed419e9418850d4f3399a5/FLAGcc5e3992b [2018-11-23 01:24:29,157 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:24:29,157 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 01:24:29,164 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/data/1ee056a6d/6f83fafb2fed419e9418850d4f3399a5/FLAGcc5e3992b [2018-11-23 01:24:29,177 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/data/1ee056a6d/6f83fafb2fed419e9418850d4f3399a5 [2018-11-23 01:24:29,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:24:29,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:24:29,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:24:29,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:24:29,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:24:29,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462bb081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29, skipping insertion in model container [2018-11-23 01:24:29,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:24:29,232 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:24:29,413 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:24:29,417 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:24:29,464 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:24:29,475 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:24:29,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29 WrapperNode [2018-11-23 01:24:29,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:24:29,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:24:29,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:24:29,476 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:24:29,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:24:29,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:24:29,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:24:29,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:24:29,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... [2018-11-23 01:24:29,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:24:29,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:24:29,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:24:29,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:24:29,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/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 [2018-11-23 01:24:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-23 01:24:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-23 01:24:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-23 01:24:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-23 01:24:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-23 01:24:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-23 01:24:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-23 01:24:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-23 01:24:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:24:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:24:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 01:24:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 01:24:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-23 01:24:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-23 01:24:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 01:24:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 01:24:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 01:24:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 01:24:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-23 01:24:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-23 01:24:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-23 01:24:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-23 01:24:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-23 01:24:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-23 01:24:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-23 01:24:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-23 01:24:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 01:24:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 01:24:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 01:24:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 01:24:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-23 01:24:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-23 01:24:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 01:24:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 01:24:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-23 01:24:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-23 01:24:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:24:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:24:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-23 01:24:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-23 01:24:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-23 01:24:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-23 01:24:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:24:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:24:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-23 01:24:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-23 01:24:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-23 01:24:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-23 01:24:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-23 01:24:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-23 01:24:29,762 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:29,763 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:29,819 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:29,820 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:29,828 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:29,828 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:29,960 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:29,960 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,020 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:30,021 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,100 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:30,100 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,105 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:30,105 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,109 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:30,109 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,121 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:30,121 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,172 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:30,172 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,178 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:30,178 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,186 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:24:30,186 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:24:30,199 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:24:30,199 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 01:24:30,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:30 BoogieIcfgContainer [2018-11-23 01:24:30,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:24:30,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:24:30,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:24:30,203 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:24:30,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:24:29" (1/3) ... [2018-11-23 01:24:30,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b4e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:24:30, skipping insertion in model container [2018-11-23 01:24:30,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:29" (2/3) ... [2018-11-23 01:24:30,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b4e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:24:30, skipping insertion in model container [2018-11-23 01:24:30,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:30" (3/3) ... [2018-11-23 01:24:30,206 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 01:24:30,214 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:24:30,220 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:24:30,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:24:30,258 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:24:30,259 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:24:30,259 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:24:30,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:24:30,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:24:30,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:24:30,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:24:30,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:24:30,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:24:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states. [2018-11-23 01:24:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 01:24:30,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:30,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:30,287 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:30,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash -309041171, now seen corresponding path program 1 times [2018-11-23 01:24:30,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:30,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:30,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:30,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:30,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:30,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:30,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:30,455 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 3 states. [2018-11-23 01:24:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:30,549 INFO L93 Difference]: Finished difference Result 508 states and 727 transitions. [2018-11-23 01:24:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:30,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 01:24:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:30,561 INFO L225 Difference]: With dead ends: 508 [2018-11-23 01:24:30,561 INFO L226 Difference]: Without dead ends: 292 [2018-11-23 01:24:30,565 INFO L631 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 [2018-11-23 01:24:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-23 01:24:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-11-23 01:24:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-23 01:24:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2018-11-23 01:24:30,603 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2018-11-23 01:24:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:30,603 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2018-11-23 01:24:30,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2018-11-23 01:24:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 01:24:30,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:30,605 INFO L402 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] [2018-11-23 01:24:30,605 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:30,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash -940725380, now seen corresponding path program 1 times [2018-11-23 01:24:30,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:30,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:30,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:30,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:30,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:30,725 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand 3 states. [2018-11-23 01:24:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:30,858 INFO L93 Difference]: Finished difference Result 601 states and 800 transitions. [2018-11-23 01:24:30,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:30,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 01:24:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:30,861 INFO L225 Difference]: With dead ends: 601 [2018-11-23 01:24:30,862 INFO L226 Difference]: Without dead ends: 440 [2018-11-23 01:24:30,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-23 01:24:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 423. [2018-11-23 01:24:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-11-23 01:24:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 560 transitions. [2018-11-23 01:24:30,896 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 560 transitions. Word has length 28 [2018-11-23 01:24:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:30,897 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 560 transitions. [2018-11-23 01:24:30,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 560 transitions. [2018-11-23 01:24:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 01:24:30,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:30,897 INFO L402 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] [2018-11-23 01:24:30,898 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:30,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1226553269, now seen corresponding path program 1 times [2018-11-23 01:24:30,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:30,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:30,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:30,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:30,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:30,968 INFO L87 Difference]: Start difference. First operand 423 states and 560 transitions. Second operand 3 states. [2018-11-23 01:24:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:31,011 INFO L93 Difference]: Finished difference Result 913 states and 1215 transitions. [2018-11-23 01:24:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:31,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 01:24:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:31,015 INFO L225 Difference]: With dead ends: 913 [2018-11-23 01:24:31,015 INFO L226 Difference]: Without dead ends: 651 [2018-11-23 01:24:31,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-11-23 01:24:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 620. [2018-11-23 01:24:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-23 01:24:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 828 transitions. [2018-11-23 01:24:31,047 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 828 transitions. Word has length 30 [2018-11-23 01:24:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:31,047 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 828 transitions. [2018-11-23 01:24:31,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 828 transitions. [2018-11-23 01:24:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 01:24:31,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:31,048 INFO L402 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] [2018-11-23 01:24:31,049 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:31,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2035434096, now seen corresponding path program 1 times [2018-11-23 01:24:31,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:31,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:31,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:31,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:31,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:31,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:31,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:31,113 INFO L87 Difference]: Start difference. First operand 620 states and 828 transitions. Second operand 3 states. [2018-11-23 01:24:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:31,145 INFO L93 Difference]: Finished difference Result 715 states and 947 transitions. [2018-11-23 01:24:31,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:31,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 01:24:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:31,149 INFO L225 Difference]: With dead ends: 715 [2018-11-23 01:24:31,149 INFO L226 Difference]: Without dead ends: 697 [2018-11-23 01:24:31,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-11-23 01:24:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 658. [2018-11-23 01:24:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-23 01:24:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 877 transitions. [2018-11-23 01:24:31,178 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 877 transitions. Word has length 34 [2018-11-23 01:24:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:31,179 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 877 transitions. [2018-11-23 01:24:31,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 877 transitions. [2018-11-23 01:24:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 01:24:31,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:31,181 INFO L402 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] [2018-11-23 01:24:31,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:31,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:31,182 INFO L82 PathProgramCache]: Analyzing trace with hash 897056749, now seen corresponding path program 1 times [2018-11-23 01:24:31,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:31,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:31,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:31,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:31,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:31,229 INFO L87 Difference]: Start difference. First operand 658 states and 877 transitions. Second operand 3 states. [2018-11-23 01:24:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:31,370 INFO L93 Difference]: Finished difference Result 1029 states and 1392 transitions. [2018-11-23 01:24:31,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:31,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-23 01:24:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:31,375 INFO L225 Difference]: With dead ends: 1029 [2018-11-23 01:24:31,375 INFO L226 Difference]: Without dead ends: 1026 [2018-11-23 01:24:31,376 INFO L631 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 [2018-11-23 01:24:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-11-23 01:24:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 781. [2018-11-23 01:24:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-11-23 01:24:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1046 transitions. [2018-11-23 01:24:31,416 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1046 transitions. Word has length 41 [2018-11-23 01:24:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:31,416 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1046 transitions. [2018-11-23 01:24:31,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1046 transitions. [2018-11-23 01:24:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 01:24:31,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:31,418 INFO L402 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] [2018-11-23 01:24:31,419 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:31,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash 999260852, now seen corresponding path program 1 times [2018-11-23 01:24:31,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:31,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:31,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:31,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:31,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:31,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:31,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:31,493 INFO L87 Difference]: Start difference. First operand 781 states and 1046 transitions. Second operand 3 states. [2018-11-23 01:24:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:31,593 INFO L93 Difference]: Finished difference Result 796 states and 1066 transitions. [2018-11-23 01:24:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:31,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 01:24:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:31,598 INFO L225 Difference]: With dead ends: 796 [2018-11-23 01:24:31,598 INFO L226 Difference]: Without dead ends: 793 [2018-11-23 01:24:31,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-11-23 01:24:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 792. [2018-11-23 01:24:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-23 01:24:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1060 transitions. [2018-11-23 01:24:31,633 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1060 transitions. Word has length 40 [2018-11-23 01:24:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:31,634 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1060 transitions. [2018-11-23 01:24:31,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1060 transitions. [2018-11-23 01:24:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 01:24:31,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:31,635 INFO L402 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] [2018-11-23 01:24:31,635 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:31,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1052368345, now seen corresponding path program 1 times [2018-11-23 01:24:31,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:31,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:31,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:31,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:31,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:31,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:31,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:31,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:31,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:31,666 INFO L87 Difference]: Start difference. First operand 792 states and 1060 transitions. Second operand 3 states. [2018-11-23 01:24:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:31,749 INFO L93 Difference]: Finished difference Result 824 states and 1098 transitions. [2018-11-23 01:24:31,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:31,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-23 01:24:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:31,753 INFO L225 Difference]: With dead ends: 824 [2018-11-23 01:24:31,753 INFO L226 Difference]: Without dead ends: 819 [2018-11-23 01:24:31,754 INFO L631 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 [2018-11-23 01:24:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-23 01:24:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2018-11-23 01:24:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-11-23 01:24:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1091 transitions. [2018-11-23 01:24:31,787 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1091 transitions. Word has length 41 [2018-11-23 01:24:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:31,787 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1091 transitions. [2018-11-23 01:24:31,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1091 transitions. [2018-11-23 01:24:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 01:24:31,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:31,788 INFO L402 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] [2018-11-23 01:24:31,789 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:31,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1801128385, now seen corresponding path program 1 times [2018-11-23 01:24:31,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:31,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:31,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:31,850 INFO L87 Difference]: Start difference. First operand 817 states and 1091 transitions. Second operand 5 states. [2018-11-23 01:24:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:32,350 INFO L93 Difference]: Finished difference Result 1536 states and 2036 transitions. [2018-11-23 01:24:32,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:32,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 01:24:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:32,355 INFO L225 Difference]: With dead ends: 1536 [2018-11-23 01:24:32,355 INFO L226 Difference]: Without dead ends: 985 [2018-11-23 01:24:32,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-11-23 01:24:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 808. [2018-11-23 01:24:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-23 01:24:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1070 transitions. [2018-11-23 01:24:32,399 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1070 transitions. Word has length 42 [2018-11-23 01:24:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:32,399 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1070 transitions. [2018-11-23 01:24:32,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1070 transitions. [2018-11-23 01:24:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 01:24:32,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:32,401 INFO L402 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] [2018-11-23 01:24:32,401 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:32,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:32,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1284438240, now seen corresponding path program 1 times [2018-11-23 01:24:32,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:32,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:32,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:32,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:32,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:32,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:32,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:32,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:32,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:32,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:32,456 INFO L87 Difference]: Start difference. First operand 808 states and 1070 transitions. Second operand 5 states. [2018-11-23 01:24:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:32,757 INFO L93 Difference]: Finished difference Result 816 states and 1076 transitions. [2018-11-23 01:24:32,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:24:32,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 01:24:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:32,761 INFO L225 Difference]: With dead ends: 816 [2018-11-23 01:24:32,761 INFO L226 Difference]: Without dead ends: 810 [2018-11-23 01:24:32,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-23 01:24:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2018-11-23 01:24:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-23 01:24:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1069 transitions. [2018-11-23 01:24:32,803 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1069 transitions. Word has length 42 [2018-11-23 01:24:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:32,803 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1069 transitions. [2018-11-23 01:24:32,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1069 transitions. [2018-11-23 01:24:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 01:24:32,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:32,804 INFO L402 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] [2018-11-23 01:24:32,804 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:32,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2023267546, now seen corresponding path program 1 times [2018-11-23 01:24:32,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:32,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:32,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:32,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:32,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:32,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:32,843 INFO L87 Difference]: Start difference. First operand 808 states and 1069 transitions. Second operand 5 states. [2018-11-23 01:24:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:33,093 INFO L93 Difference]: Finished difference Result 816 states and 1075 transitions. [2018-11-23 01:24:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:24:33,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 01:24:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:33,098 INFO L225 Difference]: With dead ends: 816 [2018-11-23 01:24:33,098 INFO L226 Difference]: Without dead ends: 810 [2018-11-23 01:24:33,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-23 01:24:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2018-11-23 01:24:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-23 01:24:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1068 transitions. [2018-11-23 01:24:33,141 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1068 transitions. Word has length 43 [2018-11-23 01:24:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:33,142 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1068 transitions. [2018-11-23 01:24:33,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1068 transitions. [2018-11-23 01:24:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 01:24:33,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:33,144 INFO L402 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] [2018-11-23 01:24:33,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:33,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:33,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1786995081, now seen corresponding path program 1 times [2018-11-23 01:24:33,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:33,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:33,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:33,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:33,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:33,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:33,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:33,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:33,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:33,192 INFO L87 Difference]: Start difference. First operand 808 states and 1068 transitions. Second operand 5 states. [2018-11-23 01:24:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:33,244 INFO L93 Difference]: Finished difference Result 824 states and 1083 transitions. [2018-11-23 01:24:33,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:24:33,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-23 01:24:33,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:33,248 INFO L225 Difference]: With dead ends: 824 [2018-11-23 01:24:33,248 INFO L226 Difference]: Without dead ends: 806 [2018-11-23 01:24:33,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-11-23 01:24:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2018-11-23 01:24:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-11-23 01:24:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1064 transitions. [2018-11-23 01:24:33,294 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1064 transitions. Word has length 44 [2018-11-23 01:24:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:33,294 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1064 transitions. [2018-11-23 01:24:33,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1064 transitions. [2018-11-23 01:24:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:24:33,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:33,296 INFO L402 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] [2018-11-23 01:24:33,296 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:33,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1151742481, now seen corresponding path program 1 times [2018-11-23 01:24:33,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:33,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:33,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:33,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:24:33,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:24:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:24:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:24:33,351 INFO L87 Difference]: Start difference. First operand 806 states and 1064 transitions. Second operand 4 states. [2018-11-23 01:24:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:33,490 INFO L93 Difference]: Finished difference Result 890 states and 1147 transitions. [2018-11-23 01:24:33,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:24:33,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-23 01:24:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:33,494 INFO L225 Difference]: With dead ends: 890 [2018-11-23 01:24:33,494 INFO L226 Difference]: Without dead ends: 557 [2018-11-23 01:24:33,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:24:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-11-23 01:24:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 520. [2018-11-23 01:24:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-23 01:24:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 659 transitions. [2018-11-23 01:24:33,524 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 659 transitions. Word has length 49 [2018-11-23 01:24:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:33,524 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 659 transitions. [2018-11-23 01:24:33,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:24:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 659 transitions. [2018-11-23 01:24:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 01:24:33,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:33,526 INFO L402 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] [2018-11-23 01:24:33,526 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:33,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1304384875, now seen corresponding path program 1 times [2018-11-23 01:24:33,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:33,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:33,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:33,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:33,567 INFO L87 Difference]: Start difference. First operand 520 states and 659 transitions. Second operand 3 states. [2018-11-23 01:24:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:33,631 INFO L93 Difference]: Finished difference Result 789 states and 1008 transitions. [2018-11-23 01:24:33,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:33,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-23 01:24:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:33,634 INFO L225 Difference]: With dead ends: 789 [2018-11-23 01:24:33,634 INFO L226 Difference]: Without dead ends: 528 [2018-11-23 01:24:33,635 INFO L631 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 [2018-11-23 01:24:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-11-23 01:24:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-11-23 01:24:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-23 01:24:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 670 transitions. [2018-11-23 01:24:33,677 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 670 transitions. Word has length 55 [2018-11-23 01:24:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:33,677 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 670 transitions. [2018-11-23 01:24:33,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 670 transitions. [2018-11-23 01:24:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 01:24:33,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:33,679 INFO L402 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] [2018-11-23 01:24:33,679 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:33,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1872524112, now seen corresponding path program 1 times [2018-11-23 01:24:33,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:33,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:33,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:33,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:33,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:33,708 INFO L87 Difference]: Start difference. First operand 528 states and 670 transitions. Second operand 3 states. [2018-11-23 01:24:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:33,815 INFO L93 Difference]: Finished difference Result 720 states and 928 transitions. [2018-11-23 01:24:33,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:33,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-23 01:24:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:33,819 INFO L225 Difference]: With dead ends: 720 [2018-11-23 01:24:33,819 INFO L226 Difference]: Without dead ends: 712 [2018-11-23 01:24:33,819 INFO L631 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 [2018-11-23 01:24:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-11-23 01:24:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 582. [2018-11-23 01:24:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-23 01:24:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 738 transitions. [2018-11-23 01:24:33,855 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 738 transitions. Word has length 52 [2018-11-23 01:24:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:33,855 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 738 transitions. [2018-11-23 01:24:33,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 738 transitions. [2018-11-23 01:24:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 01:24:33,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:33,857 INFO L402 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] [2018-11-23 01:24:33,857 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:33,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1629136409, now seen corresponding path program 1 times [2018-11-23 01:24:33,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:33,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:33,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:24:33,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:24:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:24:33,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:24:33,925 INFO L87 Difference]: Start difference. First operand 582 states and 738 transitions. Second operand 8 states. [2018-11-23 01:24:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:34,060 INFO L93 Difference]: Finished difference Result 612 states and 772 transitions. [2018-11-23 01:24:34,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:24:34,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 01:24:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:34,064 INFO L225 Difference]: With dead ends: 612 [2018-11-23 01:24:34,064 INFO L226 Difference]: Without dead ends: 608 [2018-11-23 01:24:34,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-23 01:24:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2018-11-23 01:24:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 01:24:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 759 transitions. [2018-11-23 01:24:34,098 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 759 transitions. Word has length 53 [2018-11-23 01:24:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:34,098 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 759 transitions. [2018-11-23 01:24:34,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:24:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 759 transitions. [2018-11-23 01:24:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 01:24:34,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:34,100 INFO L402 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] [2018-11-23 01:24:34,100 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:34,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1629413239, now seen corresponding path program 1 times [2018-11-23 01:24:34,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:34,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:34,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:34,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:24:34,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:24:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:24:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:24:34,173 INFO L87 Difference]: Start difference. First operand 600 states and 759 transitions. Second operand 8 states. [2018-11-23 01:24:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:34,237 INFO L93 Difference]: Finished difference Result 1000 states and 1288 transitions. [2018-11-23 01:24:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:24:34,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 01:24:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:34,239 INFO L225 Difference]: With dead ends: 1000 [2018-11-23 01:24:34,240 INFO L226 Difference]: Without dead ends: 649 [2018-11-23 01:24:34,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:24:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-11-23 01:24:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2018-11-23 01:24:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-11-23 01:24:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 804 transitions. [2018-11-23 01:24:34,262 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 804 transitions. Word has length 53 [2018-11-23 01:24:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:34,262 INFO L480 AbstractCegarLoop]: Abstraction has 629 states and 804 transitions. [2018-11-23 01:24:34,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:24:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 804 transitions. [2018-11-23 01:24:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 01:24:34,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:34,264 INFO L402 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] [2018-11-23 01:24:34,264 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:34,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1678961307, now seen corresponding path program 1 times [2018-11-23 01:24:34,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:34,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:34,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:34,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:34,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:34,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:34,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:34,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:34,364 INFO L87 Difference]: Start difference. First operand 629 states and 804 transitions. Second operand 5 states. [2018-11-23 01:24:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:34,394 INFO L93 Difference]: Finished difference Result 884 states and 1133 transitions. [2018-11-23 01:24:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:24:34,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 01:24:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:34,397 INFO L225 Difference]: With dead ends: 884 [2018-11-23 01:24:34,397 INFO L226 Difference]: Without dead ends: 610 [2018-11-23 01:24:34,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-11-23 01:24:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2018-11-23 01:24:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-23 01:24:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2018-11-23 01:24:34,424 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 61 [2018-11-23 01:24:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:34,424 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2018-11-23 01:24:34,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2018-11-23 01:24:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 01:24:34,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:34,426 INFO L402 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] [2018-11-23 01:24:34,426 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:34,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:34,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1631638869, now seen corresponding path program 1 times [2018-11-23 01:24:34,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:34,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:34,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:34,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:34,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:34,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:34,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:34,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:34,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:34,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:34,464 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 3 states. [2018-11-23 01:24:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:34,518 INFO L93 Difference]: Finished difference Result 709 states and 896 transitions. [2018-11-23 01:24:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:34,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-23 01:24:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:34,520 INFO L225 Difference]: With dead ends: 709 [2018-11-23 01:24:34,520 INFO L226 Difference]: Without dead ends: 684 [2018-11-23 01:24:34,521 INFO L631 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 [2018-11-23 01:24:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-11-23 01:24:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 674. [2018-11-23 01:24:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-11-23 01:24:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 855 transitions. [2018-11-23 01:24:34,547 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 855 transitions. Word has length 54 [2018-11-23 01:24:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:34,547 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 855 transitions. [2018-11-23 01:24:34,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 855 transitions. [2018-11-23 01:24:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 01:24:34,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:34,549 INFO L402 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] [2018-11-23 01:24:34,549 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:34,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:34,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1488359511, now seen corresponding path program 1 times [2018-11-23 01:24:34,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:34,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:34,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:34,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:34,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:24:34,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:24:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:24:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:34,630 INFO L87 Difference]: Start difference. First operand 674 states and 855 transitions. Second operand 7 states. [2018-11-23 01:24:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:35,011 INFO L93 Difference]: Finished difference Result 708 states and 893 transitions. [2018-11-23 01:24:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:35,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-23 01:24:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:35,013 INFO L225 Difference]: With dead ends: 708 [2018-11-23 01:24:35,013 INFO L226 Difference]: Without dead ends: 604 [2018-11-23 01:24:35,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:24:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-11-23 01:24:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 582. [2018-11-23 01:24:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-23 01:24:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 732 transitions. [2018-11-23 01:24:35,037 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 732 transitions. Word has length 54 [2018-11-23 01:24:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:35,037 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 732 transitions. [2018-11-23 01:24:35,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:24:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 732 transitions. [2018-11-23 01:24:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 01:24:35,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:35,038 INFO L402 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] [2018-11-23 01:24:35,038 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:35,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:35,039 INFO L82 PathProgramCache]: Analyzing trace with hash 39700081, now seen corresponding path program 1 times [2018-11-23 01:24:35,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:35,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:35,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:35,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:35,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:35,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:35,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:35,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:35,097 INFO L87 Difference]: Start difference. First operand 582 states and 732 transitions. Second operand 9 states. [2018-11-23 01:24:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:36,096 INFO L93 Difference]: Finished difference Result 777 states and 972 transitions. [2018-11-23 01:24:36,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 01:24:36,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-23 01:24:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:36,100 INFO L225 Difference]: With dead ends: 777 [2018-11-23 01:24:36,101 INFO L226 Difference]: Without dead ends: 701 [2018-11-23 01:24:36,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-23 01:24:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-11-23 01:24:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 589. [2018-11-23 01:24:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-11-23 01:24:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 733 transitions. [2018-11-23 01:24:36,171 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 733 transitions. Word has length 54 [2018-11-23 01:24:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:36,171 INFO L480 AbstractCegarLoop]: Abstraction has 589 states and 733 transitions. [2018-11-23 01:24:36,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 733 transitions. [2018-11-23 01:24:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 01:24:36,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:36,173 INFO L402 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] [2018-11-23 01:24:36,173 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:36,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash -381110486, now seen corresponding path program 1 times [2018-11-23 01:24:36,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:36,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:36,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:36,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:36,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:36,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:36,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:36,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:36,226 INFO L87 Difference]: Start difference. First operand 589 states and 733 transitions. Second operand 6 states. [2018-11-23 01:24:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:36,332 INFO L93 Difference]: Finished difference Result 608 states and 752 transitions. [2018-11-23 01:24:36,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:36,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-23 01:24:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:36,335 INFO L225 Difference]: With dead ends: 608 [2018-11-23 01:24:36,335 INFO L226 Difference]: Without dead ends: 569 [2018-11-23 01:24:36,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-11-23 01:24:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2018-11-23 01:24:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-11-23 01:24:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 708 transitions. [2018-11-23 01:24:36,374 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 708 transitions. Word has length 57 [2018-11-23 01:24:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:36,374 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 708 transitions. [2018-11-23 01:24:36,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 708 transitions. [2018-11-23 01:24:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 01:24:36,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:36,376 INFO L402 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] [2018-11-23 01:24:36,376 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:36,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1488177932, now seen corresponding path program 1 times [2018-11-23 01:24:36,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:36,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:36,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:36,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:36,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:36,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:36,423 INFO L87 Difference]: Start difference. First operand 569 states and 708 transitions. Second operand 5 states. [2018-11-23 01:24:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:36,601 INFO L93 Difference]: Finished difference Result 581 states and 719 transitions. [2018-11-23 01:24:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:24:36,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-11-23 01:24:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:36,604 INFO L225 Difference]: With dead ends: 581 [2018-11-23 01:24:36,604 INFO L226 Difference]: Without dead ends: 563 [2018-11-23 01:24:36,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-23 01:24:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 552. [2018-11-23 01:24:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 01:24:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 683 transitions. [2018-11-23 01:24:36,627 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 683 transitions. Word has length 56 [2018-11-23 01:24:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:36,627 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 683 transitions. [2018-11-23 01:24:36,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 683 transitions. [2018-11-23 01:24:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 01:24:36,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:36,629 INFO L402 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] [2018-11-23 01:24:36,629 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:36,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash -12265598, now seen corresponding path program 1 times [2018-11-23 01:24:36,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:36,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:36,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:36,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:36,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:36,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:36,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:36,665 INFO L87 Difference]: Start difference. First operand 552 states and 683 transitions. Second operand 5 states. [2018-11-23 01:24:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:36,820 INFO L93 Difference]: Finished difference Result 811 states and 1012 transitions. [2018-11-23 01:24:36,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:24:36,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-23 01:24:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:36,822 INFO L225 Difference]: With dead ends: 811 [2018-11-23 01:24:36,822 INFO L226 Difference]: Without dead ends: 552 [2018-11-23 01:24:36,823 INFO L631 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 [2018-11-23 01:24:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-11-23 01:24:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2018-11-23 01:24:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 01:24:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2018-11-23 01:24:36,846 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 65 [2018-11-23 01:24:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:36,846 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2018-11-23 01:24:36,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2018-11-23 01:24:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 01:24:36,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:36,847 INFO L402 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] [2018-11-23 01:24:36,848 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:36,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash 118426915, now seen corresponding path program 1 times [2018-11-23 01:24:36,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:36,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:36,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:24:36,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:24:36,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:24:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:24:36,877 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand 3 states. [2018-11-23 01:24:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:36,912 INFO L93 Difference]: Finished difference Result 837 states and 1046 transitions. [2018-11-23 01:24:36,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:24:36,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-23 01:24:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:36,914 INFO L225 Difference]: With dead ends: 837 [2018-11-23 01:24:36,914 INFO L226 Difference]: Without dead ends: 578 [2018-11-23 01:24:36,915 INFO L631 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 [2018-11-23 01:24:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-11-23 01:24:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 552. [2018-11-23 01:24:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 01:24:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2018-11-23 01:24:36,938 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 68 [2018-11-23 01:24:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:36,939 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2018-11-23 01:24:36,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:24:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2018-11-23 01:24:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 01:24:36,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:36,940 INFO L402 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] [2018-11-23 01:24:36,940 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:36,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2112462179, now seen corresponding path program 1 times [2018-11-23 01:24:36,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:36,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:36,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:36,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:36,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:36,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:36,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:37,000 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand 6 states. [2018-11-23 01:24:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:37,044 INFO L93 Difference]: Finished difference Result 805 states and 1000 transitions. [2018-11-23 01:24:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:37,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 01:24:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:37,047 INFO L225 Difference]: With dead ends: 805 [2018-11-23 01:24:37,047 INFO L226 Difference]: Without dead ends: 579 [2018-11-23 01:24:37,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-11-23 01:24:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 552. [2018-11-23 01:24:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 01:24:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 679 transitions. [2018-11-23 01:24:37,072 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 679 transitions. Word has length 68 [2018-11-23 01:24:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:37,072 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 679 transitions. [2018-11-23 01:24:37,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 679 transitions. [2018-11-23 01:24:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 01:24:37,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:37,073 INFO L402 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] [2018-11-23 01:24:37,074 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:37,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1566897792, now seen corresponding path program 1 times [2018-11-23 01:24:37,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:37,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:37,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:37,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:37,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:37,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:37,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:37,143 INFO L87 Difference]: Start difference. First operand 552 states and 679 transitions. Second operand 9 states. [2018-11-23 01:24:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:37,264 INFO L93 Difference]: Finished difference Result 569 states and 696 transitions. [2018-11-23 01:24:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:37,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-23 01:24:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:37,266 INFO L225 Difference]: With dead ends: 569 [2018-11-23 01:24:37,266 INFO L226 Difference]: Without dead ends: 548 [2018-11-23 01:24:37,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-11-23 01:24:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2018-11-23 01:24:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-11-23 01:24:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 673 transitions. [2018-11-23 01:24:37,289 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 673 transitions. Word has length 60 [2018-11-23 01:24:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:37,290 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 673 transitions. [2018-11-23 01:24:37,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 673 transitions. [2018-11-23 01:24:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 01:24:37,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:37,291 INFO L402 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] [2018-11-23 01:24:37,291 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:37,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -938148036, now seen corresponding path program 1 times [2018-11-23 01:24:37,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:37,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:37,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:37,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:37,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:37,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:37,337 INFO L87 Difference]: Start difference. First operand 548 states and 673 transitions. Second operand 9 states. [2018-11-23 01:24:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:37,439 INFO L93 Difference]: Finished difference Result 565 states and 690 transitions. [2018-11-23 01:24:37,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:37,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 01:24:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:37,441 INFO L225 Difference]: With dead ends: 565 [2018-11-23 01:24:37,442 INFO L226 Difference]: Without dead ends: 543 [2018-11-23 01:24:37,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-11-23 01:24:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2018-11-23 01:24:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-11-23 01:24:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 666 transitions. [2018-11-23 01:24:37,464 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 666 transitions. Word has length 61 [2018-11-23 01:24:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:37,464 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 666 transitions. [2018-11-23 01:24:37,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 666 transitions. [2018-11-23 01:24:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 01:24:37,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:37,465 INFO L402 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] [2018-11-23 01:24:37,466 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:37,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1868259506, now seen corresponding path program 1 times [2018-11-23 01:24:37,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:37,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:37,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:37,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:37,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:37,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:37,514 INFO L87 Difference]: Start difference. First operand 543 states and 666 transitions. Second operand 9 states. [2018-11-23 01:24:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:37,617 INFO L93 Difference]: Finished difference Result 560 states and 683 transitions. [2018-11-23 01:24:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:37,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 01:24:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:37,619 INFO L225 Difference]: With dead ends: 560 [2018-11-23 01:24:37,619 INFO L226 Difference]: Without dead ends: 539 [2018-11-23 01:24:37,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-11-23 01:24:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2018-11-23 01:24:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-23 01:24:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 660 transitions. [2018-11-23 01:24:37,642 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 660 transitions. Word has length 61 [2018-11-23 01:24:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:37,642 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 660 transitions. [2018-11-23 01:24:37,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 660 transitions. [2018-11-23 01:24:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 01:24:37,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:37,644 INFO L402 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] [2018-11-23 01:24:37,644 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:37,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1408260900, now seen corresponding path program 1 times [2018-11-23 01:24:37,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:37,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:37,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:37,717 INFO L87 Difference]: Start difference. First operand 539 states and 660 transitions. Second operand 5 states. [2018-11-23 01:24:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:37,942 INFO L93 Difference]: Finished difference Result 896 states and 1107 transitions. [2018-11-23 01:24:37,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:37,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-23 01:24:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:37,945 INFO L225 Difference]: With dead ends: 896 [2018-11-23 01:24:37,945 INFO L226 Difference]: Without dead ends: 643 [2018-11-23 01:24:37,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:24:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-23 01:24:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 613. [2018-11-23 01:24:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-23 01:24:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 754 transitions. [2018-11-23 01:24:37,976 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 754 transitions. Word has length 67 [2018-11-23 01:24:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:37,976 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 754 transitions. [2018-11-23 01:24:37,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 754 transitions. [2018-11-23 01:24:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 01:24:37,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:37,977 INFO L402 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] [2018-11-23 01:24:37,978 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:37,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1726599875, now seen corresponding path program 1 times [2018-11-23 01:24:37,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:37,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:37,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:37,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:38,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:38,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:38,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:38,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:38,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:38,031 INFO L87 Difference]: Start difference. First operand 613 states and 754 transitions. Second operand 9 states. [2018-11-23 01:24:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:38,151 INFO L93 Difference]: Finished difference Result 630 states and 771 transitions. [2018-11-23 01:24:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:38,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-11-23 01:24:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:38,153 INFO L225 Difference]: With dead ends: 630 [2018-11-23 01:24:38,153 INFO L226 Difference]: Without dead ends: 587 [2018-11-23 01:24:38,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-23 01:24:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-11-23 01:24:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-11-23 01:24:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 722 transitions. [2018-11-23 01:24:38,189 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 722 transitions. Word has length 65 [2018-11-23 01:24:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:38,189 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 722 transitions. [2018-11-23 01:24:38,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 722 transitions. [2018-11-23 01:24:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 01:24:38,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:38,191 INFO L402 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] [2018-11-23 01:24:38,191 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:38,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1495752637, now seen corresponding path program 1 times [2018-11-23 01:24:38,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:38,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:38,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:38,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:38,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:38,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:38,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:24:38,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:24:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:24:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:38,271 INFO L87 Difference]: Start difference. First operand 587 states and 722 transitions. Second operand 7 states. [2018-11-23 01:24:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:38,700 INFO L93 Difference]: Finished difference Result 891 states and 1100 transitions. [2018-11-23 01:24:38,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:24:38,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-23 01:24:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:38,702 INFO L225 Difference]: With dead ends: 891 [2018-11-23 01:24:38,702 INFO L226 Difference]: Without dead ends: 582 [2018-11-23 01:24:38,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:24:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-11-23 01:24:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 571. [2018-11-23 01:24:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-11-23 01:24:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 697 transitions. [2018-11-23 01:24:38,733 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 697 transitions. Word has length 79 [2018-11-23 01:24:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:38,733 INFO L480 AbstractCegarLoop]: Abstraction has 571 states and 697 transitions. [2018-11-23 01:24:38,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:24:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 697 transitions. [2018-11-23 01:24:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 01:24:38,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:38,734 INFO L402 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] [2018-11-23 01:24:38,735 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:38,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:38,735 INFO L82 PathProgramCache]: Analyzing trace with hash -229993641, now seen corresponding path program 1 times [2018-11-23 01:24:38,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:38,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:38,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:38,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:38,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:38,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:38,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:38,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:38,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:38,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:38,798 INFO L87 Difference]: Start difference. First operand 571 states and 697 transitions. Second operand 6 states. [2018-11-23 01:24:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:38,871 INFO L93 Difference]: Finished difference Result 888 states and 1109 transitions. [2018-11-23 01:24:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:38,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-23 01:24:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:38,874 INFO L225 Difference]: With dead ends: 888 [2018-11-23 01:24:38,874 INFO L226 Difference]: Without dead ends: 634 [2018-11-23 01:24:38,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-23 01:24:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 537. [2018-11-23 01:24:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-23 01:24:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 653 transitions. [2018-11-23 01:24:38,922 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 653 transitions. Word has length 80 [2018-11-23 01:24:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:38,922 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 653 transitions. [2018-11-23 01:24:38,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 653 transitions. [2018-11-23 01:24:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 01:24:38,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:38,923 INFO L402 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] [2018-11-23 01:24:38,923 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:38,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:38,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1921735627, now seen corresponding path program 1 times [2018-11-23 01:24:38,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:38,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:38,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:38,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:38,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:38,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:38,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:38,971 INFO L87 Difference]: Start difference. First operand 537 states and 653 transitions. Second operand 5 states. [2018-11-23 01:24:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:39,393 INFO L93 Difference]: Finished difference Result 973 states and 1159 transitions. [2018-11-23 01:24:39,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:39,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-23 01:24:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:39,395 INFO L225 Difference]: With dead ends: 973 [2018-11-23 01:24:39,395 INFO L226 Difference]: Without dead ends: 603 [2018-11-23 01:24:39,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-11-23 01:24:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 580. [2018-11-23 01:24:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-23 01:24:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 690 transitions. [2018-11-23 01:24:39,448 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 690 transitions. Word has length 75 [2018-11-23 01:24:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:39,448 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 690 transitions. [2018-11-23 01:24:39,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 690 transitions. [2018-11-23 01:24:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:24:39,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:39,449 INFO L402 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] [2018-11-23 01:24:39,449 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:39,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1118408541, now seen corresponding path program 1 times [2018-11-23 01:24:39,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:39,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:39,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:39,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:39,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:39,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:39,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:39,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:39,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:39,533 INFO L87 Difference]: Start difference. First operand 580 states and 690 transitions. Second operand 9 states. [2018-11-23 01:24:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:39,697 INFO L93 Difference]: Finished difference Result 582 states and 691 transitions. [2018-11-23 01:24:39,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:39,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-11-23 01:24:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:39,699 INFO L225 Difference]: With dead ends: 582 [2018-11-23 01:24:39,699 INFO L226 Difference]: Without dead ends: 446 [2018-11-23 01:24:39,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-23 01:24:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-11-23 01:24:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-11-23 01:24:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 532 transitions. [2018-11-23 01:24:39,740 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 532 transitions. Word has length 78 [2018-11-23 01:24:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:39,740 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 532 transitions. [2018-11-23 01:24:39,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 532 transitions. [2018-11-23 01:24:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 01:24:39,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:39,742 INFO L402 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] [2018-11-23 01:24:39,742 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:39,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:39,742 INFO L82 PathProgramCache]: Analyzing trace with hash -534163168, now seen corresponding path program 1 times [2018-11-23 01:24:39,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:39,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:39,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:39,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:39,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:39,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:39,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:39,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:39,831 INFO L87 Difference]: Start difference. First operand 446 states and 532 transitions. Second operand 9 states. [2018-11-23 01:24:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:39,967 INFO L93 Difference]: Finished difference Result 467 states and 554 transitions. [2018-11-23 01:24:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:39,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-11-23 01:24:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:39,969 INFO L225 Difference]: With dead ends: 467 [2018-11-23 01:24:39,969 INFO L226 Difference]: Without dead ends: 446 [2018-11-23 01:24:39,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:24:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-23 01:24:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-11-23 01:24:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-11-23 01:24:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 531 transitions. [2018-11-23 01:24:40,009 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 531 transitions. Word has length 85 [2018-11-23 01:24:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:40,009 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 531 transitions. [2018-11-23 01:24:40,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 531 transitions. [2018-11-23 01:24:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 01:24:40,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:40,011 INFO L402 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, 1, 1] [2018-11-23 01:24:40,011 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:40,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1730477814, now seen corresponding path program 1 times [2018-11-23 01:24:40,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:40,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:40,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:40,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:40,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:40,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:40,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:40,071 INFO L87 Difference]: Start difference. First operand 446 states and 531 transitions. Second operand 6 states. [2018-11-23 01:24:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:40,124 INFO L93 Difference]: Finished difference Result 479 states and 563 transitions. [2018-11-23 01:24:40,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:40,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-23 01:24:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:40,127 INFO L225 Difference]: With dead ends: 479 [2018-11-23 01:24:40,127 INFO L226 Difference]: Without dead ends: 440 [2018-11-23 01:24:40,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-23 01:24:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 387. [2018-11-23 01:24:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-23 01:24:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 455 transitions. [2018-11-23 01:24:40,165 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 455 transitions. Word has length 96 [2018-11-23 01:24:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:40,165 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 455 transitions. [2018-11-23 01:24:40,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 455 transitions. [2018-11-23 01:24:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 01:24:40,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:40,169 INFO L402 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, 1, 1] [2018-11-23 01:24:40,169 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:40,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash -342402432, now seen corresponding path program 1 times [2018-11-23 01:24:40,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:40,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:40,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:40,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:40,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:40,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:24:40,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:24:40,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:24:40,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:40,221 INFO L87 Difference]: Start difference. First operand 387 states and 455 transitions. Second operand 7 states. [2018-11-23 01:24:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:40,326 INFO L93 Difference]: Finished difference Result 730 states and 864 transitions. [2018-11-23 01:24:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:40,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-23 01:24:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:40,328 INFO L225 Difference]: With dead ends: 730 [2018-11-23 01:24:40,328 INFO L226 Difference]: Without dead ends: 685 [2018-11-23 01:24:40,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-23 01:24:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 367. [2018-11-23 01:24:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-23 01:24:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 430 transitions. [2018-11-23 01:24:40,354 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 430 transitions. Word has length 96 [2018-11-23 01:24:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:40,354 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 430 transitions. [2018-11-23 01:24:40,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:24:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 430 transitions. [2018-11-23 01:24:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 01:24:40,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:40,355 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:40,356 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:40,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:40,356 INFO L82 PathProgramCache]: Analyzing trace with hash 730694435, now seen corresponding path program 1 times [2018-11-23 01:24:40,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:40,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:40,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:40,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:24:40,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:40,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:24:40,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:24:40,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:24:40,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:40,428 INFO L87 Difference]: Start difference. First operand 367 states and 430 transitions. Second operand 11 states. [2018-11-23 01:24:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:40,500 INFO L93 Difference]: Finished difference Result 512 states and 604 transitions. [2018-11-23 01:24:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:24:40,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-11-23 01:24:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:40,502 INFO L225 Difference]: With dead ends: 512 [2018-11-23 01:24:40,502 INFO L226 Difference]: Without dead ends: 363 [2018-11-23 01:24:40,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:24:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-23 01:24:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 350. [2018-11-23 01:24:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-11-23 01:24:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 407 transitions. [2018-11-23 01:24:40,524 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 407 transitions. Word has length 101 [2018-11-23 01:24:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:40,525 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 407 transitions. [2018-11-23 01:24:40,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:24:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 407 transitions. [2018-11-23 01:24:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 01:24:40,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:40,526 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:40,526 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:40,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:40,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1042284347, now seen corresponding path program 1 times [2018-11-23 01:24:40,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:40,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:40,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:40,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 01:24:40,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:40,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:40,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:40,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:40,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:40,573 INFO L87 Difference]: Start difference. First operand 350 states and 407 transitions. Second operand 5 states. [2018-11-23 01:24:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:40,598 INFO L93 Difference]: Finished difference Result 601 states and 707 transitions. [2018-11-23 01:24:40,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:24:40,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-11-23 01:24:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:40,600 INFO L225 Difference]: With dead ends: 601 [2018-11-23 01:24:40,600 INFO L226 Difference]: Without dead ends: 349 [2018-11-23 01:24:40,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-23 01:24:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-11-23 01:24:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-23 01:24:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 405 transitions. [2018-11-23 01:24:40,621 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 405 transitions. Word has length 110 [2018-11-23 01:24:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:40,622 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 405 transitions. [2018-11-23 01:24:40,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 405 transitions. [2018-11-23 01:24:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 01:24:40,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:40,623 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:40,623 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:40,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:40,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1716247270, now seen corresponding path program 1 times [2018-11-23 01:24:40,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:40,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:40,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 01:24:40,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:40,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:40,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:40,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:40,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:40,678 INFO L87 Difference]: Start difference. First operand 349 states and 405 transitions. Second operand 6 states. [2018-11-23 01:24:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:40,709 INFO L93 Difference]: Finished difference Result 377 states and 432 transitions. [2018-11-23 01:24:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:40,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-11-23 01:24:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:40,711 INFO L225 Difference]: With dead ends: 377 [2018-11-23 01:24:40,711 INFO L226 Difference]: Without dead ends: 301 [2018-11-23 01:24:40,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-23 01:24:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2018-11-23 01:24:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-23 01:24:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 265 transitions. [2018-11-23 01:24:40,727 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 265 transitions. Word has length 110 [2018-11-23 01:24:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:40,727 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 265 transitions. [2018-11-23 01:24:40,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 265 transitions. [2018-11-23 01:24:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 01:24:40,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:40,728 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:40,729 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:40,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash 424283100, now seen corresponding path program 1 times [2018-11-23 01:24:40,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:40,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:40,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 01:24:40,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:40,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:40,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:40,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:40,807 INFO L87 Difference]: Start difference. First operand 239 states and 265 transitions. Second operand 9 states. [2018-11-23 01:24:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:40,867 INFO L93 Difference]: Finished difference Result 312 states and 353 transitions. [2018-11-23 01:24:40,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:40,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-11-23 01:24:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:40,869 INFO L225 Difference]: With dead ends: 312 [2018-11-23 01:24:40,869 INFO L226 Difference]: Without dead ends: 283 [2018-11-23 01:24:40,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-23 01:24:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2018-11-23 01:24:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-23 01:24:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2018-11-23 01:24:40,886 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 131 [2018-11-23 01:24:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:40,886 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2018-11-23 01:24:40,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2018-11-23 01:24:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 01:24:40,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:40,888 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:40,888 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:40,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash 765037084, now seen corresponding path program 1 times [2018-11-23 01:24:40,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:40,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 01:24:40,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:40,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:40,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:40,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:40,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:40,966 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand 9 states. [2018-11-23 01:24:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:41,036 INFO L93 Difference]: Finished difference Result 334 states and 374 transitions. [2018-11-23 01:24:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:41,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2018-11-23 01:24:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:41,055 INFO L225 Difference]: With dead ends: 334 [2018-11-23 01:24:41,055 INFO L226 Difference]: Without dead ends: 263 [2018-11-23 01:24:41,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-23 01:24:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 241. [2018-11-23 01:24:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-23 01:24:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 265 transitions. [2018-11-23 01:24:41,071 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 265 transitions. Word has length 132 [2018-11-23 01:24:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:41,072 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 265 transitions. [2018-11-23 01:24:41,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 265 transitions. [2018-11-23 01:24:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 01:24:41,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:41,073 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:41,073 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:41,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:41,073 INFO L82 PathProgramCache]: Analyzing trace with hash -672296009, now seen corresponding path program 1 times [2018-11-23 01:24:41,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:41,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:41,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:41,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:41,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 01:24:41,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:41,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:24:41,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:24:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:24:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:41,118 INFO L87 Difference]: Start difference. First operand 241 states and 265 transitions. Second operand 5 states. [2018-11-23 01:24:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:41,145 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-11-23 01:24:41,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:24:41,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-11-23 01:24:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:41,147 INFO L225 Difference]: With dead ends: 277 [2018-11-23 01:24:41,147 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 01:24:41,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:24:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 01:24:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-11-23 01:24:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-23 01:24:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 269 transitions. [2018-11-23 01:24:41,163 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 269 transitions. Word has length 147 [2018-11-23 01:24:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:41,163 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 269 transitions. [2018-11-23 01:24:41,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:24:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 269 transitions. [2018-11-23 01:24:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 01:24:41,165 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:41,165 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:41,165 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:41,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash -490809512, now seen corresponding path program 1 times [2018-11-23 01:24:41,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:41,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:41,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:41,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:41,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 01:24:41,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:41,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 01:24:41,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 01:24:41,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 01:24:41,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:24:41,278 INFO L87 Difference]: Start difference. First operand 245 states and 269 transitions. Second operand 15 states. [2018-11-23 01:24:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:41,406 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2018-11-23 01:24:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 01:24:41,406 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-11-23 01:24:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:41,407 INFO L225 Difference]: With dead ends: 311 [2018-11-23 01:24:41,407 INFO L226 Difference]: Without dead ends: 276 [2018-11-23 01:24:41,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-23 01:24:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-23 01:24:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 262. [2018-11-23 01:24:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 01:24:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 290 transitions. [2018-11-23 01:24:41,424 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 290 transitions. Word has length 147 [2018-11-23 01:24:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:41,424 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 290 transitions. [2018-11-23 01:24:41,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 01:24:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 290 transitions. [2018-11-23 01:24:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 01:24:41,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:41,426 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:41,426 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:41,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1053414808, now seen corresponding path program 1 times [2018-11-23 01:24:41,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:41,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:41,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 01:24:41,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:41,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:24:41,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:24:41,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:24:41,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:24:41,495 INFO L87 Difference]: Start difference. First operand 262 states and 290 transitions. Second operand 9 states. [2018-11-23 01:24:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:41,548 INFO L93 Difference]: Finished difference Result 351 states and 391 transitions. [2018-11-23 01:24:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:24:41,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-11-23 01:24:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:41,550 INFO L225 Difference]: With dead ends: 351 [2018-11-23 01:24:41,550 INFO L226 Difference]: Without dead ends: 270 [2018-11-23 01:24:41,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:24:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-23 01:24:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2018-11-23 01:24:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 01:24:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 289 transitions. [2018-11-23 01:24:41,568 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 289 transitions. Word has length 148 [2018-11-23 01:24:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:41,569 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 289 transitions. [2018-11-23 01:24:41,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:24:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 289 transitions. [2018-11-23 01:24:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-23 01:24:41,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:41,570 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:41,570 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:41,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1979295687, now seen corresponding path program 1 times [2018-11-23 01:24:41,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:41,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 01:24:41,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:41,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:24:41,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:41,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:24:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 01:24:41,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:24:41,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-11-23 01:24:41,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 01:24:41,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 01:24:41,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-23 01:24:41,931 INFO L87 Difference]: Start difference. First operand 262 states and 289 transitions. Second operand 21 states. [2018-11-23 01:24:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:42,082 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2018-11-23 01:24:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:24:42,084 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 150 [2018-11-23 01:24:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:42,085 INFO L225 Difference]: With dead ends: 307 [2018-11-23 01:24:42,085 INFO L226 Difference]: Without dead ends: 266 [2018-11-23 01:24:42,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-11-23 01:24:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-23 01:24:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2018-11-23 01:24:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 01:24:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 280 transitions. [2018-11-23 01:24:42,111 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 280 transitions. Word has length 150 [2018-11-23 01:24:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:42,111 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 280 transitions. [2018-11-23 01:24:42,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 01:24:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 280 transitions. [2018-11-23 01:24:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 01:24:42,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:42,113 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:42,113 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:42,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:42,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2052783288, now seen corresponding path program 1 times [2018-11-23 01:24:42,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:42,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:42,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:42,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:42,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 01:24:42,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:42,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:24:42,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:42,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:24:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 01:24:42,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:24:42,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-23 01:24:42,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 01:24:42,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 01:24:42,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-23 01:24:42,395 INFO L87 Difference]: Start difference. First operand 256 states and 280 transitions. Second operand 14 states. [2018-11-23 01:24:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:42,534 INFO L93 Difference]: Finished difference Result 317 states and 345 transitions. [2018-11-23 01:24:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:24:42,535 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-11-23 01:24:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:42,536 INFO L225 Difference]: With dead ends: 317 [2018-11-23 01:24:42,536 INFO L226 Difference]: Without dead ends: 242 [2018-11-23 01:24:42,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-23 01:24:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-23 01:24:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 228. [2018-11-23 01:24:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-23 01:24:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 246 transitions. [2018-11-23 01:24:42,558 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 246 transitions. Word has length 155 [2018-11-23 01:24:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:42,559 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 246 transitions. [2018-11-23 01:24:42,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 01:24:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 246 transitions. [2018-11-23 01:24:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 01:24:42,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:42,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:42,560 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:42,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1661694165, now seen corresponding path program 1 times [2018-11-23 01:24:42,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:42,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:42,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:42,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:42,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 01:24:42,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:42,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:24:42,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:24:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:24:42,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:24:42,615 INFO L87 Difference]: Start difference. First operand 228 states and 246 transitions. Second operand 6 states. [2018-11-23 01:24:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:42,650 INFO L93 Difference]: Finished difference Result 318 states and 344 transitions. [2018-11-23 01:24:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:24:42,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-11-23 01:24:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:42,651 INFO L225 Difference]: With dead ends: 318 [2018-11-23 01:24:42,652 INFO L226 Difference]: Without dead ends: 233 [2018-11-23 01:24:42,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:24:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-23 01:24:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2018-11-23 01:24:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-23 01:24:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 244 transitions. [2018-11-23 01:24:42,671 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 244 transitions. Word has length 157 [2018-11-23 01:24:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:42,671 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 244 transitions. [2018-11-23 01:24:42,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:24:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 244 transitions. [2018-11-23 01:24:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-23 01:24:42,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:42,673 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:42,673 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:42,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash 386317675, now seen corresponding path program 1 times [2018-11-23 01:24:42,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:42,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:42,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 01:24:42,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:24:42,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 01:24:42,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:24:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:24:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:24:42,755 INFO L87 Difference]: Start difference. First operand 227 states and 244 transitions. Second operand 10 states. [2018-11-23 01:24:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:43,168 INFO L93 Difference]: Finished difference Result 448 states and 483 transitions. [2018-11-23 01:24:43,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 01:24:43,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2018-11-23 01:24:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:43,170 INFO L225 Difference]: With dead ends: 448 [2018-11-23 01:24:43,170 INFO L226 Difference]: Without dead ends: 230 [2018-11-23 01:24:43,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-11-23 01:24:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-23 01:24:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-11-23 01:24:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-23 01:24:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 243 transitions. [2018-11-23 01:24:43,190 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 243 transitions. Word has length 158 [2018-11-23 01:24:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:43,190 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 243 transitions. [2018-11-23 01:24:43,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:24:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 243 transitions. [2018-11-23 01:24:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-23 01:24:43,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:24:43,191 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:24:43,191 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:24:43,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:24:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1977523987, now seen corresponding path program 1 times [2018-11-23 01:24:43,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:24:43,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:24:43,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:43,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:43,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:24:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 01:24:43,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:24:43,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:24:43,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:24:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:24:43,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:24:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 01:24:43,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:24:43,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-11-23 01:24:43,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 01:24:43,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 01:24:43,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-23 01:24:43,510 INFO L87 Difference]: Start difference. First operand 227 states and 243 transitions. Second operand 19 states. [2018-11-23 01:24:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:24:44,291 INFO L93 Difference]: Finished difference Result 298 states and 323 transitions. [2018-11-23 01:24:44,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 01:24:44,292 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 158 [2018-11-23 01:24:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:24:44,292 INFO L225 Difference]: With dead ends: 298 [2018-11-23 01:24:44,293 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 01:24:44,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 01:24:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 01:24:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 01:24:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 01:24:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 01:24:44,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2018-11-23 01:24:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:24:44,294 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:24:44,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 01:24:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:24:44,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:24:44,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 01:24:44,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:44,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:45,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:24:46,180 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 92 [2018-11-23 01:24:46,669 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 97 [2018-11-23 01:24:46,939 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 59 [2018-11-23 01:24:47,241 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 96 [2018-11-23 01:24:47,427 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2018-11-23 01:24:47,612 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 61 [2018-11-23 01:24:47,864 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 66 [2018-11-23 01:24:48,217 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2018-11-23 01:24:48,493 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2018-11-23 01:24:48,637 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2018-11-23 01:24:48,856 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 66 [2018-11-23 01:24:49,083 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 66 [2018-11-23 01:24:49,600 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 77 [2018-11-23 01:24:50,273 WARN L180 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 107 [2018-11-23 01:24:50,535 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 93 [2018-11-23 01:24:50,652 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2018-11-23 01:24:50,807 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2018-11-23 01:24:50,968 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2018-11-23 01:24:51,230 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-11-23 01:24:51,387 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2018-11-23 01:24:51,707 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 66 [2018-11-23 01:24:51,824 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2018-11-23 01:24:52,148 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 90 [2018-11-23 01:24:52,319 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2018-11-23 01:24:52,560 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2018-11-23 01:24:53,179 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 88 [2018-11-23 01:24:53,684 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2018-11-23 01:24:53,906 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 99 [2018-11-23 01:24:54,025 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2018-11-23 01:24:54,991 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 99 [2018-11-23 01:24:55,162 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2018-11-23 01:24:55,621 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2018-11-23 01:24:55,952 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-11-23 01:24:56,281 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-11-23 01:24:56,431 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2018-11-23 01:24:57,135 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2018-11-23 01:24:57,511 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 78 [2018-11-23 01:24:57,694 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2018-11-23 01:24:58,063 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2018-11-23 01:24:58,535 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2018-11-23 01:24:58,641 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2018-11-23 01:24:58,892 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2018-11-23 01:24:59,138 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 878 899) no Hoare annotation was computed. [2018-11-23 01:24:59,138 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 878 899) no Hoare annotation was computed. [2018-11-23 01:24:59,138 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 878 899) the Hoare annotation is: true [2018-11-23 01:24:59,138 INFO L451 ceAbstractionStarter]: At program point L888(lines 887 897) the Hoare annotation is: true [2018-11-23 01:24:59,138 INFO L451 ceAbstractionStarter]: At program point L886(lines 885 897) the Hoare annotation is: true [2018-11-23 01:24:59,138 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 897) no Hoare annotation was computed. [2018-11-23 01:24:59,138 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 889 896) no Hoare annotation was computed. [2018-11-23 01:24:59,138 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 889 896) no Hoare annotation was computed. [2018-11-23 01:24:59,138 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 69 89) no Hoare annotation was computed. [2018-11-23 01:24:59,138 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 69 89) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (< 0 ~MaximumInterfaceType~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-23 01:24:59,138 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 69 89) no Hoare annotation was computed. [2018-11-23 01:24:59,138 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 900 920) no Hoare annotation was computed. [2018-11-23 01:24:59,139 INFO L451 ceAbstractionStarter]: At program point L909(lines 908 918) the Hoare annotation is: true [2018-11-23 01:24:59,139 INFO L451 ceAbstractionStarter]: At program point L907(lines 906 918) the Hoare annotation is: true [2018-11-23 01:24:59,139 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 918) no Hoare annotation was computed. [2018-11-23 01:24:59,139 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 900 920) the Hoare annotation is: true [2018-11-23 01:24:59,139 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 910 917) no Hoare annotation was computed. [2018-11-23 01:24:59,139 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 900 920) no Hoare annotation was computed. [2018-11-23 01:24:59,139 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 910 917) no Hoare annotation was computed. [2018-11-23 01:24:59,139 INFO L444 ceAbstractionStarter]: At program point L225(lines 224 423) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse5 (+ ~DC~0 2)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,139 INFO L448 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2018-11-23 01:24:59,139 INFO L444 ceAbstractionStarter]: At program point L283(line 283) the Hoare annotation is: (let ((.cse0 (and (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-23 01:24:59,139 INFO L448 ceAbstractionStarter]: For program point L283-1(line 283) no Hoare annotation was computed. [2018-11-23 01:24:59,139 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 248) no Hoare annotation was computed. [2018-11-23 01:24:59,139 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 428) no Hoare annotation was computed. [2018-11-23 01:24:59,140 INFO L444 ceAbstractionStarter]: At program point L366(line 366) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,140 INFO L448 ceAbstractionStarter]: For program point L399-1(lines 399 403) no Hoare annotation was computed. [2018-11-23 01:24:59,140 INFO L448 ceAbstractionStarter]: For program point L366-1(lines 362 368) no Hoare annotation was computed. [2018-11-23 01:24:59,140 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2018-11-23 01:24:59,140 INFO L448 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2018-11-23 01:24:59,140 INFO L448 ceAbstractionStarter]: For program point L267-2(lines 267 269) no Hoare annotation was computed. [2018-11-23 01:24:59,140 INFO L444 ceAbstractionStarter]: At program point L391(line 391) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-23 01:24:59,140 INFO L448 ceAbstractionStarter]: For program point L391-1(line 391) no Hoare annotation was computed. [2018-11-23 01:24:59,140 INFO L444 ceAbstractionStarter]: At program point L383(line 383) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,140 INFO L448 ceAbstractionStarter]: For program point L383-1(lines 379 385) no Hoare annotation was computed. [2018-11-23 01:24:59,140 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 425) no Hoare annotation was computed. [2018-11-23 01:24:59,141 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2018-11-23 01:24:59,141 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 347) no Hoare annotation was computed. [2018-11-23 01:24:59,141 INFO L444 ceAbstractionStarter]: At program point L210(lines 209 428) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (= ~s~0 1)) (.cse6 (= 0 FloppyPnp_~ntStatus~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6)) (or (and .cse2 .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,141 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 231 421) no Hoare annotation was computed. [2018-11-23 01:24:59,141 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 231 421) no Hoare annotation was computed. [2018-11-23 01:24:59,141 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 332) no Hoare annotation was computed. [2018-11-23 01:24:59,141 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 321 333) no Hoare annotation was computed. [2018-11-23 01:24:59,141 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 422) no Hoare annotation was computed. [2018-11-23 01:24:59,141 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 2)) (.cse5 (= |old(~s~0)| ~NP~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not .cse5) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse5 (<= .cse6 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse7 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,141 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-23 01:24:59,142 INFO L444 ceAbstractionStarter]: At program point L252(line 252) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-23 01:24:59,142 INFO L448 ceAbstractionStarter]: For program point L252-1(line 252) no Hoare annotation was computed. [2018-11-23 01:24:59,142 INFO L444 ceAbstractionStarter]: At program point L277(line 277) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,142 INFO L448 ceAbstractionStarter]: For program point L277-1(lines 273 279) no Hoare annotation was computed. [2018-11-23 01:24:59,142 INFO L444 ceAbstractionStarter]: At program point L401(line 401) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= 1 ~NP~0) (<= .cse4 ~IPC~0) (= ~SKIP2~0 ~s~0) (<= .cse5 ~MPR1~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (and (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~pended~0) (= 0 ~compRegistered~0)) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,142 INFO L448 ceAbstractionStarter]: For program point L401-1(line 401) no Hoare annotation was computed. [2018-11-23 01:24:59,142 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 398) no Hoare annotation was computed. [2018-11-23 01:24:59,142 INFO L448 ceAbstractionStarter]: For program point L393-2(lines 231 419) no Hoare annotation was computed. [2018-11-23 01:24:59,143 INFO L444 ceAbstractionStarter]: At program point L228(lines 227 422) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~s~0 1) (<= .cse5 ~MPR1~0) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,143 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 197) no Hoare annotation was computed. [2018-11-23 01:24:59,143 INFO L448 ceAbstractionStarter]: For program point L195-2(lines 195 197) no Hoare annotation was computed. [2018-11-23 01:24:59,143 INFO L444 ceAbstractionStarter]: At program point L344(line 344) the Hoare annotation is: (let ((.cse0 (and (<= FloppyPnp_~__cil_tmp30~0 259) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 259 FloppyPnp_~__cil_tmp30~0) (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-11-23 01:24:59,143 INFO L448 ceAbstractionStarter]: For program point L344-1(line 344) no Hoare annotation was computed. [2018-11-23 01:24:59,143 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 427) no Hoare annotation was computed. [2018-11-23 01:24:59,143 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 309) no Hoare annotation was computed. [2018-11-23 01:24:59,143 INFO L444 ceAbstractionStarter]: At program point L328(line 328) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,143 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 293) no Hoare annotation was computed. [2018-11-23 01:24:59,143 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 424) no Hoare annotation was computed. [2018-11-23 01:24:59,144 INFO L444 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,144 INFO L448 ceAbstractionStarter]: For program point L411-1(lines 407 413) no Hoare annotation was computed. [2018-11-23 01:24:59,144 INFO L444 ceAbstractionStarter]: At program point L246(line 246) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,144 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 242 248) no Hoare annotation was computed. [2018-11-23 01:24:59,144 INFO L444 ceAbstractionStarter]: At program point L205(line 205) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-23 01:24:59,144 INFO L448 ceAbstractionStarter]: For program point L238-1(lines 231 419) no Hoare annotation was computed. [2018-11-23 01:24:59,144 INFO L448 ceAbstractionStarter]: For program point L205-1(line 205) no Hoare annotation was computed. [2018-11-23 01:24:59,145 INFO L444 ceAbstractionStarter]: At program point L395(lines 395 396) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-23 01:24:59,145 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 368) no Hoare annotation was computed. [2018-11-23 01:24:59,145 INFO L448 ceAbstractionStarter]: For program point L395-1(lines 395 396) no Hoare annotation was computed. [2018-11-23 01:24:59,145 INFO L444 ceAbstractionStarter]: At program point L230(lines 229 422) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse5 (+ ~DC~0 2)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,145 INFO L444 ceAbstractionStarter]: At program point L420(lines 231 421) the Hoare annotation is: (let ((.cse20 (+ ~SKIP1~0 2)) (.cse19 (+ ~DC~0 2)) (.cse21 (+ ~DC~0 5)) (.cse18 (+ ~NP~0 2))) (let ((.cse9 (= ~SKIP2~0 ~s~0)) (.cse11 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse14 (<= ~compRegistered~0 0)) (.cse6 (<= .cse18 ~SKIP1~0)) (.cse15 (= ~DC~0 ~s~0)) (.cse22 (= 0 ~pended~0)) (.cse8 (<= .cse21 ~IPC~0)) (.cse16 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= .cse19 ~SKIP2~0)) (.cse10 (<= .cse20 ~MPR1~0)) (.cse17 (= ~NP~0 |old(~s~0)|)) (.cse7 (<= 1 ~NP~0)) (.cse13 (<= ~MPR3~0 6))) (let ((.cse4 (and (and (and (and .cse6 (and .cse15 .cse22 .cse8 .cse16 .cse12) .cse10 .cse17) .cse7) .cse13) (not (= 259 FloppyPnp_~ntStatus~0)))) (.cse5 (and .cse6 .cse22 .cse16 .cse8 .cse12 .cse9 .cse10 .cse11 .cse14)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse18) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse19) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse20) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse21) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and .cse6 .cse15 (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) .cse8 .cse16 .cse12 .cse10 .cse17 .cse14)) (.cse3 (and .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~customIrp~0) .cse11 .cse12 (<= ~NP~0 1) .cse13 (= |old(~customIrp~0)| ~customIrp~0) (not (= |old(~s~0)| ~MPR3~0)) .cse14 (<= 6 ~MPR3~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse4 .cse5 .cse0 .cse1 .cse2 .cse3))))) [2018-11-23 01:24:59,146 INFO L444 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (let ((.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)))) (let ((.cse0 (and (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) .cse4 .cse5)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (not (= 259 FloppyPnp_~ntStatus~0)) .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3)))) [2018-11-23 01:24:59,146 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 333) no Hoare annotation was computed. [2018-11-23 01:24:59,146 INFO L444 ceAbstractionStarter]: At program point L222(lines 218 425) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= ~s~0 ~NP~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse6 ~SKIP2~0) (= 0 ~myStatus~0) (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,146 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 385) no Hoare annotation was computed. [2018-11-23 01:24:59,146 INFO L444 ceAbstractionStarter]: At program point L313(line 313) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 2)) (.cse5 (= |old(~s~0)| ~NP~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not .cse5) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse5 (<= .cse6 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse7 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,146 INFO L448 ceAbstractionStarter]: For program point L313-1(line 313) no Hoare annotation was computed. [2018-11-23 01:24:59,146 INFO L444 ceAbstractionStarter]: At program point L338(line 338) the Hoare annotation is: (let ((.cse5 (+ ~DC~0 2)) (.cse4 (+ ~SKIP1~0 2)) (.cse3 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse4) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse3) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~IPC~0) (= 0 ~pended~0) (= ~s~0 1) (<= .cse4 ~MPR1~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= ~s~0 ~NP~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse5 ~SKIP2~0) (= 0 ~myStatus~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= (+ ~s~0 2) ~SKIP1~0) (<= 6 ~MPR3~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L338-1(line 338) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L444 ceAbstractionStarter]: At program point L264(lines 264 265) the Hoare annotation is: (let ((.cse0 (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L297-1(lines 231 419) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 162 435) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 426) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L444 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 2)) (.cse5 (= |old(~s~0)| ~NP~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not .cse5) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse5 (<= .cse6 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse7 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L372-1(line 372) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 279) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L430-2(lines 430 432) no Hoare annotation was computed. [2018-11-23 01:24:59,147 INFO L444 ceAbstractionStarter]: At program point L323(line 323) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,147 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 423) no Hoare annotation was computed. [2018-11-23 01:24:59,148 INFO L444 ceAbstractionStarter]: At program point L216(lines 212 427) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= ~s~0 ~NP~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,148 INFO L444 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-23 01:24:59,148 INFO L448 ceAbstractionStarter]: For program point L307-1(lines 303 309) no Hoare annotation was computed. [2018-11-23 01:24:59,148 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 162 435) no Hoare annotation was computed. [2018-11-23 01:24:59,148 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 208) no Hoare annotation was computed. [2018-11-23 01:24:59,148 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 162 435) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 (and .cse2 .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5)) (or (not (= |old(~myStatus~0)| 0)) (and .cse2 .cse3 .cse4 (= 0 ~myStatus~0) .cse5) .cse0 .cse1))) [2018-11-23 01:24:59,148 INFO L444 ceAbstractionStarter]: At program point L291(line 291) the Hoare annotation is: (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-23 01:24:59,148 INFO L444 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= ~s~0 ~NP~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,148 INFO L444 ceAbstractionStarter]: At program point L795(line 795) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-23 01:24:59,148 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 669 808) no Hoare annotation was computed. [2018-11-23 01:24:59,148 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2018-11-23 01:24:59,148 INFO L444 ceAbstractionStarter]: At program point L771(line 771) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-23 01:24:59,149 INFO L444 ceAbstractionStarter]: At program point L780(lines 767 800) the Hoare annotation is: (let ((.cse8 (= ~DC~0 ~s~0)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= ~compRegistered~0 0))) (let ((.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (or (and .cse8 .cse4 .cse3 .cse5) (and .cse0 .cse3 .cse4 .cse5 .cse6)))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse0 .cse1 .cse2 (<= ~SKIP2~0 ~s~0) (and .cse3 .cse4 .cse5 .cse6)) (not (= |old(~compRegistered~0)| 0)) (and (and (<= ~MPR3~0 6) (and .cse1 (<= 1 ~NP~0) .cse2 .cse7)) (not (= 259 main_~status~1))) (and .cse1 (<= (+ main_~status~1 1073741823) 0) .cse2 .cse7) (and .cse7 (= 0 main_~status~1)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse8 .cse4 .cse3 .cse5 (<= (+ main_~status~1 1073741738) 0)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)))) [2018-11-23 01:24:59,149 INFO L448 ceAbstractionStarter]: For program point L739(line 739) no Hoare annotation was computed. [2018-11-23 01:24:59,149 INFO L444 ceAbstractionStarter]: At program point L764(lines 757 803) the Hoare annotation is: (let ((.cse4 (= ~SKIP2~0 ~s~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= 0 main_~status~1)) (.cse6 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse7 .cse1 .cse2 .cse3 (<= (+ main_~status~1 1073741738) 0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse6) (and (and (<= ~MPR3~0 6) (and .cse8 (<= 1 ~NP~0) (and .cse7 .cse1 .cse2 .cse3) .cse9)) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse5 (= ~IPC~0 ~s~0) .cse6) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-23 01:24:59,149 INFO L444 ceAbstractionStarter]: At program point L789(line 789) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-23 01:24:59,149 INFO L444 ceAbstractionStarter]: At program point L756(lines 749 804) the Hoare annotation is: (let ((.cse6 (= 0 main_~status~1)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse11 (<= ~MPR3~0 6)) (.cse10 (<= 1 ~NP~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= ~compRegistered~0 0)) (.cse12 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= ~IPC~0 ~s~0) .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse8 .cse10 .cse1 .cse5 .cse9 .cse4 (<= ~NP~0 1) .cse11 (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0) .cse7) (and (and .cse11 (and .cse8 .cse10 .cse9 (and .cse12 .cse1 .cse2 .cse3 .cse4))) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse8 .cse12 .cse1 .cse3 .cse4 (<= (+ main_~status~1 1073741823) 0) .cse9 .cse7) (and .cse12 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~1 1073741738) 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-23 01:24:59,149 INFO L448 ceAbstractionStarter]: For program point L723(lines 709 748) no Hoare annotation was computed. [2018-11-23 01:24:59,149 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 669 808) no Hoare annotation was computed. [2018-11-23 01:24:59,149 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 736 746) no Hoare annotation was computed. [2018-11-23 01:24:59,149 INFO L444 ceAbstractionStarter]: At program point L707(line 707) the Hoare annotation is: (or (and (= main_~status~1 ~lowerDriverReturn~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 main_~status~1) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-23 01:24:59,149 INFO L448 ceAbstractionStarter]: For program point L707-1(lines 703 807) no Hoare annotation was computed. [2018-11-23 01:24:59,149 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 736 746) no Hoare annotation was computed. [2018-11-23 01:24:59,149 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 669 808) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-23 01:24:59,149 INFO L448 ceAbstractionStarter]: For program point L765(lines 749 804) no Hoare annotation was computed. [2018-11-23 01:24:59,150 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 747) no Hoare annotation was computed. [2018-11-23 01:24:59,150 INFO L448 ceAbstractionStarter]: For program point L782(lines 782 784) no Hoare annotation was computed. [2018-11-23 01:24:59,150 INFO L448 ceAbstractionStarter]: For program point L766(lines 766 801) no Hoare annotation was computed. [2018-11-23 01:24:59,150 INFO L444 ceAbstractionStarter]: At program point L733(lines 732 747) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (<= ~MPR3~0 6)) (.cse9 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (<= 6 ~MPR3~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 main_~status~1)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~s~0 ~NP~0) .cse7 (<= ~NP~0 1) .cse8 (<= (+ ~myStatus~0 1073741637) 0) .cse9 .cse10 .cse11) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse8 .cse9 .cse11 .cse0 (= ~s~0 ~NP~0) .cse4 .cse5 .cse6 .cse7 .cse10) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-23 01:24:59,150 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2018-11-23 01:24:59,150 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 754) no Hoare annotation was computed. [2018-11-23 01:24:59,150 INFO L444 ceAbstractionStarter]: At program point L709(lines 703 807) the Hoare annotation is: (let ((.cse11 (<= 1 ~NP~0)) (.cse12 (<= ~MPR3~0 6)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (= 0 ~pended~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse5 (= 0 main_~status~1)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= ~DC~0 ~s~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6) (not (= |old(~compRegistered~0)| 0)) (and .cse7 .cse1 .cse3 .cse2 .cse4 (<= (+ main_~status~1 1073741738) 0)) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse6) (and .cse0 .cse8 .cse11 .cse3 .cse9 .cse10 .cse4 (<= ~NP~0 1) .cse12 (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0) .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (and (and .cse8 .cse11 (and .cse7 .cse1 .cse3 .cse2 .cse4) .cse10) .cse12) (not (= 259 main_~status~1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse8 .cse7 .cse3 .cse2 .cse4 (<= (+ main_~status~1 1073741823) 0) .cse10 .cse6) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-23 01:24:59,150 INFO L448 ceAbstractionStarter]: For program point L767(lines 767 800) no Hoare annotation was computed. [2018-11-23 01:24:59,150 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 721) no Hoare annotation was computed. [2018-11-23 01:24:59,150 INFO L444 ceAbstractionStarter]: At program point L718-2(lines 718 721) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (<= ~MPR3~0 6)) (.cse9 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (<= 6 ~MPR3~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 main_~status~1)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~s~0 ~NP~0) .cse7 (<= ~NP~0 1) .cse8 (<= (+ ~myStatus~0 1073741637) 0) .cse9 .cse10 .cse11) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse8 .cse9 .cse11 .cse0 (= ~s~0 ~NP~0) .cse4 .cse5 .cse6 .cse7 .cse10) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-23 01:24:59,151 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 778) no Hoare annotation was computed. [2018-11-23 01:24:59,151 INFO L444 ceAbstractionStarter]: At program point L735(lines 734 747) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-23 01:24:59,151 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 797) no Hoare annotation was computed. [2018-11-23 01:24:59,151 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 775) no Hoare annotation was computed. [2018-11-23 01:24:59,151 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 798) no Hoare annotation was computed. [2018-11-23 01:24:59,151 INFO L444 ceAbstractionStarter]: At program point L929(line 929) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 1 |old(~s~0)|)) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1))) [2018-11-23 01:24:59,151 INFO L448 ceAbstractionStarter]: For program point L929-1(lines 921 934) no Hoare annotation was computed. [2018-11-23 01:24:59,151 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 921 934) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 1 |old(~s~0)|)) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 (= ~s~0 |old(~s~0)|)) (or .cse0 (not (= ~myStatus~0 0)) .cse1 (= |old(~s~0)| ~s~0)))) [2018-11-23 01:24:59,151 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 921 934) no Hoare annotation was computed. [2018-11-23 01:24:59,152 INFO L451 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: true [2018-11-23 01:24:59,152 INFO L448 ceAbstractionStarter]: For program point L609-1(line 609) no Hoare annotation was computed. [2018-11-23 01:24:59,152 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 604 613) the Hoare annotation is: true [2018-11-23 01:24:59,152 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 604 613) no Hoare annotation was computed. [2018-11-23 01:24:59,152 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 604 613) no Hoare annotation was computed. [2018-11-23 01:24:59,152 INFO L448 ceAbstractionStarter]: For program point L1057(lines 1057 1069) no Hoare annotation was computed. [2018-11-23 01:24:59,152 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1030 1071) no Hoare annotation was computed. [2018-11-23 01:24:59,152 INFO L444 ceAbstractionStarter]: At program point L1043(lines 1035 1054) the Hoare annotation is: (let ((.cse17 (not (= 0 ~pended~0))) (.cse18 (< ~compRegistered~0 1)) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< 6 ~MPR3~0)) (.cse22 (< ~NP~0 1)) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< |old(~setEventCalled~0)| 1)) (.cse23 (< ~MPR3~0 |old(~s~0)|)) (.cse24 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse17 .cse18 .cse7 .cse12)) (.cse25 (< |old(~s~0)| ~MPR3~0)) (.cse19 (< 1 |old(~setEventCalled~0)|))) (let ((.cse14 (< 0 (+ ~myStatus~0 1073741637))) (.cse0 (or .cse5 .cse6 .cse22 .cse11 .cse16 .cse23 .cse24 .cse25 .cse19)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse20 (<= 1 ~setEventCalled~0)) (.cse3 (= ~s~0 1)) (.cse21 (<= ~setEventCalled~0 1)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse15 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse8 (< ~MPR3~0 6)) (.cse9 (not (= 1 |old(~s~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= ~myStatus~0 0))) (.cse13 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~compRegistered~0 0)) .cse12 .cse13) (or .cse14 .cse2 (or .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse18 .cse12 .cse19) (and .cse3 .cse4 .cse20 .cse21)) (or .cse14 .cse0 .cse2) (or (and .cse4 .cse20 .cse3 .cse21) .cse1 .cse2 (or .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse18 .cse12 .cse13 .cse19)) (or .cse5 .cse6 .cse22 .cse1 .cse11 .cse16 .cse23 .cse24 .cse13 .cse25 .cse19))))) [2018-11-23 01:24:59,152 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1061 1068) no Hoare annotation was computed. [2018-11-23 01:24:59,152 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1061 1068) no Hoare annotation was computed. [2018-11-23 01:24:59,153 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1054) no Hoare annotation was computed. [2018-11-23 01:24:59,153 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1069) the Hoare annotation is: (let ((.cse27 (+ ~DC~0 5)) (.cse30 (+ ~DC~0 2)) (.cse28 (= 0 ~pended~0))) (let ((.cse25 (= ~s~0 1)) (.cse14 (not .cse28)) (.cse15 (< ~compRegistered~0 1)) (.cse8 (< ~SKIP2~0 .cse30)) (.cse16 (< ~IPC~0 .cse27)) (.cse29 (+ ~SKIP1~0 2))) (let ((.cse20 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< 6 ~MPR3~0)) (.cse21 (< ~NP~0 1)) (.cse12 (< ~MPR1~0 .cse29)) (.cse13 (< |old(~setEventCalled~0)| 1)) (.cse22 (< ~MPR3~0 |old(~s~0)|)) (.cse23 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse14 .cse15 .cse8 .cse16)) (.cse24 (< |old(~s~0)| ~MPR3~0)) (.cse18 (< 1 |old(~setEventCalled~0)|)) (.cse19 (and (<= .cse27 ~IPC~0) .cse28 .cse25 (<= .cse29 ~MPR1~0) (<= 1 ~compRegistered~0) (<= ~s~0 ~NP~0) (<= .cse30 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0))) (.cse26 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse4 (and .cse19 .cse26)) (.cse1 (< 0 (+ ~myStatus~0 1073741637))) (.cse7 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~MPR3~0 6)) (.cse10 (not (= 1 |old(~s~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse17 (not (= |old(~customIrp~0)| 0))) (.cse0 (and .cse25 .cse26)) (.cse2 (or .cse20 .cse6 .cse21 .cse12 .cse13 .cse22 .cse23 .cse24 .cse18)) (.cse5 (not (= ~myStatus~0 0))) (.cse3 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or (or .cse4 (and (= |old(~customIrp~0)| 1) .cse19 (= 0 ~customIrp~0))) .cse1 .cse3 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18)) (or .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 (not (= ~compRegistered~0 0)) .cse16 .cse17) (or .cse20 .cse6 .cse21 .cse5 .cse0 .cse12 .cse13 .cse22 .cse23 .cse17 .cse24 .cse18) (or .cse0 .cse2 .cse5 .cse3)))))) [2018-11-23 01:24:59,153 INFO L444 ceAbstractionStarter]: At program point L1058(lines 1057 1069) the Hoare annotation is: (let ((.cse27 (+ ~DC~0 5)) (.cse30 (+ ~DC~0 2)) (.cse28 (= 0 ~pended~0))) (let ((.cse25 (= ~s~0 1)) (.cse14 (not .cse28)) (.cse15 (< ~compRegistered~0 1)) (.cse8 (< ~SKIP2~0 .cse30)) (.cse16 (< ~IPC~0 .cse27)) (.cse29 (+ ~SKIP1~0 2))) (let ((.cse20 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< 6 ~MPR3~0)) (.cse21 (< ~NP~0 1)) (.cse12 (< ~MPR1~0 .cse29)) (.cse13 (< |old(~setEventCalled~0)| 1)) (.cse22 (< ~MPR3~0 |old(~s~0)|)) (.cse23 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse14 .cse15 .cse8 .cse16)) (.cse24 (< |old(~s~0)| ~MPR3~0)) (.cse18 (< 1 |old(~setEventCalled~0)|)) (.cse19 (and (<= .cse27 ~IPC~0) .cse28 .cse25 (<= .cse29 ~MPR1~0) (<= 1 ~compRegistered~0) (<= ~s~0 ~NP~0) (<= .cse30 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0))) (.cse26 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse4 (and .cse19 .cse26)) (.cse1 (< 0 (+ ~myStatus~0 1073741637))) (.cse7 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~MPR3~0 6)) (.cse10 (not (= 1 |old(~s~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse17 (not (= |old(~customIrp~0)| 0))) (.cse0 (and .cse25 .cse26)) (.cse2 (or .cse20 .cse6 .cse21 .cse12 .cse13 .cse22 .cse23 .cse24 .cse18)) (.cse5 (not (= ~myStatus~0 0))) (.cse3 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or (or .cse4 (and (= |old(~customIrp~0)| 1) .cse19 (= 0 ~customIrp~0))) .cse1 .cse3 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18)) (or .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 (not (= ~compRegistered~0 0)) .cse16 .cse17) (or .cse20 .cse6 .cse21 .cse5 .cse0 .cse12 .cse13 .cse22 .cse23 .cse17 .cse24 .cse18) (or .cse0 .cse2 .cse5 .cse3)))))) [2018-11-23 01:24:59,153 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1030 1071) no Hoare annotation was computed. [2018-11-23 01:24:59,154 INFO L444 ceAbstractionStarter]: At program point L1050(line 1050) the Hoare annotation is: (let ((.cse15 (not (= 0 ~pended~0))) (.cse16 (< ~compRegistered~0 1)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< 6 ~MPR3~0)) (.cse18 (< ~NP~0 1)) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (< |old(~setEventCalled~0)| 1)) (.cse19 (< ~MPR3~0 |old(~s~0)|)) (.cse20 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse15 .cse16 .cse5 .cse10)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse17 (< 1 |old(~setEventCalled~0)|))) (let ((.cse12 (< 0 (+ ~myStatus~0 1073741637))) (.cse0 (or .cse3 .cse4 .cse18 .cse9 .cse14 .cse19 .cse20 .cse21 .cse17)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse13 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse6 (< ~MPR3~0 6)) (.cse7 (not (= 1 |old(~s~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= ~myStatus~0 0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~compRegistered~0 0)) .cse10 .cse11) (or .cse12 .cse2 (or .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16 .cse10 .cse17)) (or .cse12 .cse0 .cse2) (or .cse1 .cse2 (or .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16 .cse10 .cse11 .cse17)) (or .cse3 .cse4 .cse18 .cse1 .cse9 .cse14 .cse19 .cse20 .cse11 .cse21 .cse17))))) [2018-11-23 01:24:59,154 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2018-11-23 01:24:59,154 INFO L448 ceAbstractionStarter]: For program point L1048-1(lines 1035 1054) no Hoare annotation was computed. [2018-11-23 01:24:59,154 INFO L448 ceAbstractionStarter]: For program point L1036(lines 1036 1041) no Hoare annotation was computed. [2018-11-23 01:24:59,154 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1030 1071) the Hoare annotation is: (let ((.cse24 (not (= 0 ~pended~0))) (.cse25 (< ~compRegistered~0 1)) (.cse20 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse26 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse16 (= |old(~customIrp~0)| ~customIrp~0)) (.cse17 (<= 1 ~setEventCalled~0)) (.cse18 (<= ~setEventCalled~0 1)) (.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< 6 ~MPR3~0)) (.cse7 (< ~NP~0 1)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< |old(~setEventCalled~0)| 1)) (.cse10 (< ~MPR3~0 |old(~s~0)|)) (.cse11 (or (< ~MPR3~0 (+ ~NP~0 5)) .cse24 .cse25 .cse20 .cse26)) (.cse13 (< |old(~s~0)| ~MPR3~0)) (.cse14 (< 1 |old(~setEventCalled~0)|))) (let ((.cse1 (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14)) (.cse3 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse16 .cse17 .cse18)) (.cse0 (< 0 (+ ~myStatus~0 1073741637))) (.cse4 (not (= ~myStatus~0 0))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse19 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse15 (= ~s~0 |old(~s~0)|)) (.cse21 (< ~MPR3~0 6)) (.cse22 (not (= 1 |old(~s~0)|))) (.cse23 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse2 .cse3) (or .cse5 .cse6 .cse7 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3) (or (and .cse15 .cse16 .cse17 .cse18) .cse0 .cse2 (or .cse6 .cse19 .cse20 .cse21 .cse22 .cse23 .cse8 .cse9 .cse24 .cse25 .cse26 .cse14)) (or (and .cse16 .cse17 (= ~s~0 1) .cse18) .cse4 .cse2 (or .cse6 .cse19 .cse20 .cse21 .cse22 .cse23 .cse8 .cse9 .cse24 .cse25 .cse26 .cse12 .cse14)) (or .cse5 .cse6 (and .cse15 .cse16) .cse20 .cse21 .cse22 .cse23 .cse8 (not (= ~compRegistered~0 0)) .cse26 .cse12))))) [2018-11-23 01:24:59,154 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1008 1021) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (= ~s~0 1) (or (< 6 ~MPR3~0) (or .cse0 .cse1 .cse2 (< ~compRegistered~0 1) .cse3) (< ~NP~0 1) (< ~MPR3~0 6) .cse4 (< 1 ~NP~0) (not (= 1 |old(~s~0)|)))) (or .cse0 .cse5 .cse6 .cse2 .cse7 .cse4 .cse3 (= |old(~s~0)| ~s~0)) (or .cse5 (= ~s~0 ~NP~0) (or .cse6 .cse7 .cse1) .cse4 .cse3))) [2018-11-23 01:24:59,155 INFO L444 ceAbstractionStarter]: At program point L1016(line 1016) the Hoare annotation is: (let ((.cse1 (not (= 0 ~pended~0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (< 6 ~MPR3~0) (or .cse0 .cse1 .cse2 (< ~compRegistered~0 1) .cse3) (< ~NP~0 1) (< ~MPR3~0 6) .cse4 (< 1 ~NP~0) (not (= 1 |old(~s~0)|))) (or .cse5 (or .cse6 .cse7 .cse1) .cse4 .cse3) (or .cse0 .cse5 .cse6 .cse2 .cse7 .cse4 .cse3))) [2018-11-23 01:24:59,155 INFO L448 ceAbstractionStarter]: For program point L1016-1(lines 1008 1021) no Hoare annotation was computed. [2018-11-23 01:24:59,155 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1008 1021) no Hoare annotation was computed. [2018-11-23 01:24:59,155 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1018) no Hoare annotation was computed. [2018-11-23 01:24:59,155 INFO L448 ceAbstractionStarter]: For program point L514-2(lines 514 519) no Hoare annotation was computed. [2018-11-23 01:24:59,155 INFO L448 ceAbstractionStarter]: For program point L564(lines 564 566) no Hoare annotation was computed. [2018-11-23 01:24:59,155 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 504) no Hoare annotation was computed. [2018-11-23 01:24:59,155 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 493 505) no Hoare annotation was computed. [2018-11-23 01:24:59,156 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 436 603) no Hoare annotation was computed. [2018-11-23 01:24:59,156 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 436 603) the Hoare annotation is: (let ((.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 (and .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4)) (or (not (= |old(~myStatus~0)| 0)) (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4) .cse0 .cse1))) [2018-11-23 01:24:59,156 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 572) no Hoare annotation was computed. [2018-11-23 01:24:59,156 INFO L444 ceAbstractionStarter]: At program point L516(line 516) the Hoare annotation is: (let ((.cse3 (= ~s~0 1)) (.cse10 (< 0 ~MaximumInterfaceType~0)) (.cse11 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse4 (<= 1 ~compRegistered~0)) (.cse8 (<= ~MPR3~0 ~s~0)) (.cse9 (<= ~s~0 ~MPR3~0)) (.cse5 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse6 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (<= 1 ~setEventCalled~0)) (.cse7 (<= ~setEventCalled~0 1))) (and (let ((.cse0 (= 0 ~myStatus~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse8 .cse9 .cse5 .cse0 .cse6 .cse1 .cse2 .cse7) (not (= |old(~myStatus~0)| 0)) .cse10 .cse11)) (let ((.cse12 (= |old(~myStatus~0)| ~myStatus~0))) (or (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse10 .cse11 (and .cse12 .cse4 .cse8 .cse9 .cse5 .cse6 .cse1 .cse2 .cse7))))) [2018-11-23 01:24:59,163 INFO L448 ceAbstractionStarter]: For program point L516-1(line 516) no Hoare annotation was computed. [2018-11-23 01:24:59,163 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 581) no Hoare annotation was computed. [2018-11-23 01:24:59,164 INFO L444 ceAbstractionStarter]: At program point L574-2(lines 574 581) the Hoare annotation is: (let ((.cse0 (and (and (<= 1 ~compRegistered~0) (= ~s~0 1)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-23 01:24:59,164 INFO L444 ceAbstractionStarter]: At program point L599(line 599) the Hoare annotation is: (let ((.cse0 (and (and (<= 1 ~compRegistered~0) (= ~s~0 1)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-11-23 01:24:59,164 INFO L448 ceAbstractionStarter]: For program point L599-1(line 599) no Hoare annotation was computed. [2018-11-23 01:24:59,164 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 543) no Hoare annotation was computed. [2018-11-23 01:24:59,164 INFO L444 ceAbstractionStarter]: At program point L500(line 500) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 01:24:59,164 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2018-11-23 01:24:59,164 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 505) no Hoare annotation was computed. [2018-11-23 01:24:59,164 INFO L444 ceAbstractionStarter]: At program point L510(line 510) the Hoare annotation is: (let ((.cse2 (= ~s~0 |old(~s~0)|)) (.cse3 (<= 1 ~compRegistered~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 (and .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4)) (or (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4) (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 01:24:59,171 INFO L448 ceAbstractionStarter]: For program point L510-1(line 510) no Hoare annotation was computed. [2018-11-23 01:24:59,171 INFO L444 ceAbstractionStarter]: At program point L535(line 535) the Hoare annotation is: (let ((.cse0 (and (<= 1 ~compRegistered~0) (= ~s~0 1))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-23 01:24:59,171 INFO L448 ceAbstractionStarter]: For program point L535-1(line 535) no Hoare annotation was computed. [2018-11-23 01:24:59,171 INFO L444 ceAbstractionStarter]: At program point L560(lines 560 562) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 01:24:59,171 INFO L448 ceAbstractionStarter]: For program point L560-1(lines 560 562) no Hoare annotation was computed. [2018-11-23 01:24:59,171 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 436 603) no Hoare annotation was computed. [2018-11-23 01:24:59,172 INFO L444 ceAbstractionStarter]: At program point L552-2(lines 552 568) the Hoare annotation is: (let ((.cse0 (and (and (and (<= 1 ~compRegistered~0) (= ~s~0 1)) (not (= 259 FloppyStartDevice_~ntStatus~1))) (<= 0 FloppyStartDevice_~InterfaceType~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-23 01:24:59,172 INFO L444 ceAbstractionStarter]: At program point L569(lines 530 595) the Hoare annotation is: (let ((.cse0 (and (and (<= 1 ~compRegistered~0) (= ~s~0 1)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-23 01:24:59,172 INFO L444 ceAbstractionStarter]: At program point L528(line 528) the Hoare annotation is: (let ((.cse9 (+ ~DC~0 2)) (.cse10 (+ ~SKIP1~0 2)) (.cse7 (= 0 ~pended~0)) (.cse8 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse9) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse10) (not (= |old(~compRegistered~0)| 0)) (not .cse7) (< ~IPC~0 .cse8) (not (= |old(~customIrp~0)| 0)))) (.cse3 (= |old(~myStatus~0)| ~myStatus~0)) (.cse2 (let ((.cse4 (and .cse7 (<= .cse8 ~IPC~0) (<= .cse9 ~SKIP2~0) (<= .cse10 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse5 (= ~s~0 1)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse4 (<= FloppyStartDevice_~__cil_tmp42~0 259) .cse5 (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse6) (and (and .cse4 (<= 1 ~NP~0) (<= ~NP~0 1) .cse5 (<= ~MPR3~0 6) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0)) (= 0 ~customIrp~0) .cse6))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 (and .cse2 .cse3)) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 (and .cse3 .cse2))))) [2018-11-23 01:24:59,177 INFO L444 ceAbstractionStarter]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-23 01:24:59,177 INFO L448 ceAbstractionStarter]: For program point L528-1(line 528) no Hoare annotation was computed. [2018-11-23 01:24:59,177 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2018-11-23 01:24:59,177 INFO L448 ceAbstractionStarter]: For program point L553(lines 552 568) no Hoare annotation was computed. [2018-11-23 01:24:59,177 INFO L448 ceAbstractionStarter]: For program point L586-2(lines 586 591) no Hoare annotation was computed. [2018-11-23 01:24:59,177 INFO L444 ceAbstractionStarter]: At program point L545(lines 532 572) the Hoare annotation is: (let ((.cse5 (+ ~DC~0 2)) (.cse6 (+ ~SKIP1~0 2)) (.cse3 (= 0 ~pended~0)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not .cse3) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (and (and .cse3 (<= .cse4 ~IPC~0) (<= .cse5 ~SKIP2~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= 1 ~NP~0) (<= ~NP~0 1) (= ~s~0 1) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)) (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2)))) [2018-11-23 01:24:59,178 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 540) no Hoare annotation was computed. [2018-11-23 01:24:59,178 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 546 549) no Hoare annotation was computed. [2018-11-23 01:24:59,178 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 595) no Hoare annotation was computed. [2018-11-23 01:24:59,178 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 595) no Hoare annotation was computed. [2018-11-23 01:24:59,178 INFO L444 ceAbstractionStarter]: At program point L588(lines 588 589) the Hoare annotation is: (let ((.cse0 (and (not (= 259 FloppyStartDevice_~ntStatus~1)) (and (<= 1 ~compRegistered~0) (= ~s~0 1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-23 01:24:59,181 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 588 589) no Hoare annotation was computed. [2018-11-23 01:24:59,181 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 519) no Hoare annotation was computed. [2018-11-23 01:24:59,181 INFO L451 ceAbstractionStarter]: At program point L1104(lines 1103 1113) the Hoare annotation is: true [2018-11-23 01:24:59,181 INFO L451 ceAbstractionStarter]: At program point L1102(lines 1101 1113) the Hoare annotation is: true [2018-11-23 01:24:59,181 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1094 1115) no Hoare annotation was computed. [2018-11-23 01:24:59,181 INFO L448 ceAbstractionStarter]: For program point L1101(lines 1101 1113) no Hoare annotation was computed. [2018-11-23 01:24:59,181 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1105 1112) no Hoare annotation was computed. [2018-11-23 01:24:59,181 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1094 1115) the Hoare annotation is: true [2018-11-23 01:24:59,181 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1105 1112) no Hoare annotation was computed. [2018-11-23 01:24:59,181 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1094 1115) no Hoare annotation was computed. [2018-11-23 01:24:59,181 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1072 1093) no Hoare annotation was computed. [2018-11-23 01:24:59,181 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1072 1093) the Hoare annotation is: true [2018-11-23 01:24:59,182 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1072 1093) no Hoare annotation was computed. [2018-11-23 01:24:59,182 INFO L451 ceAbstractionStarter]: At program point L1082(lines 1081 1091) the Hoare annotation is: true [2018-11-23 01:24:59,182 INFO L451 ceAbstractionStarter]: At program point L1080(lines 1079 1091) the Hoare annotation is: true [2018-11-23 01:24:59,182 INFO L448 ceAbstractionStarter]: For program point L1079(lines 1079 1091) no Hoare annotation was computed. [2018-11-23 01:24:59,182 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1083 1090) no Hoare annotation was computed. [2018-11-23 01:24:59,182 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1083 1090) no Hoare annotation was computed. [2018-11-23 01:24:59,182 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 809 833) no Hoare annotation was computed. [2018-11-23 01:24:59,182 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 809 833) no Hoare annotation was computed. [2018-11-23 01:24:59,182 INFO L451 ceAbstractionStarter]: At program point L822(lines 821 831) the Hoare annotation is: true [2018-11-23 01:24:59,182 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 823 830) no Hoare annotation was computed. [2018-11-23 01:24:59,182 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 809 833) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 ~s~0))))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2))) [2018-11-23 01:24:59,184 INFO L451 ceAbstractionStarter]: At program point L820(lines 819 831) the Hoare annotation is: true [2018-11-23 01:24:59,184 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 831) no Hoare annotation was computed. [2018-11-23 01:24:59,184 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 823 830) no Hoare annotation was computed. [2018-11-23 01:24:59,184 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1022 1029) the Hoare annotation is: true [2018-11-23 01:24:59,184 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1022 1029) no Hoare annotation was computed. [2018-11-23 01:24:59,184 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1022 1029) no Hoare annotation was computed. [2018-11-23 01:24:59,185 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 656 668) no Hoare annotation was computed. [2018-11-23 01:24:59,185 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 656 668) the Hoare annotation is: (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2) (or (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse0))) [2018-11-23 01:24:59,185 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 656 668) no Hoare annotation was computed. [2018-11-23 01:24:59,185 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 60 67) the Hoare annotation is: true [2018-11-23 01:24:59,185 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 60 67) no Hoare annotation was computed. [2018-11-23 01:24:59,185 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 60 67) no Hoare annotation was computed. [2018-11-23 01:24:59,185 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 64) no Hoare annotation was computed. [2018-11-23 01:24:59,185 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 1003) no Hoare annotation was computed. [2018-11-23 01:24:59,185 INFO L448 ceAbstractionStarter]: For program point L949(lines 949 953) no Hoare annotation was computed. [2018-11-23 01:24:59,186 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 935 1007) the Hoare annotation is: (let ((.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (not (= 0 ~pended~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse15 (< ~NP~0 1)) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (< 1 ~NP~0))) (let ((.cse3 (< 6 ~MPR3~0)) (.cse5 (or (or .cse8 .cse14 .cse9 (< ~compRegistered~0 1) .cse12) .cse15 .cse11 .cse16 (not (= 1 |old(~s~0)|)))) (.cse6 (< ~MPR3~0 6))) (let ((.cse0 (or .cse3 .cse5 .cse6)) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse4 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse10 (= ~s~0 ~SKIP1~0)) (.cse13 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~customIrp~0 0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse2 .cse7) (or .cse8 (< ~MPR3~0 (+ ~NP~0 5)) .cse9 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12 (or .cse13 .cse14)) (or .cse0 .cse2 .cse4 .cse1) (or .cse8 .cse3 .cse15 .cse10 .cse11 .cse6 .cse16 (< ~SKIP1~0 |old(~s~0)|) .cse9 (< |old(~s~0)| ~SKIP1~0) .cse13 .cse12 .cse7))))) [2018-11-23 01:24:59,189 INFO L444 ceAbstractionStarter]: At program point L978(lines 942 1006) the Hoare annotation is: (let ((.cse41 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse37 (+ ~DC~0 2)) (.cse39 (+ ~DC~0 5)) (.cse38 (+ ~SKIP1~0 2)) (.cse31 (= 0 ~pended~0)) (.cse40 (+ ~NP~0 2))) (let ((.cse17 (< ~SKIP1~0 .cse40)) (.cse28 (not .cse31)) (.cse23 (< ~MPR1~0 .cse38)) (.cse26 (< ~IPC~0 .cse39)) (.cse18 (< ~NP~0 1)) (.cse19 (< ~SKIP2~0 .cse37)) (.cse20 (< 1 ~NP~0)) (.cse6 (= ~MPR1~0 ~s~0)) (.cse7 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse41) 3221225494))) (.cse8 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse9 (<= (+ .cse41 1) 0)) (.cse27 (+ ~NP~0 5))) (let ((.cse10 (= IofCallDriver_~returnVal2~0 259)) (.cse15 (let ((.cse29 (<= .cse40 ~SKIP1~0)) (.cse30 (<= .cse39 ~IPC~0)) (.cse32 (<= .cse38 ~MPR1~0)) (.cse33 (<= 1 ~compRegistered~0)) (.cse34 (<= .cse27 ~MPR3~0)) (.cse35 (<= .cse37 ~SKIP2~0)) (.cse36 (= ~NP~0 |old(~s~0)|))) (or (and .cse29 .cse30 .cse31 .cse32 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse33 .cse34 .cse6 .cse35 .cse7 .cse8 .cse9 .cse36) (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse6 .cse35 .cse7 (= 0 IofCallDriver_~returnVal2~0) .cse8 .cse9 .cse36)))) (.cse11 (<= 1 ~setEventCalled~0)) (.cse12 (<= ~setEventCalled~0 1)) (.cse5 (< 6 ~MPR3~0)) (.cse13 (or (or .cse17 .cse28 .cse23 (< ~compRegistered~0 1) .cse26) .cse18 .cse19 .cse20 (not (= 1 |old(~s~0)|)))) (.cse14 (< ~MPR3~0 6))) (let ((.cse0 (or .cse5 .cse13 .cse14)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (<= 1 ~NP~0) .cse15 (<= ~MPR3~0 6) .cse11 .cse12) (<= ~MaximumInterfaceType~0 0))) (.cse3 (and .cse9 .cse11 .cse10 .cse6 .cse7 .cse8 .cse12)) (.cse4 (not (= ~myStatus~0 0))) (.cse16 (not (= ~customIrp~0 0))) (.cse21 (= ~s~0 ~SKIP1~0)) (.cse22 (< ~SKIP1~0 |old(~s~0)|)) (.cse24 (< |old(~s~0)| ~SKIP1~0)) (.cse25 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2 .cse3) (or .cse0 .cse4 .cse2 .cse1 .cse3) (or .cse5 .cse4 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 (and .cse15 .cse11 .cse12) .cse16) (or .cse17 .cse5 .cse18 .cse19 .cse14 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse16) (or .cse17 (< ~MPR3~0 .cse27) .cse21 .cse19 .cse22 .cse23 .cse24 .cse26 (or .cse25 .cse28))))))) [2018-11-23 01:24:59,190 INFO L444 ceAbstractionStarter]: At program point L945(line 945) the Hoare annotation is: (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse14 (< ~NP~0 1)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (< 1 ~NP~0))) (let ((.cse9 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse8 .cse4 (< ~compRegistered~0 1) .cse6) .cse14 .cse5 .cse15 (not (= 1 |old(~s~0)|)))) (.cse12 (< ~MPR3~0 6))) (let ((.cse7 (not (= ~compRegistered~0 0))) (.cse13 (not (= ~customIrp~0 0))) (.cse0 (or .cse9 .cse11 .cse12)) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse10 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse3 (< ~MPR3~0 (+ ~NP~0 5)) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6 (or .cse7 .cse8)) (or .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (or .cse3 .cse9 .cse14 .cse5 .cse12 .cse15 (< ~SKIP1~0 |old(~s~0)|) .cse4 (< |old(~s~0)| ~SKIP1~0) .cse7 .cse6 .cse13) (or .cse0 .cse2 .cse10 .cse1))))) [2018-11-23 01:24:59,193 INFO L448 ceAbstractionStarter]: For program point L945-1(line 945) no Hoare annotation was computed. [2018-11-23 01:24:59,194 INFO L444 ceAbstractionStarter]: At program point L966(lines 965 980) the Hoare annotation is: (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (not (= 0 ~pended~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse12 (< ~NP~0 1)) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (< 1 ~NP~0))) (let ((.cse11 (< 6 ~MPR3~0)) (.cse16 (or (or .cse3 .cse9 .cse4 (< ~compRegistered~0 1) .cse7) .cse12 .cse6 .cse14 (not (= 1 |old(~s~0)|)))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (or .cse11 .cse16 .cse13)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse5 (= ~s~0 ~SKIP1~0)) (.cse8 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~myStatus~0 0))) (.cse1 (let ((.cse17 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse17 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse15 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse3 (< ~MPR3~0 (+ ~NP~0 5)) .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 (or .cse8 .cse9)) (or .cse0 .cse10 .cse2 .cse1) (or .cse3 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14 (< ~SKIP1~0 |old(~s~0)|) .cse4 (< |old(~s~0)| ~SKIP1~0) .cse8 .cse7 .cse15) (or .cse11 .cse10 .cse16 .cse13 .cse1 .cse15))))) [2018-11-23 01:24:59,194 INFO L448 ceAbstractionStarter]: For program point L995(lines 995 1002) no Hoare annotation was computed. [2018-11-23 01:24:59,194 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 935 1007) no Hoare annotation was computed. [2018-11-23 01:24:59,194 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 981) no Hoare annotation was computed. [2018-11-23 01:24:59,194 INFO L448 ceAbstractionStarter]: For program point L987(lines 987 993) no Hoare annotation was computed. [2018-11-23 01:24:59,194 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 935 1007) no Hoare annotation was computed. [2018-11-23 01:24:59,194 INFO L444 ceAbstractionStarter]: At program point L1000(line 1000) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse13 (< ~NP~0 1)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (< 1 ~NP~0))) (let ((.cse8 (< 6 ~MPR3~0)) (.cse10 (or (or .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5) .cse13 .cse4 .cse14 (not (= 1 |old(~s~0)|)))) (.cse11 (< ~MPR3~0 6))) (let ((.cse6 (not (= ~compRegistered~0 0))) (.cse12 (not (= ~customIrp~0 0))) (.cse0 (or .cse8 .cse10 .cse11)) (.cse9 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1) (or .cse2 (< ~MPR3~0 (+ ~NP~0 5)) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5 (or .cse6 .cse7)) (or .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse2 .cse8 .cse13 .cse4 .cse11 .cse14 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse6 .cse5 .cse12) (or .cse0 .cse9 .cse1))))) [2018-11-23 01:24:59,198 INFO L448 ceAbstractionStarter]: For program point L1000-1(lines 982 1004) no Hoare annotation was computed. [2018-11-23 01:24:59,199 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 980) no Hoare annotation was computed. [2018-11-23 01:24:59,199 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 967 979) no Hoare annotation was computed. [2018-11-23 01:24:59,199 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 967 979) no Hoare annotation was computed. [2018-11-23 01:24:59,199 INFO L444 ceAbstractionStarter]: At program point L959(lines 958 981) the Hoare annotation is: (let ((.cse27 (+ ~DC~0 2)) (.cse24 (+ ~DC~0 5)) (.cse26 (+ ~SKIP1~0 2)) (.cse25 (= 0 ~pended~0)) (.cse23 (+ ~NP~0 2))) (let ((.cse14 (< ~SKIP1~0 .cse23)) (.cse20 (not .cse25)) (.cse15 (< ~MPR1~0 .cse26)) (.cse18 (< ~IPC~0 .cse24)) (.cse21 (< ~NP~0 1)) (.cse17 (< ~SKIP2~0 .cse27)) (.cse22 (< 1 ~NP~0)) (.cse28 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse28) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse8 (<= (+ .cse28 1) 0)) (.cse9 (<= 1 ~setEventCalled~0)) (.cse10 (<= ~setEventCalled~0 1)) (.cse4 (< 6 ~MPR3~0)) (.cse11 (or (or .cse14 .cse20 .cse15 (< ~compRegistered~0 1) .cse18) .cse21 .cse17 .cse22 (not (= 1 |old(~s~0)|)))) (.cse12 (< ~MPR3~0 6))) (let ((.cse0 (or .cse4 .cse11 .cse12)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse23 ~SKIP1~0) (<= 1 ~NP~0) (<= .cse24 ~IPC~0) .cse25 (<= .cse26 ~MPR1~0) (<= 1 ~compRegistered~0) .cse5 (<= .cse27 ~SKIP2~0) .cse6 (<= ~NP~0 1) .cse7 .cse8 (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) .cse9 (<= ~MaximumInterfaceType~0 0) .cse10 (<= 6 ~MPR3~0))) (.cse3 (not (= ~myStatus~0 0))) (.cse16 (= ~s~0 ~SKIP1~0)) (.cse19 (not (= ~compRegistered~0 0))) (.cse13 (not (= ~customIrp~0 0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse3 .cse1 .cse2) (or .cse4 .cse3 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) (or .cse14 (< ~MPR3~0 (+ ~NP~0 5)) .cse15 .cse16 (not (= ~SKIP1~0 |old(~s~0)|)) .cse17 .cse18 (or .cse19 .cse20)) (or .cse14 .cse4 .cse21 .cse16 .cse17 .cse12 .cse22 (< ~SKIP1~0 |old(~s~0)|) .cse15 (< |old(~s~0)| ~SKIP1~0) .cse19 .cse18 .cse13)))))) [2018-11-23 01:24:59,199 INFO L444 ceAbstractionStarter]: At program point L951(line 951) the Hoare annotation is: (let ((.cse20 (+ ~DC~0 2)) (.cse18 (+ ~DC~0 5)) (.cse19 (+ ~SKIP1~0 2)) (.cse17 (= 0 ~pended~0))) (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (not .cse17)) (.cse5 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse12 (< ~NP~0 1)) (.cse6 (< ~SKIP2~0 .cse20)) (.cse14 (< 1 ~NP~0))) (let ((.cse4 (+ ~NP~0 5)) (.cse11 (< 6 ~MPR3~0)) (.cse16 (or (or .cse3 .cse9 .cse5 (< ~compRegistered~0 1) .cse7) .cse12 .cse6 .cse14 (not (= 1 |old(~s~0)|)))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (or .cse11 .cse16 .cse13)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse8 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~myStatus~0 0))) (.cse2 (and (<= 1 ~setEventCalled~0) (let ((.cse21 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse17 (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0) (<= .cse4 ~MPR3~0) (<= .cse20 ~SKIP2~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse21 1) 0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0))) (<= ~setEventCalled~0 1))) (.cse15 (not (= ~customIrp~0 0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse3 (< ~MPR3~0 .cse4) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 (or .cse8 .cse9)) (or .cse0 .cse10 .cse1 .cse2) (or .cse3 .cse11 .cse12 .cse6 .cse13 .cse14 (< ~SKIP1~0 |old(~s~0)|) .cse5 (< |old(~s~0)| ~SKIP1~0) .cse8 .cse7 .cse15) (or .cse11 .cse10 .cse2 .cse16 .cse13 .cse15)))))) [2018-11-23 01:24:59,201 INFO L448 ceAbstractionStarter]: For program point L943(lines 943 955) no Hoare annotation was computed. [2018-11-23 01:24:59,201 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 943 955) no Hoare annotation was computed. [2018-11-23 01:24:59,202 INFO L444 ceAbstractionStarter]: At program point L964(lines 963 980) the Hoare annotation is: (let ((.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (not (= 0 ~pended~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse15 (< ~NP~0 1)) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (< 1 ~NP~0))) (let ((.cse3 (< 6 ~MPR3~0)) (.cse5 (or (or .cse8 .cse14 .cse9 (< ~compRegistered~0 1) .cse12) .cse15 .cse11 .cse16 (not (= 1 |old(~s~0)|)))) (.cse6 (< ~MPR3~0 6))) (let ((.cse0 (or .cse3 .cse5 .cse6)) (.cse4 (not (= ~myStatus~0 0))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (let ((.cse17 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse17 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse10 (= ~s~0 ~SKIP1~0)) (.cse13 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse3 .cse4 .cse1 .cse5 .cse6 .cse7) (or .cse8 (< ~MPR3~0 (+ ~NP~0 5)) .cse9 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12 (or .cse13 .cse14)) (or .cse0 .cse4 .cse2 .cse1) (or .cse8 .cse3 .cse15 .cse10 .cse11 .cse6 .cse16 (< ~SKIP1~0 |old(~s~0)|) .cse9 (< |old(~s~0)| ~SKIP1~0) .cse13 .cse12 .cse7))))) [2018-11-23 01:24:59,202 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 150) no Hoare annotation was computed. [2018-11-23 01:24:59,202 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 112 160) no Hoare annotation was computed. [2018-11-23 01:24:59,202 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 99 161) no Hoare annotation was computed. [2018-11-23 01:24:59,202 INFO L444 ceAbstractionStarter]: At program point L143(line 143) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (= 0 ~pended~0) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-23 01:24:59,202 INFO L448 ceAbstractionStarter]: For program point L143-1(line 143) no Hoare annotation was computed. [2018-11-23 01:24:59,206 INFO L444 ceAbstractionStarter]: At program point L141(lines 141 142) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (= 0 ~pended~0) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-23 01:24:59,206 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 141 142) no Hoare annotation was computed. [2018-11-23 01:24:59,206 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 138) no Hoare annotation was computed. [2018-11-23 01:24:59,206 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 99 161) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (= 0 ~pended~0) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-23 01:24:59,206 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 128) no Hoare annotation was computed. [2018-11-23 01:24:59,206 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 99 161) no Hoare annotation was computed. [2018-11-23 01:24:59,206 INFO L444 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-23 01:24:59,206 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 125) no Hoare annotation was computed. [2018-11-23 01:24:59,206 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 152 158) no Hoare annotation was computed. [2018-11-23 01:24:59,206 INFO L444 ceAbstractionStarter]: At program point L123-2(lines 123 125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (= 0 ~pended~0) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-23 01:24:59,206 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-23 01:24:59,206 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 118) no Hoare annotation was computed. [2018-11-23 01:24:59,207 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 136) no Hoare annotation was computed. [2018-11-23 01:24:59,207 INFO L448 ceAbstractionStarter]: For program point L134-2(lines 134 136) no Hoare annotation was computed. [2018-11-23 01:24:59,207 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:24:59,207 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-23 01:24:59,207 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:24:59,207 INFO L444 ceAbstractionStarter]: At program point L641(line 641) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse6 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) (.cse1 (<= ~MPR3~0 ~s~0)) (.cse2 (<= ~s~0 ~MPR3~0)) (.cse3 (<= 1 ~setEventCalled~0)) (.cse5 (<= ~setEventCalled~0 1)) (.cse4 (= 259 FlFdcDeviceIo_~__cil_tmp11~0))) (and (or (not (= ~myStatus~0 0)) .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (= ~s~0 1) .cse3 .cse4 .cse5) (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse6 (and (and .cse1 .cse2 .cse3 .cse5) .cse4)))) [2018-11-23 01:24:59,211 INFO L448 ceAbstractionStarter]: For program point L641-1(line 641) no Hoare annotation was computed. [2018-11-23 01:24:59,211 INFO L448 ceAbstractionStarter]: For program point L639(lines 639 644) no Hoare annotation was computed. [2018-11-23 01:24:59,211 INFO L448 ceAbstractionStarter]: For program point L639-2(lines 639 644) no Hoare annotation was computed. [2018-11-23 01:24:59,211 INFO L444 ceAbstractionStarter]: At program point L635(line 635) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) (.cse2 (= ~s~0 |old(~s~0)|))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2))) [2018-11-23 01:24:59,211 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 614 648) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2))) [2018-11-23 01:24:59,211 INFO L448 ceAbstractionStarter]: For program point L635-1(line 635) no Hoare annotation was computed. [2018-11-23 01:24:59,211 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 614 648) no Hoare annotation was computed. [2018-11-23 01:24:59,211 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 631) no Hoare annotation was computed. [2018-11-23 01:24:59,211 INFO L444 ceAbstractionStarter]: At program point L626(lines 626 627) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (not (= 0 ~pended~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2))) [2018-11-23 01:24:59,211 INFO L448 ceAbstractionStarter]: For program point L626-1(lines 626 627) no Hoare annotation was computed. [2018-11-23 01:24:59,211 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 614 648) no Hoare annotation was computed. [2018-11-23 01:24:59,212 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 92 98) no Hoare annotation was computed. [2018-11-23 01:24:59,212 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 92 98) the Hoare annotation is: true [2018-11-23 01:24:59,212 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 92 98) no Hoare annotation was computed. [2018-11-23 01:24:59,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:24:59,217 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (<= ~MaximumInterfaceType~0 0)) [2018-11-23 01:24:59,217 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L451 ceAbstractionStarter]: At program point L864(lines 863 875) the Hoare annotation is: true [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 875) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 855 877) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 867 874) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 855 877) the Hoare annotation is: true [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 855 877) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L451 ceAbstractionStarter]: At program point L866(lines 865 875) the Hoare annotation is: true [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 867 874) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 834 854) the Hoare annotation is: true [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 834 854) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L451 ceAbstractionStarter]: At program point L843(lines 842 852) the Hoare annotation is: true [2018-11-23 01:24:59,218 INFO L451 ceAbstractionStarter]: At program point L841(lines 840 852) the Hoare annotation is: true [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 852) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 834 854) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 844 851) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 844 851) no Hoare annotation was computed. [2018-11-23 01:24:59,218 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1116 1136) the Hoare annotation is: true [2018-11-23 01:24:59,218 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1116 1136) no Hoare annotation was computed. [2018-11-23 01:24:59,219 INFO L451 ceAbstractionStarter]: At program point L1125(lines 1124 1134) the Hoare annotation is: true [2018-11-23 01:24:59,219 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1126 1133) no Hoare annotation was computed. [2018-11-23 01:24:59,219 INFO L451 ceAbstractionStarter]: At program point L1123(lines 1122 1134) the Hoare annotation is: true [2018-11-23 01:24:59,219 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1116 1136) no Hoare annotation was computed. [2018-11-23 01:24:59,219 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1134) no Hoare annotation was computed. [2018-11-23 01:24:59,222 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1126 1133) no Hoare annotation was computed. [2018-11-23 01:24:59,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:24:59 BoogieIcfgContainer [2018-11-23 01:24:59,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:24:59,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:24:59,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:24:59,285 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:24:59,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:30" (3/4) ... [2018-11-23 01:24:59,289 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 01:24:59,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-23 01:24:59,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-23 01:24:59,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-23 01:24:59,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-23 01:24:59,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-23 01:24:59,310 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2018-11-23 01:24:59,311 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2018-11-23 01:24:59,312 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 01:24:59,313 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 01:24:59,340 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || (((((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((NP + 2 <= SKIP1 && 1 <= NP) && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 01:24:59,340 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 01:24:59,340 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && ((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 01:24:59,340 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || ((((status == lowerDriverReturn && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && SKIP2 <= s) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && SKIP1 + 2 <= MPR1) && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0))) && !(259 == status))) || (((NP + 2 <= SKIP1 && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)))) || (((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 01:24:59,341 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && compRegistered <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || ((((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 1 <= NP) && MPR3 <= 6) && !(259 == ntStatus))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) && ((((((0 < \old(myStatus) + 1073741637 || ((((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 1 <= NP) && MPR3 <= 6) && !(259 == ntStatus))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && compRegistered <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) [2018-11-23 01:24:59,342 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == 1 && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || (s == 1 && \old(customIrp) == customIrp)) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || (s == 1 && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((s == 1 && \old(customIrp) == customIrp) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) [2018-11-23 01:24:59,342 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == 1 && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || (s == 1 && \old(customIrp) == customIrp)) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || (s == 1 && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((s == 1 && \old(customIrp) == customIrp) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) [2018-11-23 01:24:59,342 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && 0 == status) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || (((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && s == 1) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 01:24:59,342 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-23 01:24:59,342 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 6 <= MPR3)) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 6 <= MPR3))) && (((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) [2018-11-23 01:24:59,343 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((1 <= NP && (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && ((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((1 <= NP && (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && ((((((6 < MPR3 || !(myStatus == 0)) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || s == SKIP1) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended)) [2018-11-23 01:24:59,343 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) && (((((((((((s == 1 && \old(customIrp) == customIrp) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled)) || (((s == 1 && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((0 < myStatus + 1073741637 || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType)) && ((((((\old(customIrp) == customIrp && 1 <= setEventCalled) && s == 1) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled)) [2018-11-23 01:24:59,343 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) && (((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) [2018-11-23 01:24:59,344 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && (((((6 < MPR3 || !(myStatus == 0)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0)) [2018-11-23 01:24:59,344 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((0 == pended && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && 1 <= NP) && NP <= 1) && s == 1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((0 == pended && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && 1 <= NP) && NP <= 1) && s == 1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) [2018-11-23 01:24:59,345 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && ((((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) && 0 <= InterfaceType) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-11-23 01:24:59,345 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-11-23 01:24:59,346 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && s == 1) && 0 == ntStatus)) && ((((((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && s == 1) && 0 == ntStatus) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-11-23 01:24:59,346 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) [2018-11-23 01:24:59,346 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) [2018-11-23 01:24:59,346 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) [2018-11-23 01:24:59,346 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && \old(s) == s) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && \old(s) == s) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) [2018-11-23 01:24:59,346 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) [2018-11-23 01:24:59,442 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a9564191-d9e3-4e55-a4fc-69f25be3e657/bin-2019/uautomizer/witness.graphml [2018-11-23 01:24:59,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:24:59,443 INFO L168 Benchmark]: Toolchain (without parser) took 30263.36 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 826.8 MB). Free memory was 956.6 MB in the beginning and 910.6 MB in the end (delta: 46.0 MB). Peak memory consumption was 872.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:24:59,444 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:24:59,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.32 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 932.4 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:24:59,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 932.4 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:24:59,444 INFO L168 Benchmark]: Boogie Preprocessor took 42.07 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:24:59,444 INFO L168 Benchmark]: RCFGBuilder took 616.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.1 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:24:59,445 INFO L168 Benchmark]: TraceAbstraction took 29084.11 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 685.2 MB). Free memory was 1.0 GB in the beginning and 949.3 MB in the end (delta: 97.7 MB). Peak memory consumption was 896.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:24:59,445 INFO L168 Benchmark]: Witness Printer took 157.59 ms. Allocated memory is still 1.9 GB. Free memory was 949.3 MB in the beginning and 910.6 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:24:59,446 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.32 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 932.4 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 932.4 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.07 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 616.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.1 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29084.11 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 685.2 MB). Free memory was 1.0 GB in the beginning and 949.3 MB in the end (delta: 97.7 MB). Peak memory consumption was 896.3 MB. Max. memory is 11.5 GB. * Witness Printer took 157.59 ms. Allocated memory is still 1.9 GB. Free memory was 949.3 MB in the beginning and 910.6 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 64]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) - InvariantResult [Line: 887]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) && (((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: ((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) && (((((((((((s == 1 && \old(customIrp) == customIrp) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled)) || (((s == 1 && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((0 < myStatus + 1073741637 || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType)) && ((((((\old(customIrp) == customIrp && 1 <= setEventCalled) && s == 1) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 749]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 532]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((0 == pended && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && 1 <= NP) && NP <= 1) && s == 1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((0 == pended && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && 1 <= NP) && NP <= 1) && s == 1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) - InvariantResult [Line: 863]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: (((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: ((((((((s == 1 && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || (s == 1 && \old(customIrp) == customIrp)) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || (s == 1 && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((s == 1 && \old(customIrp) == customIrp) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && compRegistered <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || ((((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 1 <= NP) && MPR3 <= 6) && !(259 == ntStatus))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) && ((((((0 < \old(myStatus) + 1073741637 || ((((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 1 <= NP) && MPR3 <= 6) && !(259 == ntStatus))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && compRegistered <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && \old(s) == s) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && \old(s) == s) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) - InvariantResult [Line: 958]: Loop Invariant Derived loop invariant: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 6 <= MPR3)) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 6 <= MPR3))) && (((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && ((((((1 <= compRegistered && s == 1) && !(259 == ntStatus)) && 0 <= InterfaceType) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1103]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 965]: Loop Invariant Derived loop invariant: ((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && (((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && (((((6 < MPR3 || !(myStatus == 0)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0)) - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 840]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 734]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && s == 1) && 0 == ntStatus)) && ((((((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && s == 1) && 0 == ntStatus) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) - InvariantResult [Line: 732]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && 0 == status) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || (((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && s == 1) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && ((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1081]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((((s == 1 && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || 0 < MaximumInterfaceType) && (((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && s == 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || 1 < \old(setEventCalled))) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || (s == 1 && \old(customIrp) == customIrp)) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || !(myStatus == 0)) || (s == 1 && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((s == 1 && \old(customIrp) == customIrp) || (((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || (((((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 1 <= NP) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((NP + 2 <= SKIP1 && 1 <= NP) && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s == 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) - InvariantResult [Line: 1122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || !(1 == \old(s))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1)) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || ((((status == lowerDriverReturn && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && SKIP2 <= s) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || ((MPR3 <= 6 && ((NP + 2 <= SKIP1 && 1 <= NP) && SKIP1 + 2 <= MPR1) && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0))) && !(259 == status))) || (((NP + 2 <= SKIP1 && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)))) || (((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((1 <= NP && (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && ((((((6 < MPR3 || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((1 <= NP && (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && ((((((6 < MPR3 || !(myStatus == 0)) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((SKIP1 < NP + 2 || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || !(1 == \old(s))) || MPR3 < 6) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0))) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || NP < 1) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || s == SKIP1) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended)) - InvariantResult [Line: 885]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 325 locations, 1 error locations. SAFE Result, 28.9s OverallTime, 50 OverallIterations, 2 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 14.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 15906 SDtfs, 8968 SDslu, 49367 SDs, 0 SdLazy, 9474 SolverSat, 1719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 956 GetRequests, 584 SyntacticMatches, 16 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=817occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 50 MinimizatonAttempts, 1629 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 117 LocationsWithAnnotation, 1959 PreInvPairs, 2220 NumberOfFragments, 17874 HoareAnnotationTreeSize, 1959 FomulaSimplifications, 96833 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 117 FomulaSimplificationsInter, 320493 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4374 NumberOfCodeBlocks, 4374 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4321 ConstructedInterpolants, 0 QuantifiedInterpolants, 736782 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3716 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 53 InterpolantComputations, 50 PerfectInterpolantSequences, 374/383 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...