./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/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_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/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-0cd3be1 [2018-11-28 13:01:50,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:01:50,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:01:50,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:01:50,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:01:50,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:01:50,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:01:50,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:01:50,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:01:50,868 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:01:50,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:01:50,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:01:50,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:01:50,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:01:50,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:01:50,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:01:50,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:01:50,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:01:50,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:01:50,876 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:01:50,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:01:50,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:01:50,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:01:50,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:01:50,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:01:50,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:01:50,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:01:50,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:01:50,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:01:50,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:01:50,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:01:50,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:01:50,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:01:50,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:01:50,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:01:50,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:01:50,884 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:01:50,894 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:01:50,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:01:50,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:01:50,895 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:01:50,895 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:01:50,895 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:01:50,896 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:01:50,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:01:50,896 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:01:50,896 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:01:50,896 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:01:50,896 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:01:50,896 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:01:50,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:01:50,897 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:01:50,897 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:01:50,897 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:01:50,897 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:01:50,897 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:01:50,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:01:50,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:01:50,898 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:01:50,898 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:01:50,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:01:50,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:01:50,898 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:01:50,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:01:50,899 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:01:50,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:01:50,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:01:50,899 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_4055ee7e-f5e5-4217-9777-6a5ded077847/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-28 13:01:50,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:01:50,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:01:50,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:01:50,932 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:01:50,933 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:01:50,933 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 13:01:50,972 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/data/9e7de531a/b4b9621138bd42d396b04064ef0aec61/FLAGb93151412 [2018-11-28 13:01:51,390 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:01:51,391 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 13:01:51,397 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/data/9e7de531a/b4b9621138bd42d396b04064ef0aec61/FLAGb93151412 [2018-11-28 13:01:51,405 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/data/9e7de531a/b4b9621138bd42d396b04064ef0aec61 [2018-11-28 13:01:51,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:01:51,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:01:51,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:01:51,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:01:51,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:01:51,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f013faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51, skipping insertion in model container [2018-11-28 13:01:51,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:01:51,445 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:01:51,626 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:01:51,630 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:01:51,715 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:01:51,726 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:01:51,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51 WrapperNode [2018-11-28 13:01:51,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:01:51,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:01:51,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:01:51,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:01:51,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:01:51,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:01:51,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:01:51,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:01:51,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... [2018-11-28 13:01:51,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:01:51,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:01:51,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:01:51,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:01:51,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/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-28 13:01:51,825 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-28 13:01:51,825 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-28 13:01:51,825 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-28 13:01:51,826 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-28 13:01:51,826 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-28 13:01:51,826 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-28 13:01:51,826 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-28 13:01:51,826 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-28 13:01:51,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:01:51,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:01:51,826 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-28 13:01:51,827 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-28 13:01:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-28 13:01:51,827 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-28 13:01:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-28 13:01:51,827 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-28 13:01:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-28 13:01:51,827 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-28 13:01:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-28 13:01:51,827 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-28 13:01:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-28 13:01:51,828 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-28 13:01:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-28 13:01:51,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-28 13:01:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-28 13:01:51,828 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-28 13:01:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-28 13:01:51,828 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-28 13:01:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-28 13:01:51,829 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-28 13:01:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-28 13:01:51,829 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-28 13:01:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-28 13:01:51,829 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-28 13:01:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-28 13:01:51,829 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-28 13:01:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:01:51,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:01:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-28 13:01:51,829 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-28 13:01:51,830 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-28 13:01:51,830 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-28 13:01:51,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:01:51,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:01:51,830 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-28 13:01:51,830 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-28 13:01:51,830 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-28 13:01:51,830 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-28 13:01:51,830 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-28 13:01:51,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-28 13:01:51,968 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:51,968 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,016 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,016 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,024 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,024 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,169 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,169 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,238 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,238 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,307 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,307 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,311 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,311 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,316 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,316 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,327 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,328 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,392 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,393 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,398 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,399 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,407 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:01:52,407 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:01:52,425 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:01:52,425 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 13:01:52,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:01:52 BoogieIcfgContainer [2018-11-28 13:01:52,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:01:52,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:01:52,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:01:52,429 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:01:52,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:01:51" (1/3) ... [2018-11-28 13:01:52,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5088a3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:01:52, skipping insertion in model container [2018-11-28 13:01:52,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:51" (2/3) ... [2018-11-28 13:01:52,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5088a3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:01:52, skipping insertion in model container [2018-11-28 13:01:52,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:01:52" (3/3) ... [2018-11-28 13:01:52,431 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 13:01:52,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:01:52,442 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:01:52,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:01:52,474 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:01:52,474 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:01:52,474 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:01:52,474 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:01:52,475 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:01:52,475 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:01:52,475 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:01:52,475 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:01:52,475 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:01:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states. [2018-11-28 13:01:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 13:01:52,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:52,498 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-28 13:01:52,500 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:52,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash -309041171, now seen corresponding path program 1 times [2018-11-28 13:01:52,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:52,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:52,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:52,660 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-28 13:01:52,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:52,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:52,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:52,673 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 3 states. [2018-11-28 13:01:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:52,744 INFO L93 Difference]: Finished difference Result 508 states and 727 transitions. [2018-11-28 13:01:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:52,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 13:01:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:52,758 INFO L225 Difference]: With dead ends: 508 [2018-11-28 13:01:52,758 INFO L226 Difference]: Without dead ends: 292 [2018-11-28 13:01:52,763 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-28 13:01:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-28 13:01:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-11-28 13:01:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-28 13:01:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2018-11-28 13:01:52,805 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2018-11-28 13:01:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:52,806 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2018-11-28 13:01:52,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2018-11-28 13:01:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:01:52,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:52,807 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-28 13:01:52,807 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:52,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash -940725380, now seen corresponding path program 1 times [2018-11-28 13:01:52,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:52,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:52,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:52,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:52,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:52,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-28 13:01:52,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:52,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:52,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:52,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:52,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:52,926 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand 3 states. [2018-11-28 13:01:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:53,044 INFO L93 Difference]: Finished difference Result 601 states and 800 transitions. [2018-11-28 13:01:53,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:53,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 13:01:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:53,048 INFO L225 Difference]: With dead ends: 601 [2018-11-28 13:01:53,048 INFO L226 Difference]: Without dead ends: 440 [2018-11-28 13:01:53,049 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-28 13:01:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-28 13:01:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 423. [2018-11-28 13:01:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-11-28 13:01:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 560 transitions. [2018-11-28 13:01:53,079 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 560 transitions. Word has length 28 [2018-11-28 13:01:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:53,080 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 560 transitions. [2018-11-28 13:01:53,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 560 transitions. [2018-11-28 13:01:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:01:53,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:53,081 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-28 13:01:53,081 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:53,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1226553269, now seen corresponding path program 1 times [2018-11-28 13:01:53,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:53,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:53,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:53,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:53,140 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-28 13:01:53,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:53,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:53,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:53,141 INFO L87 Difference]: Start difference. First operand 423 states and 560 transitions. Second operand 3 states. [2018-11-28 13:01:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:53,196 INFO L93 Difference]: Finished difference Result 913 states and 1215 transitions. [2018-11-28 13:01:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:53,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 13:01:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:53,200 INFO L225 Difference]: With dead ends: 913 [2018-11-28 13:01:53,200 INFO L226 Difference]: Without dead ends: 651 [2018-11-28 13:01:53,201 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-28 13:01:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-11-28 13:01:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 620. [2018-11-28 13:01:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-28 13:01:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 828 transitions. [2018-11-28 13:01:53,231 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 828 transitions. Word has length 30 [2018-11-28 13:01:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:53,231 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 828 transitions. [2018-11-28 13:01:53,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 828 transitions. [2018-11-28 13:01:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 13:01:53,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:53,233 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-28 13:01:53,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:53,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:53,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2035434096, now seen corresponding path program 1 times [2018-11-28 13:01:53,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:53,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:53,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:53,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:53,288 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-28 13:01:53,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:53,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:53,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:53,289 INFO L87 Difference]: Start difference. First operand 620 states and 828 transitions. Second operand 3 states. [2018-11-28 13:01:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:53,330 INFO L93 Difference]: Finished difference Result 715 states and 947 transitions. [2018-11-28 13:01:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:53,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 13:01:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:53,334 INFO L225 Difference]: With dead ends: 715 [2018-11-28 13:01:53,334 INFO L226 Difference]: Without dead ends: 697 [2018-11-28 13:01:53,334 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-28 13:01:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-11-28 13:01:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 658. [2018-11-28 13:01:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-28 13:01:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 877 transitions. [2018-11-28 13:01:53,363 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 877 transitions. Word has length 34 [2018-11-28 13:01:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:53,363 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 877 transitions. [2018-11-28 13:01:53,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 877 transitions. [2018-11-28 13:01:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 13:01:53,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:53,365 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-28 13:01:53,365 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:53,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:53,366 INFO L82 PathProgramCache]: Analyzing trace with hash 897056749, now seen corresponding path program 1 times [2018-11-28 13:01:53,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:53,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:53,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:53,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:53,412 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-28 13:01:53,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:53,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:53,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:53,413 INFO L87 Difference]: Start difference. First operand 658 states and 877 transitions. Second operand 3 states. [2018-11-28 13:01:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:53,496 INFO L93 Difference]: Finished difference Result 1029 states and 1392 transitions. [2018-11-28 13:01:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:53,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-28 13:01:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:53,500 INFO L225 Difference]: With dead ends: 1029 [2018-11-28 13:01:53,500 INFO L226 Difference]: Without dead ends: 1026 [2018-11-28 13:01:53,501 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-28 13:01:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-11-28 13:01:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 781. [2018-11-28 13:01:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-11-28 13:01:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1046 transitions. [2018-11-28 13:01:53,538 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1046 transitions. Word has length 41 [2018-11-28 13:01:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:53,539 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1046 transitions. [2018-11-28 13:01:53,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1046 transitions. [2018-11-28 13:01:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 13:01:53,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:53,541 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-28 13:01:53,542 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:53,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash 999260852, now seen corresponding path program 1 times [2018-11-28 13:01:53,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:53,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:53,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:53,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:53,588 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-28 13:01:53,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:53,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:53,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:53,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:53,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:53,589 INFO L87 Difference]: Start difference. First operand 781 states and 1046 transitions. Second operand 3 states. [2018-11-28 13:01:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:53,670 INFO L93 Difference]: Finished difference Result 796 states and 1066 transitions. [2018-11-28 13:01:53,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:53,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-28 13:01:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:53,674 INFO L225 Difference]: With dead ends: 796 [2018-11-28 13:01:53,674 INFO L226 Difference]: Without dead ends: 793 [2018-11-28 13:01:53,675 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-28 13:01:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-11-28 13:01:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 792. [2018-11-28 13:01:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-28 13:01:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1060 transitions. [2018-11-28 13:01:53,702 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1060 transitions. Word has length 40 [2018-11-28 13:01:53,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:53,702 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1060 transitions. [2018-11-28 13:01:53,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1060 transitions. [2018-11-28 13:01:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 13:01:53,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:53,704 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-28 13:01:53,704 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:53,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1052368345, now seen corresponding path program 1 times [2018-11-28 13:01:53,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:53,769 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-28 13:01:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:53,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:53,771 INFO L87 Difference]: Start difference. First operand 792 states and 1060 transitions. Second operand 3 states. [2018-11-28 13:01:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:53,842 INFO L93 Difference]: Finished difference Result 824 states and 1098 transitions. [2018-11-28 13:01:53,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:53,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-28 13:01:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:53,846 INFO L225 Difference]: With dead ends: 824 [2018-11-28 13:01:53,847 INFO L226 Difference]: Without dead ends: 819 [2018-11-28 13:01:53,848 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-28 13:01:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-28 13:01:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2018-11-28 13:01:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-11-28 13:01:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1091 transitions. [2018-11-28 13:01:53,885 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1091 transitions. Word has length 41 [2018-11-28 13:01:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:53,885 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1091 transitions. [2018-11-28 13:01:53,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1091 transitions. [2018-11-28 13:01:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 13:01:53,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:53,886 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-28 13:01:53,887 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:53,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:53,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1801128385, now seen corresponding path program 1 times [2018-11-28 13:01:53,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:53,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:53,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:53,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:53,957 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-28 13:01:53,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:53,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:01:53,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:01:53,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:01:53,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:01:53,958 INFO L87 Difference]: Start difference. First operand 817 states and 1091 transitions. Second operand 5 states. [2018-11-28 13:01:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:54,519 INFO L93 Difference]: Finished difference Result 1536 states and 2036 transitions. [2018-11-28 13:01:54,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:01:54,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-28 13:01:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:54,523 INFO L225 Difference]: With dead ends: 1536 [2018-11-28 13:01:54,523 INFO L226 Difference]: Without dead ends: 985 [2018-11-28 13:01:54,525 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-28 13:01:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-11-28 13:01:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 808. [2018-11-28 13:01:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-28 13:01:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1070 transitions. [2018-11-28 13:01:54,569 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1070 transitions. Word has length 42 [2018-11-28 13:01:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:54,569 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1070 transitions. [2018-11-28 13:01:54,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:01:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1070 transitions. [2018-11-28 13:01:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 13:01:54,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:54,571 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-28 13:01:54,571 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:54,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1284438240, now seen corresponding path program 1 times [2018-11-28 13:01:54,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:54,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:54,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:54,617 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-28 13:01:54,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:54,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:01:54,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:01:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:01:54,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:01:54,618 INFO L87 Difference]: Start difference. First operand 808 states and 1070 transitions. Second operand 5 states. [2018-11-28 13:01:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:54,909 INFO L93 Difference]: Finished difference Result 816 states and 1076 transitions. [2018-11-28 13:01:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:01:54,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-28 13:01:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:54,912 INFO L225 Difference]: With dead ends: 816 [2018-11-28 13:01:54,912 INFO L226 Difference]: Without dead ends: 810 [2018-11-28 13:01:54,913 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-28 13:01:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-28 13:01:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2018-11-28 13:01:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-28 13:01:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1069 transitions. [2018-11-28 13:01:54,953 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1069 transitions. Word has length 42 [2018-11-28 13:01:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:54,953 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1069 transitions. [2018-11-28 13:01:54,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:01:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1069 transitions. [2018-11-28 13:01:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 13:01:54,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:54,955 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-28 13:01:54,955 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:54,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2023267546, now seen corresponding path program 1 times [2018-11-28 13:01:54,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:54,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:54,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:54,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:54,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:55,010 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-28 13:01:55,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:55,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:01:55,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:01:55,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:01:55,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:01:55,011 INFO L87 Difference]: Start difference. First operand 808 states and 1069 transitions. Second operand 5 states. [2018-11-28 13:01:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:55,254 INFO L93 Difference]: Finished difference Result 816 states and 1075 transitions. [2018-11-28 13:01:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:01:55,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-28 13:01:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:55,257 INFO L225 Difference]: With dead ends: 816 [2018-11-28 13:01:55,258 INFO L226 Difference]: Without dead ends: 810 [2018-11-28 13:01:55,258 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-28 13:01:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-28 13:01:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2018-11-28 13:01:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-28 13:01:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1068 transitions. [2018-11-28 13:01:55,308 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1068 transitions. Word has length 43 [2018-11-28 13:01:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:55,309 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1068 transitions. [2018-11-28 13:01:55,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:01:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1068 transitions. [2018-11-28 13:01:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:01:55,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:55,310 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-28 13:01:55,310 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:55,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1786995081, now seen corresponding path program 1 times [2018-11-28 13:01:55,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:55,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:55,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:55,392 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-28 13:01:55,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:55,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:01:55,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:01:55,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:01:55,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:01:55,394 INFO L87 Difference]: Start difference. First operand 808 states and 1068 transitions. Second operand 5 states. [2018-11-28 13:01:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:55,452 INFO L93 Difference]: Finished difference Result 824 states and 1083 transitions. [2018-11-28 13:01:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:01:55,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-28 13:01:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:55,456 INFO L225 Difference]: With dead ends: 824 [2018-11-28 13:01:55,456 INFO L226 Difference]: Without dead ends: 806 [2018-11-28 13:01:55,457 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-28 13:01:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-11-28 13:01:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2018-11-28 13:01:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-11-28 13:01:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1064 transitions. [2018-11-28 13:01:55,508 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1064 transitions. Word has length 44 [2018-11-28 13:01:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:55,508 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1064 transitions. [2018-11-28 13:01:55,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:01:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1064 transitions. [2018-11-28 13:01:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 13:01:55,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:55,510 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-28 13:01:55,510 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:55,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1151742481, now seen corresponding path program 1 times [2018-11-28 13:01:55,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:55,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:55,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:55,584 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-28 13:01:55,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:55,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:01:55,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:01:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:01:55,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:01:55,585 INFO L87 Difference]: Start difference. First operand 806 states and 1064 transitions. Second operand 4 states. [2018-11-28 13:01:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:55,765 INFO L93 Difference]: Finished difference Result 890 states and 1147 transitions. [2018-11-28 13:01:55,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:01:55,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-28 13:01:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:55,768 INFO L225 Difference]: With dead ends: 890 [2018-11-28 13:01:55,768 INFO L226 Difference]: Without dead ends: 557 [2018-11-28 13:01:55,769 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-28 13:01:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-11-28 13:01:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 520. [2018-11-28 13:01:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-28 13:01:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 659 transitions. [2018-11-28 13:01:55,800 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 659 transitions. Word has length 49 [2018-11-28 13:01:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:55,800 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 659 transitions. [2018-11-28 13:01:55,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:01:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 659 transitions. [2018-11-28 13:01:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:01:55,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:55,801 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-28 13:01:55,801 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:55,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1304384875, now seen corresponding path program 1 times [2018-11-28 13:01:55,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:55,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:55,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:55,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:55,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:55,837 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-28 13:01:55,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:55,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:55,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:55,838 INFO L87 Difference]: Start difference. First operand 520 states and 659 transitions. Second operand 3 states. [2018-11-28 13:01:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:55,899 INFO L93 Difference]: Finished difference Result 789 states and 1008 transitions. [2018-11-28 13:01:55,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:55,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-28 13:01:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:55,902 INFO L225 Difference]: With dead ends: 789 [2018-11-28 13:01:55,902 INFO L226 Difference]: Without dead ends: 528 [2018-11-28 13:01:55,903 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-28 13:01:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-11-28 13:01:55,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-11-28 13:01:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-28 13:01:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 670 transitions. [2018-11-28 13:01:55,931 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 670 transitions. Word has length 55 [2018-11-28 13:01:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:55,931 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 670 transitions. [2018-11-28 13:01:55,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 670 transitions. [2018-11-28 13:01:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:01:55,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:55,932 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-28 13:01:55,933 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:55,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1872524112, now seen corresponding path program 1 times [2018-11-28 13:01:55,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:55,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:55,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:55,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:55,961 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-28 13:01:55,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:55,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:55,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:55,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:55,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:55,962 INFO L87 Difference]: Start difference. First operand 528 states and 670 transitions. Second operand 3 states. [2018-11-28 13:01:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:56,055 INFO L93 Difference]: Finished difference Result 720 states and 928 transitions. [2018-11-28 13:01:56,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:56,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 13:01:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:56,058 INFO L225 Difference]: With dead ends: 720 [2018-11-28 13:01:56,059 INFO L226 Difference]: Without dead ends: 712 [2018-11-28 13:01:56,059 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-28 13:01:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-11-28 13:01:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 582. [2018-11-28 13:01:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-28 13:01:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 738 transitions. [2018-11-28 13:01:56,093 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 738 transitions. Word has length 52 [2018-11-28 13:01:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:56,093 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 738 transitions. [2018-11-28 13:01:56,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 738 transitions. [2018-11-28 13:01:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:01:56,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:56,095 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-28 13:01:56,095 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:56,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1629136409, now seen corresponding path program 1 times [2018-11-28 13:01:56,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:56,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:56,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:56,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:56,158 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-28 13:01:56,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:56,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:01:56,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:01:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:01:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:01:56,159 INFO L87 Difference]: Start difference. First operand 582 states and 738 transitions. Second operand 8 states. [2018-11-28 13:01:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:56,293 INFO L93 Difference]: Finished difference Result 612 states and 772 transitions. [2018-11-28 13:01:56,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:01:56,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-28 13:01:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:56,296 INFO L225 Difference]: With dead ends: 612 [2018-11-28 13:01:56,296 INFO L226 Difference]: Without dead ends: 608 [2018-11-28 13:01:56,297 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-28 13:01:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-28 13:01:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2018-11-28 13:01:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-28 13:01:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 759 transitions. [2018-11-28 13:01:56,334 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 759 transitions. Word has length 53 [2018-11-28 13:01:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:56,334 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 759 transitions. [2018-11-28 13:01:56,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:01:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 759 transitions. [2018-11-28 13:01:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:01:56,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:56,335 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-28 13:01:56,336 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:56,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1629413239, now seen corresponding path program 1 times [2018-11-28 13:01:56,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:56,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:56,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:56,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:56,402 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-28 13:01:56,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:56,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:01:56,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:01:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:01:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:01:56,403 INFO L87 Difference]: Start difference. First operand 600 states and 759 transitions. Second operand 8 states. [2018-11-28 13:01:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:56,492 INFO L93 Difference]: Finished difference Result 1000 states and 1288 transitions. [2018-11-28 13:01:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:01:56,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-28 13:01:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:56,496 INFO L225 Difference]: With dead ends: 1000 [2018-11-28 13:01:56,496 INFO L226 Difference]: Without dead ends: 649 [2018-11-28 13:01:56,497 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-28 13:01:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-11-28 13:01:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2018-11-28 13:01:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-11-28 13:01:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 804 transitions. [2018-11-28 13:01:56,533 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 804 transitions. Word has length 53 [2018-11-28 13:01:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:56,533 INFO L480 AbstractCegarLoop]: Abstraction has 629 states and 804 transitions. [2018-11-28 13:01:56,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:01:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 804 transitions. [2018-11-28 13:01:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:01:56,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:56,535 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-28 13:01:56,535 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:56,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1678961307, now seen corresponding path program 1 times [2018-11-28 13:01:56,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:56,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:56,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:56,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:56,677 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-28 13:01:56,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:56,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:01:56,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:01:56,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:01:56,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:01:56,678 INFO L87 Difference]: Start difference. First operand 629 states and 804 transitions. Second operand 5 states. [2018-11-28 13:01:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:56,728 INFO L93 Difference]: Finished difference Result 884 states and 1133 transitions. [2018-11-28 13:01:56,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:01:56,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-28 13:01:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:56,731 INFO L225 Difference]: With dead ends: 884 [2018-11-28 13:01:56,731 INFO L226 Difference]: Without dead ends: 610 [2018-11-28 13:01:56,732 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-28 13:01:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-11-28 13:01:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2018-11-28 13:01:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-28 13:01:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2018-11-28 13:01:56,767 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 61 [2018-11-28 13:01:56,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:56,768 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2018-11-28 13:01:56,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:01:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2018-11-28 13:01:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:01:56,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:56,769 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-28 13:01:56,769 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:56,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:56,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1631638869, now seen corresponding path program 1 times [2018-11-28 13:01:56,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:56,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:56,820 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-28 13:01:56,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:56,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:56,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:56,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:56,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:56,821 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 3 states. [2018-11-28 13:01:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:56,911 INFO L93 Difference]: Finished difference Result 709 states and 896 transitions. [2018-11-28 13:01:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:56,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-28 13:01:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:56,914 INFO L225 Difference]: With dead ends: 709 [2018-11-28 13:01:56,914 INFO L226 Difference]: Without dead ends: 684 [2018-11-28 13:01:56,914 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-28 13:01:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-11-28 13:01:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 674. [2018-11-28 13:01:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-11-28 13:01:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 855 transitions. [2018-11-28 13:01:56,958 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 855 transitions. Word has length 54 [2018-11-28 13:01:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:56,958 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 855 transitions. [2018-11-28 13:01:56,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 855 transitions. [2018-11-28 13:01:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:01:56,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:56,959 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-28 13:01:56,959 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:56,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1488359511, now seen corresponding path program 1 times [2018-11-28 13:01:56,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:56,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:57,004 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-28 13:01:57,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:57,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:01:57,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:01:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:01:57,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:01:57,005 INFO L87 Difference]: Start difference. First operand 674 states and 855 transitions. Second operand 7 states. [2018-11-28 13:01:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:57,613 INFO L93 Difference]: Finished difference Result 708 states and 893 transitions. [2018-11-28 13:01:57,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:01:57,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-28 13:01:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:57,616 INFO L225 Difference]: With dead ends: 708 [2018-11-28 13:01:57,616 INFO L226 Difference]: Without dead ends: 604 [2018-11-28 13:01:57,617 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-28 13:01:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-11-28 13:01:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 582. [2018-11-28 13:01:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-28 13:01:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 732 transitions. [2018-11-28 13:01:57,654 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 732 transitions. Word has length 54 [2018-11-28 13:01:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:57,654 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 732 transitions. [2018-11-28 13:01:57,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:01:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 732 transitions. [2018-11-28 13:01:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:01:57,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:57,655 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-28 13:01:57,656 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:57,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash 39700081, now seen corresponding path program 1 times [2018-11-28 13:01:57,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:57,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:57,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:57,722 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-28 13:01:57,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:57,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:01:57,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:01:57,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:01:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:01:57,723 INFO L87 Difference]: Start difference. First operand 582 states and 732 transitions. Second operand 9 states. [2018-11-28 13:01:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:58,636 INFO L93 Difference]: Finished difference Result 777 states and 972 transitions. [2018-11-28 13:01:58,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:01:58,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-28 13:01:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:58,639 INFO L225 Difference]: With dead ends: 777 [2018-11-28 13:01:58,639 INFO L226 Difference]: Without dead ends: 701 [2018-11-28 13:01:58,640 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-28 13:01:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-11-28 13:01:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 589. [2018-11-28 13:01:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-11-28 13:01:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 733 transitions. [2018-11-28 13:01:58,666 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 733 transitions. Word has length 54 [2018-11-28 13:01:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:58,666 INFO L480 AbstractCegarLoop]: Abstraction has 589 states and 733 transitions. [2018-11-28 13:01:58,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:01:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 733 transitions. [2018-11-28 13:01:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:01:58,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:58,668 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-28 13:01:58,668 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:58,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash -381110486, now seen corresponding path program 1 times [2018-11-28 13:01:58,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:58,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:58,704 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-28 13:01:58,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:58,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:01:58,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:01:58,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:01:58,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:01:58,705 INFO L87 Difference]: Start difference. First operand 589 states and 733 transitions. Second operand 6 states. [2018-11-28 13:01:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:58,747 INFO L93 Difference]: Finished difference Result 608 states and 752 transitions. [2018-11-28 13:01:58,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:01:58,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-28 13:01:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:58,750 INFO L225 Difference]: With dead ends: 608 [2018-11-28 13:01:58,750 INFO L226 Difference]: Without dead ends: 569 [2018-11-28 13:01:58,750 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-28 13:01:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-11-28 13:01:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2018-11-28 13:01:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-11-28 13:01:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 708 transitions. [2018-11-28 13:01:58,772 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 708 transitions. Word has length 57 [2018-11-28 13:01:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:58,773 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 708 transitions. [2018-11-28 13:01:58,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:01:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 708 transitions. [2018-11-28 13:01:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 13:01:58,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:58,774 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-28 13:01:58,774 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:58,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1488177932, now seen corresponding path program 1 times [2018-11-28 13:01:58,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:58,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:58,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:58,815 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-28 13:01:58,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:58,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:01:58,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:01:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:01:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:01:58,816 INFO L87 Difference]: Start difference. First operand 569 states and 708 transitions. Second operand 5 states. [2018-11-28 13:01:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:58,983 INFO L93 Difference]: Finished difference Result 581 states and 719 transitions. [2018-11-28 13:01:58,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:01:58,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-11-28 13:01:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:58,986 INFO L225 Difference]: With dead ends: 581 [2018-11-28 13:01:58,986 INFO L226 Difference]: Without dead ends: 563 [2018-11-28 13:01:58,986 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-28 13:01:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-28 13:01:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 552. [2018-11-28 13:01:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-28 13:01:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 683 transitions. [2018-11-28 13:01:59,010 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 683 transitions. Word has length 56 [2018-11-28 13:01:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:59,010 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 683 transitions. [2018-11-28 13:01:59,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:01:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 683 transitions. [2018-11-28 13:01:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:01:59,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:59,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] [2018-11-28 13:01:59,011 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:59,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:59,011 INFO L82 PathProgramCache]: Analyzing trace with hash -12265598, now seen corresponding path program 1 times [2018-11-28 13:01:59,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:59,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:59,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:59,068 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-28 13:01:59,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:59,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:01:59,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:01:59,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:01:59,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:01:59,069 INFO L87 Difference]: Start difference. First operand 552 states and 683 transitions. Second operand 5 states. [2018-11-28 13:01:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:59,222 INFO L93 Difference]: Finished difference Result 811 states and 1012 transitions. [2018-11-28 13:01:59,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:01:59,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 13:01:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:59,225 INFO L225 Difference]: With dead ends: 811 [2018-11-28 13:01:59,225 INFO L226 Difference]: Without dead ends: 552 [2018-11-28 13:01:59,226 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-28 13:01:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-11-28 13:01:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2018-11-28 13:01:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-28 13:01:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2018-11-28 13:01:59,248 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 65 [2018-11-28 13:01:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:59,249 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2018-11-28 13:01:59,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:01:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2018-11-28 13:01:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:01:59,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:59,250 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-28 13:01:59,250 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:59,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:59,250 INFO L82 PathProgramCache]: Analyzing trace with hash 118426915, now seen corresponding path program 1 times [2018-11-28 13:01:59,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:59,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:59,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:59,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:59,280 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-28 13:01:59,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:59,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:59,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:59,281 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand 3 states. [2018-11-28 13:01:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:59,309 INFO L93 Difference]: Finished difference Result 837 states and 1046 transitions. [2018-11-28 13:01:59,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:59,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-28 13:01:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:59,311 INFO L225 Difference]: With dead ends: 837 [2018-11-28 13:01:59,311 INFO L226 Difference]: Without dead ends: 578 [2018-11-28 13:01:59,312 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-28 13:01:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-11-28 13:01:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 552. [2018-11-28 13:01:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-28 13:01:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2018-11-28 13:01:59,335 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 68 [2018-11-28 13:01:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:59,335 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2018-11-28 13:01:59,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2018-11-28 13:01:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:01:59,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:59,336 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-28 13:01:59,336 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:59,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2112462179, now seen corresponding path program 1 times [2018-11-28 13:01:59,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:59,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:59,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:59,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:59,395 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-28 13:01:59,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:59,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:01:59,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:01:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:01:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:01:59,396 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand 6 states. [2018-11-28 13:01:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:59,439 INFO L93 Difference]: Finished difference Result 805 states and 1000 transitions. [2018-11-28 13:01:59,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:01:59,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 13:01:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:59,441 INFO L225 Difference]: With dead ends: 805 [2018-11-28 13:01:59,441 INFO L226 Difference]: Without dead ends: 579 [2018-11-28 13:01:59,442 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-28 13:01:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-11-28 13:01:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 552. [2018-11-28 13:01:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-28 13:01:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 679 transitions. [2018-11-28 13:01:59,465 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 679 transitions. Word has length 68 [2018-11-28 13:01:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:59,466 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 679 transitions. [2018-11-28 13:01:59,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:01:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 679 transitions. [2018-11-28 13:01:59,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:01:59,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:59,467 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-28 13:01:59,467 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:59,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1566897792, now seen corresponding path program 1 times [2018-11-28 13:01:59,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:59,520 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-28 13:01:59,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:59,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:01:59,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:01:59,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:01:59,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:01:59,521 INFO L87 Difference]: Start difference. First operand 552 states and 679 transitions. Second operand 9 states. [2018-11-28 13:01:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:59,627 INFO L93 Difference]: Finished difference Result 569 states and 696 transitions. [2018-11-28 13:01:59,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:01:59,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-28 13:01:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:59,629 INFO L225 Difference]: With dead ends: 569 [2018-11-28 13:01:59,629 INFO L226 Difference]: Without dead ends: 548 [2018-11-28 13:01:59,630 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-28 13:01:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-11-28 13:01:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2018-11-28 13:01:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-11-28 13:01:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 673 transitions. [2018-11-28 13:01:59,652 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 673 transitions. Word has length 60 [2018-11-28 13:01:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:59,652 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 673 transitions. [2018-11-28 13:01:59,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:01:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 673 transitions. [2018-11-28 13:01:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:01:59,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:59,653 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-28 13:01:59,654 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:59,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:59,654 INFO L82 PathProgramCache]: Analyzing trace with hash -938148036, now seen corresponding path program 1 times [2018-11-28 13:01:59,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:59,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:59,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:59,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:59,701 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-28 13:01:59,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:59,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:01:59,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:01:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:01:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:01:59,702 INFO L87 Difference]: Start difference. First operand 548 states and 673 transitions. Second operand 9 states. [2018-11-28 13:01:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:59,804 INFO L93 Difference]: Finished difference Result 565 states and 690 transitions. [2018-11-28 13:01:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:01:59,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-28 13:01:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:59,806 INFO L225 Difference]: With dead ends: 565 [2018-11-28 13:01:59,806 INFO L226 Difference]: Without dead ends: 543 [2018-11-28 13:01:59,807 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-28 13:01:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-11-28 13:01:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2018-11-28 13:01:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-11-28 13:01:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 666 transitions. [2018-11-28 13:01:59,829 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 666 transitions. Word has length 61 [2018-11-28 13:01:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:59,830 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 666 transitions. [2018-11-28 13:01:59,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:01:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 666 transitions. [2018-11-28 13:01:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:01:59,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:59,831 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-28 13:01:59,831 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:59,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:59,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1868259506, now seen corresponding path program 1 times [2018-11-28 13:01:59,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:59,884 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-28 13:01:59,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:59,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:01:59,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:01:59,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:01:59,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:01:59,885 INFO L87 Difference]: Start difference. First operand 543 states and 666 transitions. Second operand 9 states. [2018-11-28 13:01:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:59,987 INFO L93 Difference]: Finished difference Result 560 states and 683 transitions. [2018-11-28 13:01:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:01:59,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-28 13:01:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:59,989 INFO L225 Difference]: With dead ends: 560 [2018-11-28 13:01:59,989 INFO L226 Difference]: Without dead ends: 539 [2018-11-28 13:01:59,990 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-28 13:01:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-11-28 13:02:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2018-11-28 13:02:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-28 13:02:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 660 transitions. [2018-11-28 13:02:00,012 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 660 transitions. Word has length 61 [2018-11-28 13:02:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:00,012 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 660 transitions. [2018-11-28 13:02:00,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:02:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 660 transitions. [2018-11-28 13:02:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 13:02:00,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:00,013 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-28 13:02:00,014 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:00,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:00,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1408260900, now seen corresponding path program 1 times [2018-11-28 13:02:00,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:00,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:00,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:00,082 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-28 13:02:00,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:00,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:00,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:00,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:00,083 INFO L87 Difference]: Start difference. First operand 539 states and 660 transitions. Second operand 5 states. [2018-11-28 13:02:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:00,335 INFO L93 Difference]: Finished difference Result 896 states and 1107 transitions. [2018-11-28 13:02:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:00,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 13:02:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:00,338 INFO L225 Difference]: With dead ends: 896 [2018-11-28 13:02:00,338 INFO L226 Difference]: Without dead ends: 643 [2018-11-28 13:02:00,339 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-28 13:02:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-28 13:02:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 613. [2018-11-28 13:02:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-28 13:02:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 754 transitions. [2018-11-28 13:02:00,389 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 754 transitions. Word has length 67 [2018-11-28 13:02:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:00,389 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 754 transitions. [2018-11-28 13:02:00,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 754 transitions. [2018-11-28 13:02:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:02:00,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:00,391 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-28 13:02:00,391 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:00,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:00,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1726599875, now seen corresponding path program 1 times [2018-11-28 13:02:00,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:00,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:00,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:00,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:00,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:00,436 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-28 13:02:00,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:00,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:02:00,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:02:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:02:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:02:00,437 INFO L87 Difference]: Start difference. First operand 613 states and 754 transitions. Second operand 9 states. [2018-11-28 13:02:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:00,549 INFO L93 Difference]: Finished difference Result 630 states and 771 transitions. [2018-11-28 13:02:00,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:02:00,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-11-28 13:02:00,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:00,551 INFO L225 Difference]: With dead ends: 630 [2018-11-28 13:02:00,551 INFO L226 Difference]: Without dead ends: 587 [2018-11-28 13:02:00,552 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-28 13:02:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-28 13:02:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-11-28 13:02:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-11-28 13:02:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 722 transitions. [2018-11-28 13:02:00,579 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 722 transitions. Word has length 65 [2018-11-28 13:02:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:00,579 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 722 transitions. [2018-11-28 13:02:00,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:02:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 722 transitions. [2018-11-28 13:02:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:02:00,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:00,581 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-28 13:02:00,581 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:00,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1495752637, now seen corresponding path program 1 times [2018-11-28 13:02:00,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:00,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:00,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:00,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:00,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:00,646 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-28 13:02:00,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:00,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:02:00,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:02:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:02:00,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:02:00,647 INFO L87 Difference]: Start difference. First operand 587 states and 722 transitions. Second operand 7 states. [2018-11-28 13:02:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:01,088 INFO L93 Difference]: Finished difference Result 891 states and 1100 transitions. [2018-11-28 13:02:01,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:02:01,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-28 13:02:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:01,091 INFO L225 Difference]: With dead ends: 891 [2018-11-28 13:02:01,091 INFO L226 Difference]: Without dead ends: 582 [2018-11-28 13:02:01,092 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-28 13:02:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-11-28 13:02:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 571. [2018-11-28 13:02:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-11-28 13:02:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 697 transitions. [2018-11-28 13:02:01,140 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 697 transitions. Word has length 79 [2018-11-28 13:02:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:01,140 INFO L480 AbstractCegarLoop]: Abstraction has 571 states and 697 transitions. [2018-11-28 13:02:01,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:02:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 697 transitions. [2018-11-28 13:02:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:02:01,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:01,142 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-28 13:02:01,145 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:01,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash -229993641, now seen corresponding path program 1 times [2018-11-28 13:02:01,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:01,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:01,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:01,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:01,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:01,242 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-28 13:02:01,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:01,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:01,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:01,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:01,243 INFO L87 Difference]: Start difference. First operand 571 states and 697 transitions. Second operand 6 states. [2018-11-28 13:02:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:01,326 INFO L93 Difference]: Finished difference Result 888 states and 1109 transitions. [2018-11-28 13:02:01,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:01,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-28 13:02:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:01,328 INFO L225 Difference]: With dead ends: 888 [2018-11-28 13:02:01,328 INFO L226 Difference]: Without dead ends: 634 [2018-11-28 13:02:01,329 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-28 13:02:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-28 13:02:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 537. [2018-11-28 13:02:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-28 13:02:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 653 transitions. [2018-11-28 13:02:01,376 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 653 transitions. Word has length 80 [2018-11-28 13:02:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:01,377 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 653 transitions. [2018-11-28 13:02:01,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 653 transitions. [2018-11-28 13:02:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 13:02:01,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:01,378 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-28 13:02:01,378 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:01,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1921735627, now seen corresponding path program 1 times [2018-11-28 13:02:01,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:01,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:01,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:01,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:01,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:01,438 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-28 13:02:01,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:01,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:01,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:01,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:01,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:01,439 INFO L87 Difference]: Start difference. First operand 537 states and 653 transitions. Second operand 5 states. [2018-11-28 13:02:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:01,689 INFO L93 Difference]: Finished difference Result 973 states and 1159 transitions. [2018-11-28 13:02:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:01,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-28 13:02:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:01,690 INFO L225 Difference]: With dead ends: 973 [2018-11-28 13:02:01,691 INFO L226 Difference]: Without dead ends: 603 [2018-11-28 13:02:01,692 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-28 13:02:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-11-28 13:02:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 580. [2018-11-28 13:02:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-28 13:02:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 690 transitions. [2018-11-28 13:02:01,741 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 690 transitions. Word has length 75 [2018-11-28 13:02:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:01,742 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 690 transitions. [2018-11-28 13:02:01,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 690 transitions. [2018-11-28 13:02:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:02:01,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:01,743 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-28 13:02:01,743 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:01,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1118408541, now seen corresponding path program 1 times [2018-11-28 13:02:01,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:01,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:01,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:01,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:01,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:01,823 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-28 13:02:01,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:01,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:02:01,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:02:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:02:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:02:01,824 INFO L87 Difference]: Start difference. First operand 580 states and 690 transitions. Second operand 9 states. [2018-11-28 13:02:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:01,928 INFO L93 Difference]: Finished difference Result 582 states and 691 transitions. [2018-11-28 13:02:01,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:02:01,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-11-28 13:02:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:01,932 INFO L225 Difference]: With dead ends: 582 [2018-11-28 13:02:01,932 INFO L226 Difference]: Without dead ends: 446 [2018-11-28 13:02:01,933 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-28 13:02:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-28 13:02:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-11-28 13:02:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-11-28 13:02:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 532 transitions. [2018-11-28 13:02:01,972 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 532 transitions. Word has length 78 [2018-11-28 13:02:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:01,972 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 532 transitions. [2018-11-28 13:02:01,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:02:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 532 transitions. [2018-11-28 13:02:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 13:02:01,973 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:01,973 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-28 13:02:01,973 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:01,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:01,973 INFO L82 PathProgramCache]: Analyzing trace with hash -534163168, now seen corresponding path program 1 times [2018-11-28 13:02:01,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:01,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:01,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:01,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:01,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:02,077 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-28 13:02:02,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:02,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:02:02,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:02:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:02:02,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:02:02,080 INFO L87 Difference]: Start difference. First operand 446 states and 532 transitions. Second operand 9 states. [2018-11-28 13:02:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:02,185 INFO L93 Difference]: Finished difference Result 467 states and 554 transitions. [2018-11-28 13:02:02,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:02:02,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-11-28 13:02:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:02,188 INFO L225 Difference]: With dead ends: 467 [2018-11-28 13:02:02,188 INFO L226 Difference]: Without dead ends: 446 [2018-11-28 13:02:02,188 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-28 13:02:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-28 13:02:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-11-28 13:02:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-11-28 13:02:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 531 transitions. [2018-11-28 13:02:02,228 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 531 transitions. Word has length 85 [2018-11-28 13:02:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:02,230 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 531 transitions. [2018-11-28 13:02:02,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:02:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 531 transitions. [2018-11-28 13:02:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:02:02,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:02,231 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-28 13:02:02,232 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:02,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1730477814, now seen corresponding path program 1 times [2018-11-28 13:02:02,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:02,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:02,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:02,287 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-28 13:02:02,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:02,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:02,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:02,288 INFO L87 Difference]: Start difference. First operand 446 states and 531 transitions. Second operand 6 states. [2018-11-28 13:02:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:02,347 INFO L93 Difference]: Finished difference Result 479 states and 563 transitions. [2018-11-28 13:02:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:02,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-28 13:02:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:02,349 INFO L225 Difference]: With dead ends: 479 [2018-11-28 13:02:02,349 INFO L226 Difference]: Without dead ends: 440 [2018-11-28 13:02:02,349 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-28 13:02:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-28 13:02:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 387. [2018-11-28 13:02:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-28 13:02:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 455 transitions. [2018-11-28 13:02:02,384 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 455 transitions. Word has length 96 [2018-11-28 13:02:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:02,384 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 455 transitions. [2018-11-28 13:02:02,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 455 transitions. [2018-11-28 13:02:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:02:02,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:02,385 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-28 13:02:02,385 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:02,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash -342402432, now seen corresponding path program 1 times [2018-11-28 13:02:02,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:02,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:02,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:02,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:02,458 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-28 13:02:02,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:02,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:02:02,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:02:02,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:02:02,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:02:02,459 INFO L87 Difference]: Start difference. First operand 387 states and 455 transitions. Second operand 7 states. [2018-11-28 13:02:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:02,558 INFO L93 Difference]: Finished difference Result 730 states and 864 transitions. [2018-11-28 13:02:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:02:02,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 13:02:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:02,560 INFO L225 Difference]: With dead ends: 730 [2018-11-28 13:02:02,560 INFO L226 Difference]: Without dead ends: 685 [2018-11-28 13:02:02,561 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-28 13:02:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-28 13:02:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 367. [2018-11-28 13:02:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-28 13:02:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 430 transitions. [2018-11-28 13:02:02,586 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 430 transitions. Word has length 96 [2018-11-28 13:02:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:02,586 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 430 transitions. [2018-11-28 13:02:02,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:02:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 430 transitions. [2018-11-28 13:02:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:02:02,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:02,587 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-28 13:02:02,588 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:02,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:02,588 INFO L82 PathProgramCache]: Analyzing trace with hash 730694435, now seen corresponding path program 1 times [2018-11-28 13:02:02,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:02,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:02,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:02,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:02,659 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-28 13:02:02,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:02,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:02:02,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:02:02,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:02:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:02:02,660 INFO L87 Difference]: Start difference. First operand 367 states and 430 transitions. Second operand 11 states. [2018-11-28 13:02:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:02,732 INFO L93 Difference]: Finished difference Result 512 states and 604 transitions. [2018-11-28 13:02:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:02:02,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-11-28 13:02:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:02,734 INFO L225 Difference]: With dead ends: 512 [2018-11-28 13:02:02,735 INFO L226 Difference]: Without dead ends: 363 [2018-11-28 13:02:02,735 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-28 13:02:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-28 13:02:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 350. [2018-11-28 13:02:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-11-28 13:02:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 407 transitions. [2018-11-28 13:02:02,757 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 407 transitions. Word has length 101 [2018-11-28 13:02:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:02,757 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 407 transitions. [2018-11-28 13:02:02,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:02:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 407 transitions. [2018-11-28 13:02:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-28 13:02:02,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:02,758 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-28 13:02:02,759 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:02,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1042284347, now seen corresponding path program 1 times [2018-11-28 13:02:02,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:02,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:02,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:02,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:02,805 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-28 13:02:02,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:02,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:02,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:02,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:02,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:02,806 INFO L87 Difference]: Start difference. First operand 350 states and 407 transitions. Second operand 5 states. [2018-11-28 13:02:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:02,830 INFO L93 Difference]: Finished difference Result 601 states and 707 transitions. [2018-11-28 13:02:02,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:02:02,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-11-28 13:02:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:02,832 INFO L225 Difference]: With dead ends: 601 [2018-11-28 13:02:02,832 INFO L226 Difference]: Without dead ends: 349 [2018-11-28 13:02:02,833 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-28 13:02:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-28 13:02:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-11-28 13:02:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-28 13:02:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 405 transitions. [2018-11-28 13:02:02,854 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 405 transitions. Word has length 110 [2018-11-28 13:02:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:02,854 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 405 transitions. [2018-11-28 13:02:02,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 405 transitions. [2018-11-28 13:02:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-28 13:02:02,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:02,855 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-28 13:02:02,855 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:02,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1716247270, now seen corresponding path program 1 times [2018-11-28 13:02:02,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:02,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:02,897 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-28 13:02:02,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:02,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:02,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:02,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:02,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:02,898 INFO L87 Difference]: Start difference. First operand 349 states and 405 transitions. Second operand 6 states. [2018-11-28 13:02:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:02,940 INFO L93 Difference]: Finished difference Result 377 states and 432 transitions. [2018-11-28 13:02:02,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:02,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-11-28 13:02:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:02,941 INFO L225 Difference]: With dead ends: 377 [2018-11-28 13:02:02,941 INFO L226 Difference]: Without dead ends: 301 [2018-11-28 13:02:02,942 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-28 13:02:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-28 13:02:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2018-11-28 13:02:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-28 13:02:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 265 transitions. [2018-11-28 13:02:02,957 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 265 transitions. Word has length 110 [2018-11-28 13:02:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:02,957 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 265 transitions. [2018-11-28 13:02:02,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 265 transitions. [2018-11-28 13:02:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-28 13:02:02,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:02,960 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-28 13:02:02,960 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:02,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:02,960 INFO L82 PathProgramCache]: Analyzing trace with hash 424283100, now seen corresponding path program 1 times [2018-11-28 13:02:02,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:02,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:02,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:02,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:03,037 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-28 13:02:03,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:03,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:02:03,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:02:03,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:02:03,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:02:03,038 INFO L87 Difference]: Start difference. First operand 239 states and 265 transitions. Second operand 9 states. [2018-11-28 13:02:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:03,099 INFO L93 Difference]: Finished difference Result 312 states and 353 transitions. [2018-11-28 13:02:03,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:02:03,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-11-28 13:02:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:03,101 INFO L225 Difference]: With dead ends: 312 [2018-11-28 13:02:03,101 INFO L226 Difference]: Without dead ends: 283 [2018-11-28 13:02:03,101 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-28 13:02:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-28 13:02:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2018-11-28 13:02:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-28 13:02:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2018-11-28 13:02:03,118 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 131 [2018-11-28 13:02:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:03,118 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2018-11-28 13:02:03,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:02:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2018-11-28 13:02:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-28 13:02:03,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:03,119 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-28 13:02:03,120 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:03,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash 765037084, now seen corresponding path program 1 times [2018-11-28 13:02:03,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:03,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:03,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:03,200 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-28 13:02:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:03,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:02:03,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:02:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:02:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:02:03,201 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand 9 states. [2018-11-28 13:02:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:03,268 INFO L93 Difference]: Finished difference Result 334 states and 374 transitions. [2018-11-28 13:02:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:02:03,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2018-11-28 13:02:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:03,270 INFO L225 Difference]: With dead ends: 334 [2018-11-28 13:02:03,270 INFO L226 Difference]: Without dead ends: 263 [2018-11-28 13:02:03,271 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-28 13:02:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-28 13:02:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 241. [2018-11-28 13:02:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-28 13:02:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 265 transitions. [2018-11-28 13:02:03,291 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 265 transitions. Word has length 132 [2018-11-28 13:02:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:03,291 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 265 transitions. [2018-11-28 13:02:03,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:02:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 265 transitions. [2018-11-28 13:02:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-28 13:02:03,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:03,293 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-28 13:02:03,293 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:03,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:03,293 INFO L82 PathProgramCache]: Analyzing trace with hash -672296009, now seen corresponding path program 1 times [2018-11-28 13:02:03,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:03,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:03,347 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-28 13:02:03,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:03,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:03,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:03,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:03,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:03,348 INFO L87 Difference]: Start difference. First operand 241 states and 265 transitions. Second operand 5 states. [2018-11-28 13:02:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:03,396 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-11-28 13:02:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:02:03,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-11-28 13:02:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:03,398 INFO L225 Difference]: With dead ends: 277 [2018-11-28 13:02:03,398 INFO L226 Difference]: Without dead ends: 247 [2018-11-28 13:02:03,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-28 13:02:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-28 13:02:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-11-28 13:02:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-28 13:02:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 269 transitions. [2018-11-28 13:02:03,414 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 269 transitions. Word has length 147 [2018-11-28 13:02:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:03,414 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 269 transitions. [2018-11-28 13:02:03,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 269 transitions. [2018-11-28 13:02:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-28 13:02:03,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:03,416 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-28 13:02:03,416 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:03,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash -490809512, now seen corresponding path program 1 times [2018-11-28 13:02:03,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:03,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:03,526 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-28 13:02:03,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 13:02:03,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 13:02:03,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 13:02:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:02:03,527 INFO L87 Difference]: Start difference. First operand 245 states and 269 transitions. Second operand 15 states. [2018-11-28 13:02:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:03,658 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2018-11-28 13:02:03,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:02:03,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-11-28 13:02:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:03,659 INFO L225 Difference]: With dead ends: 311 [2018-11-28 13:02:03,659 INFO L226 Difference]: Without dead ends: 276 [2018-11-28 13:02:03,659 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-28 13:02:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-28 13:02:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 262. [2018-11-28 13:02:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-28 13:02:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 290 transitions. [2018-11-28 13:02:03,676 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 290 transitions. Word has length 147 [2018-11-28 13:02:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:03,676 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 290 transitions. [2018-11-28 13:02:03,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 13:02:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 290 transitions. [2018-11-28 13:02:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-28 13:02:03,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:03,678 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-28 13:02:03,678 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:03,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1053414808, now seen corresponding path program 1 times [2018-11-28 13:02:03,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:03,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:03,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:03,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:03,738 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-28 13:02:03,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:03,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:02:03,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:02:03,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:02:03,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:02:03,739 INFO L87 Difference]: Start difference. First operand 262 states and 290 transitions. Second operand 9 states. [2018-11-28 13:02:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:03,791 INFO L93 Difference]: Finished difference Result 351 states and 391 transitions. [2018-11-28 13:02:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:02:03,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-11-28 13:02:03,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:03,793 INFO L225 Difference]: With dead ends: 351 [2018-11-28 13:02:03,794 INFO L226 Difference]: Without dead ends: 270 [2018-11-28 13:02:03,794 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-28 13:02:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-28 13:02:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2018-11-28 13:02:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-28 13:02:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 289 transitions. [2018-11-28 13:02:03,812 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 289 transitions. Word has length 148 [2018-11-28 13:02:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:03,812 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 289 transitions. [2018-11-28 13:02:03,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:02:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 289 transitions. [2018-11-28 13:02:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-28 13:02:03,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:03,814 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-28 13:02:03,814 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:03,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1979295687, now seen corresponding path program 1 times [2018-11-28 13:02:03,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:03,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:03,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:03,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:03,909 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-28 13:02:03,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:03,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/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-28 13:02:03,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:04,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:04,150 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-28 13:02:04,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:02:04,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-11-28 13:02:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 13:02:04,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 13:02:04,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:02:04,167 INFO L87 Difference]: Start difference. First operand 262 states and 289 transitions. Second operand 21 states. [2018-11-28 13:02:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:04,299 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2018-11-28 13:02:04,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:02:04,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 150 [2018-11-28 13:02:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:04,301 INFO L225 Difference]: With dead ends: 307 [2018-11-28 13:02:04,301 INFO L226 Difference]: Without dead ends: 266 [2018-11-28 13:02:04,302 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-28 13:02:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-28 13:02:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2018-11-28 13:02:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-28 13:02:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 280 transitions. [2018-11-28 13:02:04,326 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 280 transitions. Word has length 150 [2018-11-28 13:02:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:04,326 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 280 transitions. [2018-11-28 13:02:04,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 13:02:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 280 transitions. [2018-11-28 13:02:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-28 13:02:04,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:04,328 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-28 13:02:04,328 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:04,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2052783288, now seen corresponding path program 1 times [2018-11-28 13:02:04,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:04,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:04,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:04,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:04,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:04,428 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-28 13:02:04,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:04,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/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-28 13:02:04,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:04,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:04,591 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-28 13:02:04,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:02:04,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-28 13:02:04,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:02:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:02:04,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:02:04,607 INFO L87 Difference]: Start difference. First operand 256 states and 280 transitions. Second operand 14 states. [2018-11-28 13:02:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:04,748 INFO L93 Difference]: Finished difference Result 317 states and 345 transitions. [2018-11-28 13:02:04,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:02:04,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-11-28 13:02:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:04,750 INFO L225 Difference]: With dead ends: 317 [2018-11-28 13:02:04,750 INFO L226 Difference]: Without dead ends: 242 [2018-11-28 13:02:04,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:02:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-28 13:02:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 228. [2018-11-28 13:02:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-28 13:02:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 246 transitions. [2018-11-28 13:02:04,772 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 246 transitions. Word has length 155 [2018-11-28 13:02:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:04,772 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 246 transitions. [2018-11-28 13:02:04,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:02:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 246 transitions. [2018-11-28 13:02:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-28 13:02:04,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:04,774 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-28 13:02:04,774 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:04,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1661694165, now seen corresponding path program 1 times [2018-11-28 13:02:04,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:04,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:04,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:04,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:04,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:04,833 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-28 13:02:04,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:04,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:04,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:04,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:04,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:04,834 INFO L87 Difference]: Start difference. First operand 228 states and 246 transitions. Second operand 6 states. [2018-11-28 13:02:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:04,883 INFO L93 Difference]: Finished difference Result 318 states and 344 transitions. [2018-11-28 13:02:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:04,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-11-28 13:02:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:04,885 INFO L225 Difference]: With dead ends: 318 [2018-11-28 13:02:04,885 INFO L226 Difference]: Without dead ends: 233 [2018-11-28 13:02:04,886 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-28 13:02:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-28 13:02:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2018-11-28 13:02:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-28 13:02:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 244 transitions. [2018-11-28 13:02:04,905 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 244 transitions. Word has length 157 [2018-11-28 13:02:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:04,905 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 244 transitions. [2018-11-28 13:02:04,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 244 transitions. [2018-11-28 13:02:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-28 13:02:04,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:04,909 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-28 13:02:04,909 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:04,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash 386317675, now seen corresponding path program 1 times [2018-11-28 13:02:04,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:04,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:04,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:04,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:04,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:04,986 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-28 13:02:04,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:04,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:02:04,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:02:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:02:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:02:04,988 INFO L87 Difference]: Start difference. First operand 227 states and 244 transitions. Second operand 10 states. [2018-11-28 13:02:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:05,397 INFO L93 Difference]: Finished difference Result 448 states and 483 transitions. [2018-11-28 13:02:05,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:02:05,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2018-11-28 13:02:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:05,399 INFO L225 Difference]: With dead ends: 448 [2018-11-28 13:02:05,399 INFO L226 Difference]: Without dead ends: 230 [2018-11-28 13:02:05,400 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-28 13:02:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-28 13:02:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-11-28 13:02:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-28 13:02:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 243 transitions. [2018-11-28 13:02:05,419 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 243 transitions. Word has length 158 [2018-11-28 13:02:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:05,419 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 243 transitions. [2018-11-28 13:02:05,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:02:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 243 transitions. [2018-11-28 13:02:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-28 13:02:05,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:05,421 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-28 13:02:05,421 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:05,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1977523987, now seen corresponding path program 1 times [2018-11-28 13:02:05,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:05,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:05,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:05,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:05,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:05,540 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-28 13:02:05,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:05,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/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-28 13:02:05,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:05,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:05,719 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-28 13:02:05,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:02:05,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-11-28 13:02:05,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:02:05,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:02:05,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:02:05,736 INFO L87 Difference]: Start difference. First operand 227 states and 243 transitions. Second operand 19 states. [2018-11-28 13:02:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:06,517 INFO L93 Difference]: Finished difference Result 298 states and 323 transitions. [2018-11-28 13:02:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 13:02:06,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 158 [2018-11-28 13:02:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:06,519 INFO L225 Difference]: With dead ends: 298 [2018-11-28 13:02:06,519 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:02:06,520 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-28 13:02:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:02:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:02:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:02:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:02:06,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2018-11-28 13:02:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:06,520 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:02:06,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:02:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:02:06,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:02:06,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 13:02:06,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:06,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:07,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:02:08,351 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 92 [2018-11-28 13:02:08,817 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 97 [2018-11-28 13:02:09,064 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 59 [2018-11-28 13:02:09,343 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 96 [2018-11-28 13:02:09,531 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2018-11-28 13:02:09,719 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 61 [2018-11-28 13:02:09,971 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 66 [2018-11-28 13:02:10,323 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2018-11-28 13:02:10,627 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2018-11-28 13:02:10,797 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2018-11-28 13:02:11,015 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 66 [2018-11-28 13:02:11,225 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 66 [2018-11-28 13:02:11,723 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 77 [2018-11-28 13:02:12,386 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 107 [2018-11-28 13:02:12,651 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 93 [2018-11-28 13:02:12,755 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2018-11-28 13:02:12,912 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2018-11-28 13:02:13,086 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2018-11-28 13:02:13,347 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-11-28 13:02:13,516 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2018-11-28 13:02:13,826 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 66 [2018-11-28 13:02:13,932 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2018-11-28 13:02:14,238 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 90 [2018-11-28 13:02:14,408 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2018-11-28 13:02:14,652 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2018-11-28 13:02:15,262 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 88 [2018-11-28 13:02:15,769 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2018-11-28 13:02:16,008 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 99 [2018-11-28 13:02:16,146 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2018-11-28 13:02:16,327 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-11-28 13:02:17,117 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 99 [2018-11-28 13:02:17,295 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2018-11-28 13:02:17,754 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2018-11-28 13:02:18,076 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-11-28 13:02:18,400 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-11-28 13:02:18,551 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2018-11-28 13:02:19,250 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2018-11-28 13:02:19,626 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 78 [2018-11-28 13:02:19,826 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2018-11-28 13:02:20,196 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2018-11-28 13:02:20,661 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2018-11-28 13:02:20,999 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2018-11-28 13:02:21,234 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 878 899) no Hoare annotation was computed. [2018-11-28 13:02:21,234 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 878 899) no Hoare annotation was computed. [2018-11-28 13:02:21,235 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 878 899) the Hoare annotation is: true [2018-11-28 13:02:21,235 INFO L451 ceAbstractionStarter]: At program point L888(lines 887 897) the Hoare annotation is: true [2018-11-28 13:02:21,235 INFO L451 ceAbstractionStarter]: At program point L886(lines 885 897) the Hoare annotation is: true [2018-11-28 13:02:21,235 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 897) no Hoare annotation was computed. [2018-11-28 13:02:21,235 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 889 896) no Hoare annotation was computed. [2018-11-28 13:02:21,235 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 889 896) no Hoare annotation was computed. [2018-11-28 13:02:21,235 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 69 89) no Hoare annotation was computed. [2018-11-28 13:02:21,235 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-28 13:02:21,235 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 69 89) no Hoare annotation was computed. [2018-11-28 13:02:21,235 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 900 920) no Hoare annotation was computed. [2018-11-28 13:02:21,236 INFO L451 ceAbstractionStarter]: At program point L909(lines 908 918) the Hoare annotation is: true [2018-11-28 13:02:21,236 INFO L451 ceAbstractionStarter]: At program point L907(lines 906 918) the Hoare annotation is: true [2018-11-28 13:02:21,236 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 918) no Hoare annotation was computed. [2018-11-28 13:02:21,236 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 900 920) the Hoare annotation is: true [2018-11-28 13:02:21,236 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 910 917) no Hoare annotation was computed. [2018-11-28 13:02:21,236 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 900 920) no Hoare annotation was computed. [2018-11-28 13:02:21,236 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 910 917) no Hoare annotation was computed. [2018-11-28 13:02:21,236 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-28 13:02:21,236 INFO L448 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2018-11-28 13:02:21,236 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-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L283-1(line 283) no Hoare annotation was computed. [2018-11-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 248) no Hoare annotation was computed. [2018-11-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 428) no Hoare annotation was computed. [2018-11-28 13:02:21,237 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-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L399-1(lines 399 403) no Hoare annotation was computed. [2018-11-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L366-1(lines 362 368) no Hoare annotation was computed. [2018-11-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2018-11-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2018-11-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L267-2(lines 267 269) no Hoare annotation was computed. [2018-11-28 13:02:21,237 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-28 13:02:21,237 INFO L448 ceAbstractionStarter]: For program point L391-1(line 391) no Hoare annotation was computed. [2018-11-28 13:02:21,238 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-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point L383-1(lines 379 385) no Hoare annotation was computed. [2018-11-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 425) no Hoare annotation was computed. [2018-11-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2018-11-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 347) no Hoare annotation was computed. [2018-11-28 13:02:21,238 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-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 231 421) no Hoare annotation was computed. [2018-11-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 231 421) no Hoare annotation was computed. [2018-11-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 332) no Hoare annotation was computed. [2018-11-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 321 333) no Hoare annotation was computed. [2018-11-28 13:02:21,238 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 422) no Hoare annotation was computed. [2018-11-28 13:02:21,239 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-28 13:02:21,239 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-28 13:02:21,239 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-28 13:02:21,239 INFO L448 ceAbstractionStarter]: For program point L252-1(line 252) no Hoare annotation was computed. [2018-11-28 13:02:21,239 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-28 13:02:21,239 INFO L448 ceAbstractionStarter]: For program point L277-1(lines 273 279) no Hoare annotation was computed. [2018-11-28 13:02:21,239 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-28 13:02:21,239 INFO L448 ceAbstractionStarter]: For program point L401-1(line 401) no Hoare annotation was computed. [2018-11-28 13:02:21,239 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 398) no Hoare annotation was computed. [2018-11-28 13:02:21,239 INFO L448 ceAbstractionStarter]: For program point L393-2(lines 231 419) no Hoare annotation was computed. [2018-11-28 13:02:21,240 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-28 13:02:21,240 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 197) no Hoare annotation was computed. [2018-11-28 13:02:21,240 INFO L448 ceAbstractionStarter]: For program point L195-2(lines 195 197) no Hoare annotation was computed. [2018-11-28 13:02:21,240 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-28 13:02:21,240 INFO L448 ceAbstractionStarter]: For program point L344-1(line 344) no Hoare annotation was computed. [2018-11-28 13:02:21,240 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 427) no Hoare annotation was computed. [2018-11-28 13:02:21,240 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 309) no Hoare annotation was computed. [2018-11-28 13:02:21,240 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-28 13:02:21,240 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 293) no Hoare annotation was computed. [2018-11-28 13:02:21,240 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 424) no Hoare annotation was computed. [2018-11-28 13:02:21,241 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-28 13:02:21,241 INFO L448 ceAbstractionStarter]: For program point L411-1(lines 407 413) no Hoare annotation was computed. [2018-11-28 13:02:21,241 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-28 13:02:21,241 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 242 248) no Hoare annotation was computed. [2018-11-28 13:02:21,241 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-28 13:02:21,241 INFO L448 ceAbstractionStarter]: For program point L238-1(lines 231 419) no Hoare annotation was computed. [2018-11-28 13:02:21,241 INFO L448 ceAbstractionStarter]: For program point L205-1(line 205) no Hoare annotation was computed. [2018-11-28 13:02:21,241 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-28 13:02:21,241 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 368) no Hoare annotation was computed. [2018-11-28 13:02:21,241 INFO L448 ceAbstractionStarter]: For program point L395-1(lines 395 396) no Hoare annotation was computed. [2018-11-28 13:02:21,242 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-28 13:02:21,242 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-28 13:02:21,242 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-28 13:02:21,242 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 333) no Hoare annotation was computed. [2018-11-28 13:02:21,242 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-28 13:02:21,242 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 385) no Hoare annotation was computed. [2018-11-28 13:02:21,243 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-28 13:02:21,243 INFO L448 ceAbstractionStarter]: For program point L313-1(line 313) no Hoare annotation was computed. [2018-11-28 13:02:21,243 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-28 13:02:21,243 INFO L448 ceAbstractionStarter]: For program point L338-1(line 338) no Hoare annotation was computed. [2018-11-28 13:02:21,243 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-28 13:02:21,243 INFO L448 ceAbstractionStarter]: For program point L297-1(lines 231 419) no Hoare annotation was computed. [2018-11-28 13:02:21,243 INFO L448 ceAbstractionStarter]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2018-11-28 13:02:21,243 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 162 435) no Hoare annotation was computed. [2018-11-28 13:02:21,243 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 426) no Hoare annotation was computed. [2018-11-28 13:02:21,243 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-28 13:02:21,244 INFO L448 ceAbstractionStarter]: For program point L372-1(line 372) no Hoare annotation was computed. [2018-11-28 13:02:21,244 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 279) no Hoare annotation was computed. [2018-11-28 13:02:21,244 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-28 13:02:21,244 INFO L448 ceAbstractionStarter]: For program point L430-2(lines 430 432) no Hoare annotation was computed. [2018-11-28 13:02:21,244 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-28 13:02:21,244 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 423) no Hoare annotation was computed. [2018-11-28 13:02:21,244 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-28 13:02:21,244 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-28 13:02:21,244 INFO L448 ceAbstractionStarter]: For program point L307-1(lines 303 309) no Hoare annotation was computed. [2018-11-28 13:02:21,244 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 162 435) no Hoare annotation was computed. [2018-11-28 13:02:21,244 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 208) no Hoare annotation was computed. [2018-11-28 13:02:21,245 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-28 13:02:21,245 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-28 13:02:21,245 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-28 13:02:21,245 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-28 13:02:21,245 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 669 808) no Hoare annotation was computed. [2018-11-28 13:02:21,245 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2018-11-28 13:02:21,245 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-28 13:02:21,246 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-28 13:02:21,246 INFO L448 ceAbstractionStarter]: For program point L739(line 739) no Hoare annotation was computed. [2018-11-28 13:02:21,246 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-28 13:02:21,246 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-28 13:02:21,246 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-28 13:02:21,246 INFO L448 ceAbstractionStarter]: For program point L723(lines 709 748) no Hoare annotation was computed. [2018-11-28 13:02:21,246 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 669 808) no Hoare annotation was computed. [2018-11-28 13:02:21,247 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 736 746) no Hoare annotation was computed. [2018-11-28 13:02:21,247 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-28 13:02:21,247 INFO L448 ceAbstractionStarter]: For program point L707-1(lines 703 807) no Hoare annotation was computed. [2018-11-28 13:02:21,247 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 736 746) no Hoare annotation was computed. [2018-11-28 13:02:21,247 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-28 13:02:21,247 INFO L448 ceAbstractionStarter]: For program point L765(lines 749 804) no Hoare annotation was computed. [2018-11-28 13:02:21,247 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 747) no Hoare annotation was computed. [2018-11-28 13:02:21,247 INFO L448 ceAbstractionStarter]: For program point L782(lines 782 784) no Hoare annotation was computed. [2018-11-28 13:02:21,247 INFO L448 ceAbstractionStarter]: For program point L766(lines 766 801) no Hoare annotation was computed. [2018-11-28 13:02:21,247 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-28 13:02:21,248 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2018-11-28 13:02:21,248 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 754) no Hoare annotation was computed. [2018-11-28 13:02:21,248 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-28 13:02:21,248 INFO L448 ceAbstractionStarter]: For program point L767(lines 767 800) no Hoare annotation was computed. [2018-11-28 13:02:21,248 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 721) no Hoare annotation was computed. [2018-11-28 13:02:21,248 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-28 13:02:21,248 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 778) no Hoare annotation was computed. [2018-11-28 13:02:21,248 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-28 13:02:21,248 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 797) no Hoare annotation was computed. [2018-11-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 775) no Hoare annotation was computed. [2018-11-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 798) no Hoare annotation was computed. [2018-11-28 13:02:21,249 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-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point L929-1(lines 921 934) no Hoare annotation was computed. [2018-11-28 13:02:21,249 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-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 921 934) no Hoare annotation was computed. [2018-11-28 13:02:21,249 INFO L451 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: true [2018-11-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point L609-1(line 609) no Hoare annotation was computed. [2018-11-28 13:02:21,249 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 604 613) the Hoare annotation is: true [2018-11-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 604 613) no Hoare annotation was computed. [2018-11-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 604 613) no Hoare annotation was computed. [2018-11-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point L1057(lines 1057 1069) no Hoare annotation was computed. [2018-11-28 13:02:21,249 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1030 1071) no Hoare annotation was computed. [2018-11-28 13:02:21,250 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-28 13:02:21,250 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1061 1068) no Hoare annotation was computed. [2018-11-28 13:02:21,250 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1061 1068) no Hoare annotation was computed. [2018-11-28 13:02:21,250 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1054) no Hoare annotation was computed. [2018-11-28 13:02:21,250 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-28 13:02:21,251 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-28 13:02:21,251 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1030 1071) no Hoare annotation was computed. [2018-11-28 13:02:21,251 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-28 13:02:21,251 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2018-11-28 13:02:21,251 INFO L448 ceAbstractionStarter]: For program point L1048-1(lines 1035 1054) no Hoare annotation was computed. [2018-11-28 13:02:21,251 INFO L448 ceAbstractionStarter]: For program point L1036(lines 1036 1041) no Hoare annotation was computed. [2018-11-28 13:02:21,251 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-28 13:02:21,252 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-28 13:02:21,252 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-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point L1016-1(lines 1008 1021) no Hoare annotation was computed. [2018-11-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1008 1021) no Hoare annotation was computed. [2018-11-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1018) no Hoare annotation was computed. [2018-11-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point L514-2(lines 514 519) no Hoare annotation was computed. [2018-11-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point L564(lines 564 566) no Hoare annotation was computed. [2018-11-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 504) no Hoare annotation was computed. [2018-11-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 493 505) no Hoare annotation was computed. [2018-11-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 436 603) no Hoare annotation was computed. [2018-11-28 13:02:21,252 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-28 13:02:21,252 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 572) no Hoare annotation was computed. [2018-11-28 13:02:21,253 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-28 13:02:21,258 INFO L448 ceAbstractionStarter]: For program point L516-1(line 516) no Hoare annotation was computed. [2018-11-28 13:02:21,258 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 581) no Hoare annotation was computed. [2018-11-28 13:02:21,258 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-28 13:02:21,258 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-28 13:02:21,258 INFO L448 ceAbstractionStarter]: For program point L599-1(line 599) no Hoare annotation was computed. [2018-11-28 13:02:21,258 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 543) no Hoare annotation was computed. [2018-11-28 13:02:21,258 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-28 13:02:21,259 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2018-11-28 13:02:21,259 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 505) no Hoare annotation was computed. [2018-11-28 13:02:21,259 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-28 13:02:21,264 INFO L448 ceAbstractionStarter]: For program point L510-1(line 510) no Hoare annotation was computed. [2018-11-28 13:02:21,264 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-28 13:02:21,264 INFO L448 ceAbstractionStarter]: For program point L535-1(line 535) no Hoare annotation was computed. [2018-11-28 13:02:21,264 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-28 13:02:21,264 INFO L448 ceAbstractionStarter]: For program point L560-1(lines 560 562) no Hoare annotation was computed. [2018-11-28 13:02:21,264 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 436 603) no Hoare annotation was computed. [2018-11-28 13:02:21,265 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-28 13:02:21,265 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-28 13:02:21,265 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-28 13:02:21,270 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-28 13:02:21,270 INFO L448 ceAbstractionStarter]: For program point L528-1(line 528) no Hoare annotation was computed. [2018-11-28 13:02:21,270 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2018-11-28 13:02:21,270 INFO L448 ceAbstractionStarter]: For program point L553(lines 552 568) no Hoare annotation was computed. [2018-11-28 13:02:21,270 INFO L448 ceAbstractionStarter]: For program point L586-2(lines 586 591) no Hoare annotation was computed. [2018-11-28 13:02:21,270 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-28 13:02:21,270 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 540) no Hoare annotation was computed. [2018-11-28 13:02:21,270 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 546 549) no Hoare annotation was computed. [2018-11-28 13:02:21,270 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 595) no Hoare annotation was computed. [2018-11-28 13:02:21,270 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 595) no Hoare annotation was computed. [2018-11-28 13:02:21,270 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-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 588 589) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 519) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L451 ceAbstractionStarter]: At program point L1104(lines 1103 1113) the Hoare annotation is: true [2018-11-28 13:02:21,274 INFO L451 ceAbstractionStarter]: At program point L1102(lines 1101 1113) the Hoare annotation is: true [2018-11-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1094 1115) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point L1101(lines 1101 1113) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1105 1112) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1094 1115) the Hoare annotation is: true [2018-11-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1105 1112) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1094 1115) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1072 1093) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1072 1093) the Hoare annotation is: true [2018-11-28 13:02:21,274 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1072 1093) no Hoare annotation was computed. [2018-11-28 13:02:21,274 INFO L451 ceAbstractionStarter]: At program point L1082(lines 1081 1091) the Hoare annotation is: true [2018-11-28 13:02:21,274 INFO L451 ceAbstractionStarter]: At program point L1080(lines 1079 1091) the Hoare annotation is: true [2018-11-28 13:02:21,275 INFO L448 ceAbstractionStarter]: For program point L1079(lines 1079 1091) no Hoare annotation was computed. [2018-11-28 13:02:21,275 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1083 1090) no Hoare annotation was computed. [2018-11-28 13:02:21,275 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1083 1090) no Hoare annotation was computed. [2018-11-28 13:02:21,275 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 809 833) no Hoare annotation was computed. [2018-11-28 13:02:21,275 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 809 833) no Hoare annotation was computed. [2018-11-28 13:02:21,275 INFO L451 ceAbstractionStarter]: At program point L822(lines 821 831) the Hoare annotation is: true [2018-11-28 13:02:21,275 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 823 830) no Hoare annotation was computed. [2018-11-28 13:02:21,275 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-28 13:02:21,277 INFO L451 ceAbstractionStarter]: At program point L820(lines 819 831) the Hoare annotation is: true [2018-11-28 13:02:21,277 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 831) no Hoare annotation was computed. [2018-11-28 13:02:21,277 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 823 830) no Hoare annotation was computed. [2018-11-28 13:02:21,277 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1022 1029) the Hoare annotation is: true [2018-11-28 13:02:21,277 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1022 1029) no Hoare annotation was computed. [2018-11-28 13:02:21,277 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1022 1029) no Hoare annotation was computed. [2018-11-28 13:02:21,277 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 656 668) no Hoare annotation was computed. [2018-11-28 13:02:21,277 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-28 13:02:21,277 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 656 668) no Hoare annotation was computed. [2018-11-28 13:02:21,278 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 60 67) the Hoare annotation is: true [2018-11-28 13:02:21,278 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 60 67) no Hoare annotation was computed. [2018-11-28 13:02:21,278 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 60 67) no Hoare annotation was computed. [2018-11-28 13:02:21,278 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 64) no Hoare annotation was computed. [2018-11-28 13:02:21,278 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 1003) no Hoare annotation was computed. [2018-11-28 13:02:21,278 INFO L448 ceAbstractionStarter]: For program point L949(lines 949 953) no Hoare annotation was computed. [2018-11-28 13:02:21,278 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-28 13:02:21,281 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-28 13:02:21,281 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-28 13:02:21,286 INFO L448 ceAbstractionStarter]: For program point L945-1(line 945) no Hoare annotation was computed. [2018-11-28 13:02:21,286 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-28 13:02:21,286 INFO L448 ceAbstractionStarter]: For program point L995(lines 995 1002) no Hoare annotation was computed. [2018-11-28 13:02:21,286 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 935 1007) no Hoare annotation was computed. [2018-11-28 13:02:21,286 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 981) no Hoare annotation was computed. [2018-11-28 13:02:21,286 INFO L448 ceAbstractionStarter]: For program point L987(lines 987 993) no Hoare annotation was computed. [2018-11-28 13:02:21,286 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 935 1007) no Hoare annotation was computed. [2018-11-28 13:02:21,287 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-28 13:02:21,290 INFO L448 ceAbstractionStarter]: For program point L1000-1(lines 982 1004) no Hoare annotation was computed. [2018-11-28 13:02:21,290 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 980) no Hoare annotation was computed. [2018-11-28 13:02:21,291 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 967 979) no Hoare annotation was computed. [2018-11-28 13:02:21,291 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 967 979) no Hoare annotation was computed. [2018-11-28 13:02:21,291 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-28 13:02:21,291 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-28 13:02:21,293 INFO L448 ceAbstractionStarter]: For program point L943(lines 943 955) no Hoare annotation was computed. [2018-11-28 13:02:21,293 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 943 955) no Hoare annotation was computed. [2018-11-28 13:02:21,293 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-28 13:02:21,293 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 150) no Hoare annotation was computed. [2018-11-28 13:02:21,293 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 112 160) no Hoare annotation was computed. [2018-11-28 13:02:21,294 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 99 161) no Hoare annotation was computed. [2018-11-28 13:02:21,294 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-28 13:02:21,294 INFO L448 ceAbstractionStarter]: For program point L143-1(line 143) no Hoare annotation was computed. [2018-11-28 13:02:21,298 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-28 13:02:21,298 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 141 142) no Hoare annotation was computed. [2018-11-28 13:02:21,298 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 138) no Hoare annotation was computed. [2018-11-28 13:02:21,298 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-28 13:02:21,298 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 128) no Hoare annotation was computed. [2018-11-28 13:02:21,298 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 99 161) no Hoare annotation was computed. [2018-11-28 13:02:21,298 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-28 13:02:21,298 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 125) no Hoare annotation was computed. [2018-11-28 13:02:21,298 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 152 158) no Hoare annotation was computed. [2018-11-28 13:02:21,298 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-28 13:02:21,298 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-28 13:02:21,298 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 118) no Hoare annotation was computed. [2018-11-28 13:02:21,299 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 136) no Hoare annotation was computed. [2018-11-28 13:02:21,299 INFO L448 ceAbstractionStarter]: For program point L134-2(lines 134 136) no Hoare annotation was computed. [2018-11-28 13:02:21,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:02:21,299 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-28 13:02:21,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:02:21,299 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-28 13:02:21,303 INFO L448 ceAbstractionStarter]: For program point L641-1(line 641) no Hoare annotation was computed. [2018-11-28 13:02:21,303 INFO L448 ceAbstractionStarter]: For program point L639(lines 639 644) no Hoare annotation was computed. [2018-11-28 13:02:21,303 INFO L448 ceAbstractionStarter]: For program point L639-2(lines 639 644) no Hoare annotation was computed. [2018-11-28 13:02:21,303 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-28 13:02:21,303 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-28 13:02:21,303 INFO L448 ceAbstractionStarter]: For program point L635-1(line 635) no Hoare annotation was computed. [2018-11-28 13:02:21,303 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 614 648) no Hoare annotation was computed. [2018-11-28 13:02:21,303 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 631) no Hoare annotation was computed. [2018-11-28 13:02:21,303 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-28 13:02:21,303 INFO L448 ceAbstractionStarter]: For program point L626-1(lines 626 627) no Hoare annotation was computed. [2018-11-28 13:02:21,304 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 614 648) no Hoare annotation was computed. [2018-11-28 13:02:21,304 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 92 98) no Hoare annotation was computed. [2018-11-28 13:02:21,304 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 92 98) the Hoare annotation is: true [2018-11-28 13:02:21,304 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 92 98) no Hoare annotation was computed. [2018-11-28 13:02:21,309 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:02:21,309 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-28 13:02:21,309 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:02:21,309 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:02:21,309 INFO L451 ceAbstractionStarter]: At program point L864(lines 863 875) the Hoare annotation is: true [2018-11-28 13:02:21,309 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 875) no Hoare annotation was computed. [2018-11-28 13:02:21,309 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 855 877) no Hoare annotation was computed. [2018-11-28 13:02:21,309 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 867 874) no Hoare annotation was computed. [2018-11-28 13:02:21,309 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 855 877) the Hoare annotation is: true [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 855 877) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L451 ceAbstractionStarter]: At program point L866(lines 865 875) the Hoare annotation is: true [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 867 874) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 834 854) the Hoare annotation is: true [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 834 854) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L451 ceAbstractionStarter]: At program point L843(lines 842 852) the Hoare annotation is: true [2018-11-28 13:02:21,310 INFO L451 ceAbstractionStarter]: At program point L841(lines 840 852) the Hoare annotation is: true [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 852) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 834 854) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 844 851) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 844 851) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1116 1136) the Hoare annotation is: true [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1116 1136) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L451 ceAbstractionStarter]: At program point L1125(lines 1124 1134) the Hoare annotation is: true [2018-11-28 13:02:21,310 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1126 1133) no Hoare annotation was computed. [2018-11-28 13:02:21,310 INFO L451 ceAbstractionStarter]: At program point L1123(lines 1122 1134) the Hoare annotation is: true [2018-11-28 13:02:21,311 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1116 1136) no Hoare annotation was computed. [2018-11-28 13:02:21,311 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1134) no Hoare annotation was computed. [2018-11-28 13:02:21,314 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1126 1133) no Hoare annotation was computed. [2018-11-28 13:02:21,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:02:21 BoogieIcfgContainer [2018-11-28 13:02:21,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:02:21,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:02:21,389 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:02:21,389 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:02:21,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:01:52" (3/4) ... [2018-11-28 13:02:21,392 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-28 13:02:21,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-28 13:02:21,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-28 13:02:21,403 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-28 13:02:21,403 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-28 13:02:21,403 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-28 13:02:21,422 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2018-11-28 13:02:21,423 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2018-11-28 13:02:21,424 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 13:02:21,425 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 13:02:21,453 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-28 13:02:21,454 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-28 13:02:21,454 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-28 13:02:21,454 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-28 13:02:21,455 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-28 13:02:21,456 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-28 13:02:21,456 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-28 13:02:21,456 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-28 13:02:21,456 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-28 13:02:21,456 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-28 13:02:21,456 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-28 13:02:21,457 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-28 13:02:21,457 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-28 13:02:21,457 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-28 13:02:21,458 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-28 13:02:21,459 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-28 13:02:21,459 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-28 13:02:21,460 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-28 13:02:21,460 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-28 13:02:21,460 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-28 13:02:21,461 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-28 13:02:21,461 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-28 13:02:21,461 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-28 13:02:21,523 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4055ee7e-f5e5-4217-9777-6a5ded077847/bin-2019/uautomizer/witness.graphml [2018-11-28 13:02:21,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:02:21,524 INFO L168 Benchmark]: Toolchain (without parser) took 30116.96 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 884.5 MB). Free memory was 956.7 MB in the beginning and 932.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 908.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:02:21,524 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 984.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:02:21,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 956.7 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:02:21,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:02:21,525 INFO L168 Benchmark]: Boogie Preprocessor took 36.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:02:21,525 INFO L168 Benchmark]: RCFGBuilder took 640.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:02:21,526 INFO L168 Benchmark]: TraceAbstraction took 28961.71 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 772.8 MB). Free memory was 1.0 GB in the beginning and 954.6 MB in the end (delta: 51.2 MB). Peak memory consumption was 932.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:02:21,526 INFO L168 Benchmark]: Witness Printer took 134.56 ms. Allocated memory is still 1.9 GB. Free memory was 954.6 MB in the beginning and 932.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:02:21,527 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 984.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 956.7 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 640.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28961.71 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 772.8 MB). Free memory was 1.0 GB in the beginning and 954.6 MB in the end (delta: 51.2 MB). Peak memory consumption was 932.0 MB. Max. memory is 11.5 GB. * Witness Printer took 134.56 ms. Allocated memory is still 1.9 GB. Free memory was 954.6 MB in the beginning and 932.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 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.8s OverallTime, 50 OverallIterations, 2 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 14.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 15906 SDtfs, 8968 SDslu, 49367 SDs, 0 SdLazy, 9474 SolverSat, 1719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 956 GetRequests, 584 SyntacticMatches, 16 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.4s 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.4s HoareSimplificationTime, 117 FomulaSimplificationsInter, 320493 FormulaSimplificationTreeSizeReductionInter, 13.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s 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...