./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/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_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/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-635dfa2 [2018-12-09 15:41:07,075 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:41:07,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:41:07,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:41:07,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:41:07,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:41:07,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:41:07,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:41:07,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:41:07,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:41:07,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:41:07,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:41:07,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:41:07,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:41:07,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:41:07,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:41:07,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:41:07,089 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:41:07,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:41:07,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:41:07,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:41:07,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:41:07,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:41:07,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:41:07,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:41:07,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:41:07,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:41:07,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:41:07,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:41:07,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:41:07,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:41:07,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:41:07,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:41:07,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:41:07,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:41:07,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:41:07,097 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 15:41:07,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:41:07,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:41:07,105 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:41:07,105 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:41:07,106 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:41:07,106 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:41:07,106 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 15:41:07,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:41:07,106 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:41:07,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:41:07,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:41:07,106 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:41:07,106 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:41:07,106 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:41:07,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:41:07,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:41:07,108 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:41:07,108 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:41:07,108 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:41:07,108 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 15:41:07,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:41:07,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:41:07,108 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_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/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-12-09 15:41:07,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:41:07,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:41:07,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:41:07,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:41:07,135 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:41:07,135 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 15:41:07,171 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/data/05b9a02ab/94b8ca5553bd49839d9b87e3443c10bd/FLAG476c2a46b [2018-12-09 15:41:07,618 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:41:07,618 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 15:41:07,624 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/data/05b9a02ab/94b8ca5553bd49839d9b87e3443c10bd/FLAG476c2a46b [2018-12-09 15:41:07,633 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/data/05b9a02ab/94b8ca5553bd49839d9b87e3443c10bd [2018-12-09 15:41:07,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:41:07,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:41:07,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:41:07,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:41:07,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:41:07,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe9828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07, skipping insertion in model container [2018-12-09 15:41:07,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:41:07,671 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:41:07,812 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:41:07,815 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:41:07,895 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:41:07,907 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:41:07,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07 WrapperNode [2018-12-09 15:41:07,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:41:07,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:41:07,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:41:07,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:41:07,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:41:07,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:41:07,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:41:07,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:41:07,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... [2018-12-09 15:41:07,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:41:07,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:41:07,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:41:07,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:41:07,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/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-12-09 15:41:07,991 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-12-09 15:41:07,991 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-12-09 15:41:07,991 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-09 15:41:07,991 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-09 15:41:07,991 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-12-09 15:41:07,991 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-12-09 15:41:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-12-09 15:41:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-12-09 15:41:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:41:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:41:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-09 15:41:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-09 15:41:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-12-09 15:41:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-12-09 15:41:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-09 15:41:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-09 15:41:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-09 15:41:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-09 15:41:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-12-09 15:41:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-12-09 15:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-12-09 15:41:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-12-09 15:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-12-09 15:41:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-12-09 15:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-09 15:41:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-09 15:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-09 15:41:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-09 15:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-09 15:41:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-09 15:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-09 15:41:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-09 15:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-09 15:41:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-09 15:41:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-12-09 15:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-12-09 15:41:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:41:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-12-09 15:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-12-09 15:41:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-12-09 15:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-12-09 15:41:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:41:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-12-09 15:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-12-09 15:41:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-12-09 15:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-12-09 15:41:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-09 15:41:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-09 15:41:08,103 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,104 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,150 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,150 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,161 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,161 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,270 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,270 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,304 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,304 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,358 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,358 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,362 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,362 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,369 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,369 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,379 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,379 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,424 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,424 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,429 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,429 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,433 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 15:41:08,433 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 15:41:08,446 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:41:08,446 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 15:41:08,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:41:08 BoogieIcfgContainer [2018-12-09 15:41:08,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:41:08,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:41:08,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:41:08,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:41:08,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:41:07" (1/3) ... [2018-12-09 15:41:08,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7d3e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:41:08, skipping insertion in model container [2018-12-09 15:41:08,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:07" (2/3) ... [2018-12-09 15:41:08,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7d3e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:41:08, skipping insertion in model container [2018-12-09 15:41:08,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:41:08" (3/3) ... [2018-12-09 15:41:08,453 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 15:41:08,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:41:08,468 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 15:41:08,481 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 15:41:08,508 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:41:08,508 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:41:08,509 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:41:08,509 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:41:08,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:41:08,509 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:41:08,509 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:41:08,509 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:41:08,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:41:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states. [2018-12-09 15:41:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:41:08,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:08,531 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-12-09 15:41:08,533 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:08,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:08,536 INFO L82 PathProgramCache]: Analyzing trace with hash -309041171, now seen corresponding path program 1 times [2018-12-09 15:41:08,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:08,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:08,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:08,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:08,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:08,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:08,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:08,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:08,686 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 3 states. [2018-12-09 15:41:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:08,739 INFO L93 Difference]: Finished difference Result 508 states and 727 transitions. [2018-12-09 15:41:08,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:08,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 15:41:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:08,748 INFO L225 Difference]: With dead ends: 508 [2018-12-09 15:41:08,749 INFO L226 Difference]: Without dead ends: 292 [2018-12-09 15:41:08,752 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-12-09 15:41:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-09 15:41:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-12-09 15:41:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-09 15:41:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2018-12-09 15:41:08,790 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2018-12-09 15:41:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:08,791 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2018-12-09 15:41:08,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2018-12-09 15:41:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 15:41:08,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:08,792 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-12-09 15:41:08,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:08,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash -940725380, now seen corresponding path program 1 times [2018-12-09 15:41:08,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:08,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:08,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:08,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:08,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:08,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:08,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:08,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:08,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:08,904 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand 3 states. [2018-12-09 15:41:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:08,993 INFO L93 Difference]: Finished difference Result 601 states and 800 transitions. [2018-12-09 15:41:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:08,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 15:41:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:08,996 INFO L225 Difference]: With dead ends: 601 [2018-12-09 15:41:08,996 INFO L226 Difference]: Without dead ends: 440 [2018-12-09 15:41:08,997 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-12-09 15:41:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-12-09 15:41:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 423. [2018-12-09 15:41:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-09 15:41:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 560 transitions. [2018-12-09 15:41:09,018 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 560 transitions. Word has length 28 [2018-12-09 15:41:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:09,018 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 560 transitions. [2018-12-09 15:41:09,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 560 transitions. [2018-12-09 15:41:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 15:41:09,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:09,019 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-12-09 15:41:09,019 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:09,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:09,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1226553269, now seen corresponding path program 1 times [2018-12-09 15:41:09,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:09,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:09,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:09,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:09,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:09,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:09,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:09,064 INFO L87 Difference]: Start difference. First operand 423 states and 560 transitions. Second operand 3 states. [2018-12-09 15:41:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:09,101 INFO L93 Difference]: Finished difference Result 913 states and 1215 transitions. [2018-12-09 15:41:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:09,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 15:41:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:09,104 INFO L225 Difference]: With dead ends: 913 [2018-12-09 15:41:09,104 INFO L226 Difference]: Without dead ends: 651 [2018-12-09 15:41:09,105 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-12-09 15:41:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-12-09 15:41:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 620. [2018-12-09 15:41:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-12-09 15:41:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 828 transitions. [2018-12-09 15:41:09,129 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 828 transitions. Word has length 30 [2018-12-09 15:41:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:09,129 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 828 transitions. [2018-12-09 15:41:09,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 828 transitions. [2018-12-09 15:41:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:41:09,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:09,130 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-12-09 15:41:09,130 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:09,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:09,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2035434096, now seen corresponding path program 1 times [2018-12-09 15:41:09,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:09,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:09,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:09,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:09,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:09,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:09,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:09,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:09,170 INFO L87 Difference]: Start difference. First operand 620 states and 828 transitions. Second operand 3 states. [2018-12-09 15:41:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:09,204 INFO L93 Difference]: Finished difference Result 715 states and 947 transitions. [2018-12-09 15:41:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:09,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 15:41:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:09,206 INFO L225 Difference]: With dead ends: 715 [2018-12-09 15:41:09,207 INFO L226 Difference]: Without dead ends: 697 [2018-12-09 15:41:09,207 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-12-09 15:41:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-12-09 15:41:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 658. [2018-12-09 15:41:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-12-09 15:41:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 877 transitions. [2018-12-09 15:41:09,231 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 877 transitions. Word has length 34 [2018-12-09 15:41:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:09,231 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 877 transitions. [2018-12-09 15:41:09,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 877 transitions. [2018-12-09 15:41:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 15:41:09,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:09,232 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-12-09 15:41:09,233 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:09,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash 897056749, now seen corresponding path program 1 times [2018-12-09 15:41:09,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:09,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:09,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:09,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:09,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:09,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:09,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:09,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:09,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:09,265 INFO L87 Difference]: Start difference. First operand 658 states and 877 transitions. Second operand 3 states. [2018-12-09 15:41:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:09,349 INFO L93 Difference]: Finished difference Result 1029 states and 1392 transitions. [2018-12-09 15:41:09,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:09,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-09 15:41:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:09,353 INFO L225 Difference]: With dead ends: 1029 [2018-12-09 15:41:09,353 INFO L226 Difference]: Without dead ends: 1026 [2018-12-09 15:41:09,354 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-12-09 15:41:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-12-09 15:41:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 781. [2018-12-09 15:41:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-12-09 15:41:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1046 transitions. [2018-12-09 15:41:09,393 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1046 transitions. Word has length 41 [2018-12-09 15:41:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:09,393 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1046 transitions. [2018-12-09 15:41:09,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1046 transitions. [2018-12-09 15:41:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:41:09,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:09,395 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-12-09 15:41:09,395 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:09,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash 999260852, now seen corresponding path program 1 times [2018-12-09 15:41:09,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:09,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:09,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:09,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:09,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:09,435 INFO L87 Difference]: Start difference. First operand 781 states and 1046 transitions. Second operand 3 states. [2018-12-09 15:41:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:09,512 INFO L93 Difference]: Finished difference Result 796 states and 1066 transitions. [2018-12-09 15:41:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:09,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-09 15:41:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:09,515 INFO L225 Difference]: With dead ends: 796 [2018-12-09 15:41:09,515 INFO L226 Difference]: Without dead ends: 793 [2018-12-09 15:41:09,515 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-12-09 15:41:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-09 15:41:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 792. [2018-12-09 15:41:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-12-09 15:41:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1060 transitions. [2018-12-09 15:41:09,560 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1060 transitions. Word has length 40 [2018-12-09 15:41:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:09,561 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1060 transitions. [2018-12-09 15:41:09,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1060 transitions. [2018-12-09 15:41:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 15:41:09,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:09,563 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-12-09 15:41:09,563 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:09,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1052368345, now seen corresponding path program 1 times [2018-12-09 15:41:09,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:09,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:09,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:09,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:09,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:09,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:09,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:09,593 INFO L87 Difference]: Start difference. First operand 792 states and 1060 transitions. Second operand 3 states. [2018-12-09 15:41:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:09,661 INFO L93 Difference]: Finished difference Result 824 states and 1098 transitions. [2018-12-09 15:41:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:09,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-09 15:41:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:09,664 INFO L225 Difference]: With dead ends: 824 [2018-12-09 15:41:09,664 INFO L226 Difference]: Without dead ends: 819 [2018-12-09 15:41:09,665 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-12-09 15:41:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-09 15:41:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2018-12-09 15:41:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-09 15:41:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1091 transitions. [2018-12-09 15:41:09,692 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1091 transitions. Word has length 41 [2018-12-09 15:41:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:09,692 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1091 transitions. [2018-12-09 15:41:09,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1091 transitions. [2018-12-09 15:41:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 15:41:09,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:09,693 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-12-09 15:41:09,693 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:09,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:09,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1801128385, now seen corresponding path program 1 times [2018-12-09 15:41:09,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:09,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:09,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:09,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:09,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:09,742 INFO L87 Difference]: Start difference. First operand 817 states and 1091 transitions. Second operand 5 states. [2018-12-09 15:41:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:10,118 INFO L93 Difference]: Finished difference Result 1536 states and 2036 transitions. [2018-12-09 15:41:10,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:10,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-09 15:41:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:10,121 INFO L225 Difference]: With dead ends: 1536 [2018-12-09 15:41:10,121 INFO L226 Difference]: Without dead ends: 985 [2018-12-09 15:41:10,122 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-12-09 15:41:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-12-09 15:41:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 808. [2018-12-09 15:41:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-09 15:41:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1070 transitions. [2018-12-09 15:41:10,151 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1070 transitions. Word has length 42 [2018-12-09 15:41:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:10,151 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1070 transitions. [2018-12-09 15:41:10,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1070 transitions. [2018-12-09 15:41:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 15:41:10,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:10,152 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-12-09 15:41:10,152 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:10,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:10,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1284438240, now seen corresponding path program 1 times [2018-12-09 15:41:10,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:10,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:10,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:10,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:10,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:10,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:10,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:10,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:10,194 INFO L87 Difference]: Start difference. First operand 808 states and 1070 transitions. Second operand 5 states. [2018-12-09 15:41:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:10,411 INFO L93 Difference]: Finished difference Result 816 states and 1076 transitions. [2018-12-09 15:41:10,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:41:10,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-09 15:41:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:10,415 INFO L225 Difference]: With dead ends: 816 [2018-12-09 15:41:10,415 INFO L226 Difference]: Without dead ends: 810 [2018-12-09 15:41:10,416 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-12-09 15:41:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-12-09 15:41:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2018-12-09 15:41:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-09 15:41:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1069 transitions. [2018-12-09 15:41:10,459 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1069 transitions. Word has length 42 [2018-12-09 15:41:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:10,460 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1069 transitions. [2018-12-09 15:41:10,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1069 transitions. [2018-12-09 15:41:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 15:41:10,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:10,461 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-12-09 15:41:10,461 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:10,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:10,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2023267546, now seen corresponding path program 1 times [2018-12-09 15:41:10,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:10,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:10,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:10,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:10,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:10,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:10,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:10,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:10,504 INFO L87 Difference]: Start difference. First operand 808 states and 1069 transitions. Second operand 5 states. [2018-12-09 15:41:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:10,717 INFO L93 Difference]: Finished difference Result 816 states and 1075 transitions. [2018-12-09 15:41:10,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:41:10,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-09 15:41:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:10,721 INFO L225 Difference]: With dead ends: 816 [2018-12-09 15:41:10,721 INFO L226 Difference]: Without dead ends: 810 [2018-12-09 15:41:10,722 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-12-09 15:41:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-12-09 15:41:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2018-12-09 15:41:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-09 15:41:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1068 transitions. [2018-12-09 15:41:10,754 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1068 transitions. Word has length 43 [2018-12-09 15:41:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:10,755 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1068 transitions. [2018-12-09 15:41:10,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1068 transitions. [2018-12-09 15:41:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 15:41:10,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:10,756 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-12-09 15:41:10,756 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:10,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1786995081, now seen corresponding path program 1 times [2018-12-09 15:41:10,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:10,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:10,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:10,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:10,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:10,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:10,801 INFO L87 Difference]: Start difference. First operand 808 states and 1068 transitions. Second operand 5 states. [2018-12-09 15:41:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:10,856 INFO L93 Difference]: Finished difference Result 824 states and 1083 transitions. [2018-12-09 15:41:10,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:41:10,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 15:41:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:10,860 INFO L225 Difference]: With dead ends: 824 [2018-12-09 15:41:10,860 INFO L226 Difference]: Without dead ends: 806 [2018-12-09 15:41:10,861 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-12-09 15:41:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-12-09 15:41:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2018-12-09 15:41:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-12-09 15:41:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1064 transitions. [2018-12-09 15:41:10,918 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1064 transitions. Word has length 44 [2018-12-09 15:41:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:10,918 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1064 transitions. [2018-12-09 15:41:10,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1064 transitions. [2018-12-09 15:41:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 15:41:10,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:10,920 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-12-09 15:41:10,920 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:10,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1151742481, now seen corresponding path program 1 times [2018-12-09 15:41:10,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:10,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:10,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:10,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:10,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:41:10,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:41:10,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:41:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:41:10,965 INFO L87 Difference]: Start difference. First operand 806 states and 1064 transitions. Second operand 4 states. [2018-12-09 15:41:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:11,083 INFO L93 Difference]: Finished difference Result 890 states and 1147 transitions. [2018-12-09 15:41:11,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:41:11,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 15:41:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:11,085 INFO L225 Difference]: With dead ends: 890 [2018-12-09 15:41:11,085 INFO L226 Difference]: Without dead ends: 557 [2018-12-09 15:41:11,086 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-12-09 15:41:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-12-09 15:41:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 520. [2018-12-09 15:41:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-09 15:41:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 659 transitions. [2018-12-09 15:41:11,115 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 659 transitions. Word has length 49 [2018-12-09 15:41:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:11,115 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 659 transitions. [2018-12-09 15:41:11,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:41:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 659 transitions. [2018-12-09 15:41:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 15:41:11,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:11,117 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-12-09 15:41:11,117 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:11,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1304384875, now seen corresponding path program 1 times [2018-12-09 15:41:11,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:11,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:11,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:11,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:11,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:11,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:11,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:11,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:11,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:11,157 INFO L87 Difference]: Start difference. First operand 520 states and 659 transitions. Second operand 3 states. [2018-12-09 15:41:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:11,218 INFO L93 Difference]: Finished difference Result 789 states and 1008 transitions. [2018-12-09 15:41:11,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:11,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-09 15:41:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:11,220 INFO L225 Difference]: With dead ends: 789 [2018-12-09 15:41:11,221 INFO L226 Difference]: Without dead ends: 528 [2018-12-09 15:41:11,222 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-12-09 15:41:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-12-09 15:41:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-12-09 15:41:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-09 15:41:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 670 transitions. [2018-12-09 15:41:11,239 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 670 transitions. Word has length 55 [2018-12-09 15:41:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:11,239 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 670 transitions. [2018-12-09 15:41:11,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 670 transitions. [2018-12-09 15:41:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 15:41:11,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:11,240 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-12-09 15:41:11,240 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:11,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1872524112, now seen corresponding path program 1 times [2018-12-09 15:41:11,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:11,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:11,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:11,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:11,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:11,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:11,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:11,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:11,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:11,264 INFO L87 Difference]: Start difference. First operand 528 states and 670 transitions. Second operand 3 states. [2018-12-09 15:41:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:11,377 INFO L93 Difference]: Finished difference Result 720 states and 928 transitions. [2018-12-09 15:41:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:11,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 15:41:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:11,379 INFO L225 Difference]: With dead ends: 720 [2018-12-09 15:41:11,379 INFO L226 Difference]: Without dead ends: 712 [2018-12-09 15:41:11,380 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-12-09 15:41:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-12-09 15:41:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 582. [2018-12-09 15:41:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-12-09 15:41:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 738 transitions. [2018-12-09 15:41:11,402 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 738 transitions. Word has length 52 [2018-12-09 15:41:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:11,402 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 738 transitions. [2018-12-09 15:41:11,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 738 transitions. [2018-12-09 15:41:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 15:41:11,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:11,403 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-12-09 15:41:11,403 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:11,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1629136409, now seen corresponding path program 1 times [2018-12-09 15:41:11,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:11,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:11,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:11,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:41:11,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:41:11,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:41:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:41:11,462 INFO L87 Difference]: Start difference. First operand 582 states and 738 transitions. Second operand 8 states. [2018-12-09 15:41:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:11,588 INFO L93 Difference]: Finished difference Result 612 states and 772 transitions. [2018-12-09 15:41:11,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:41:11,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-09 15:41:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:11,590 INFO L225 Difference]: With dead ends: 612 [2018-12-09 15:41:11,590 INFO L226 Difference]: Without dead ends: 608 [2018-12-09 15:41:11,590 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-12-09 15:41:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-12-09 15:41:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2018-12-09 15:41:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-09 15:41:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 759 transitions. [2018-12-09 15:41:11,613 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 759 transitions. Word has length 53 [2018-12-09 15:41:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:11,613 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 759 transitions. [2018-12-09 15:41:11,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:41:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 759 transitions. [2018-12-09 15:41:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 15:41:11,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:11,614 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-12-09 15:41:11,614 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:11,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:11,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1629413239, now seen corresponding path program 1 times [2018-12-09 15:41:11,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:11,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:11,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:11,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:41:11,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:41:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:41:11,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:41:11,662 INFO L87 Difference]: Start difference. First operand 600 states and 759 transitions. Second operand 8 states. [2018-12-09 15:41:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:11,727 INFO L93 Difference]: Finished difference Result 1000 states and 1288 transitions. [2018-12-09 15:41:11,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:41:11,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-09 15:41:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:11,729 INFO L225 Difference]: With dead ends: 1000 [2018-12-09 15:41:11,729 INFO L226 Difference]: Without dead ends: 649 [2018-12-09 15:41:11,730 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-12-09 15:41:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-12-09 15:41:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2018-12-09 15:41:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-12-09 15:41:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 804 transitions. [2018-12-09 15:41:11,752 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 804 transitions. Word has length 53 [2018-12-09 15:41:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:11,752 INFO L480 AbstractCegarLoop]: Abstraction has 629 states and 804 transitions. [2018-12-09 15:41:11,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:41:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 804 transitions. [2018-12-09 15:41:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 15:41:11,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:11,753 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-12-09 15:41:11,754 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:11,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1678961307, now seen corresponding path program 1 times [2018-12-09 15:41:11,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:11,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:11,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:11,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:11,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:11,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:11,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:11,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:11,829 INFO L87 Difference]: Start difference. First operand 629 states and 804 transitions. Second operand 5 states. [2018-12-09 15:41:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:11,857 INFO L93 Difference]: Finished difference Result 884 states and 1133 transitions. [2018-12-09 15:41:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:41:11,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-09 15:41:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:11,860 INFO L225 Difference]: With dead ends: 884 [2018-12-09 15:41:11,860 INFO L226 Difference]: Without dead ends: 610 [2018-12-09 15:41:11,861 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-12-09 15:41:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-12-09 15:41:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2018-12-09 15:41:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-12-09 15:41:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2018-12-09 15:41:11,895 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 61 [2018-12-09 15:41:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:11,895 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2018-12-09 15:41:11,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2018-12-09 15:41:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 15:41:11,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:11,896 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-12-09 15:41:11,896 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:11,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:11,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1631638869, now seen corresponding path program 1 times [2018-12-09 15:41:11,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:11,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:11,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:11,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:11,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:11,916 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 3 states. [2018-12-09 15:41:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:11,991 INFO L93 Difference]: Finished difference Result 709 states and 896 transitions. [2018-12-09 15:41:11,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:11,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-09 15:41:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:11,994 INFO L225 Difference]: With dead ends: 709 [2018-12-09 15:41:11,995 INFO L226 Difference]: Without dead ends: 684 [2018-12-09 15:41:11,995 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-12-09 15:41:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-12-09 15:41:12,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 674. [2018-12-09 15:41:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-12-09 15:41:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 855 transitions. [2018-12-09 15:41:12,048 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 855 transitions. Word has length 54 [2018-12-09 15:41:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:12,049 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 855 transitions. [2018-12-09 15:41:12,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 855 transitions. [2018-12-09 15:41:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 15:41:12,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:12,051 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-12-09 15:41:12,051 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:12,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1488359511, now seen corresponding path program 1 times [2018-12-09 15:41:12,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:12,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:12,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:12,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:12,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:12,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:12,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:41:12,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:41:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:41:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:41:12,099 INFO L87 Difference]: Start difference. First operand 674 states and 855 transitions. Second operand 7 states. [2018-12-09 15:41:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:12,534 INFO L93 Difference]: Finished difference Result 708 states and 893 transitions. [2018-12-09 15:41:12,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:12,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-09 15:41:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:12,537 INFO L225 Difference]: With dead ends: 708 [2018-12-09 15:41:12,537 INFO L226 Difference]: Without dead ends: 604 [2018-12-09 15:41:12,537 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-12-09 15:41:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-12-09 15:41:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 582. [2018-12-09 15:41:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-12-09 15:41:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 732 transitions. [2018-12-09 15:41:12,576 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 732 transitions. Word has length 54 [2018-12-09 15:41:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:12,577 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 732 transitions. [2018-12-09 15:41:12,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:41:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 732 transitions. [2018-12-09 15:41:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 15:41:12,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:12,578 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-12-09 15:41:12,578 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:12,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:12,579 INFO L82 PathProgramCache]: Analyzing trace with hash 39700081, now seen corresponding path program 1 times [2018-12-09 15:41:12,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:12,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:12,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:12,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:12,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:12,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:12,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:12,654 INFO L87 Difference]: Start difference. First operand 582 states and 732 transitions. Second operand 9 states. [2018-12-09 15:41:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:13,397 INFO L93 Difference]: Finished difference Result 777 states and 972 transitions. [2018-12-09 15:41:13,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 15:41:13,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-12-09 15:41:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:13,399 INFO L225 Difference]: With dead ends: 777 [2018-12-09 15:41:13,399 INFO L226 Difference]: Without dead ends: 701 [2018-12-09 15:41:13,399 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-12-09 15:41:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-12-09 15:41:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 589. [2018-12-09 15:41:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-12-09 15:41:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 733 transitions. [2018-12-09 15:41:13,422 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 733 transitions. Word has length 54 [2018-12-09 15:41:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:13,423 INFO L480 AbstractCegarLoop]: Abstraction has 589 states and 733 transitions. [2018-12-09 15:41:13,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 733 transitions. [2018-12-09 15:41:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 15:41:13,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:13,423 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-12-09 15:41:13,424 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:13,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash -381110486, now seen corresponding path program 1 times [2018-12-09 15:41:13,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:13,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:13,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:13,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:13,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:13,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:13,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:41:13,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:41:13,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:41:13,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:41:13,457 INFO L87 Difference]: Start difference. First operand 589 states and 733 transitions. Second operand 6 states. [2018-12-09 15:41:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:13,511 INFO L93 Difference]: Finished difference Result 608 states and 752 transitions. [2018-12-09 15:41:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:13,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-09 15:41:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:13,513 INFO L225 Difference]: With dead ends: 608 [2018-12-09 15:41:13,513 INFO L226 Difference]: Without dead ends: 569 [2018-12-09 15:41:13,513 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-12-09 15:41:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-12-09 15:41:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2018-12-09 15:41:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-12-09 15:41:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 708 transitions. [2018-12-09 15:41:13,534 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 708 transitions. Word has length 57 [2018-12-09 15:41:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:13,535 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 708 transitions. [2018-12-09 15:41:13,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:41:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 708 transitions. [2018-12-09 15:41:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 15:41:13,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:13,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] [2018-12-09 15:41:13,535 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:13,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1488177932, now seen corresponding path program 1 times [2018-12-09 15:41:13,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:13,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:13,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:13,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:13,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:13,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:13,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:13,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:13,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:13,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:13,561 INFO L87 Difference]: Start difference. First operand 569 states and 708 transitions. Second operand 5 states. [2018-12-09 15:41:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:13,760 INFO L93 Difference]: Finished difference Result 581 states and 719 transitions. [2018-12-09 15:41:13,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:41:13,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-09 15:41:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:13,761 INFO L225 Difference]: With dead ends: 581 [2018-12-09 15:41:13,761 INFO L226 Difference]: Without dead ends: 563 [2018-12-09 15:41:13,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:41:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-12-09 15:41:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 552. [2018-12-09 15:41:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-09 15:41:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 683 transitions. [2018-12-09 15:41:13,784 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 683 transitions. Word has length 56 [2018-12-09 15:41:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:13,784 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 683 transitions. [2018-12-09 15:41:13,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 683 transitions. [2018-12-09 15:41:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 15:41:13,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:13,785 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-12-09 15:41:13,785 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:13,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash -12265598, now seen corresponding path program 1 times [2018-12-09 15:41:13,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:13,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:13,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:13,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:13,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:13,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:13,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:13,817 INFO L87 Difference]: Start difference. First operand 552 states and 683 transitions. Second operand 5 states. [2018-12-09 15:41:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:13,984 INFO L93 Difference]: Finished difference Result 811 states and 1012 transitions. [2018-12-09 15:41:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:41:13,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 15:41:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:13,986 INFO L225 Difference]: With dead ends: 811 [2018-12-09 15:41:13,986 INFO L226 Difference]: Without dead ends: 552 [2018-12-09 15:41:13,987 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-12-09 15:41:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-12-09 15:41:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2018-12-09 15:41:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-09 15:41:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2018-12-09 15:41:14,009 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 65 [2018-12-09 15:41:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:14,009 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2018-12-09 15:41:14,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2018-12-09 15:41:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 15:41:14,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:14,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:41:14,011 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:14,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash 118426915, now seen corresponding path program 1 times [2018-12-09 15:41:14,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:14,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:14,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:14,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:14,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:14,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:14,032 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand 3 states. [2018-12-09 15:41:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:14,063 INFO L93 Difference]: Finished difference Result 837 states and 1046 transitions. [2018-12-09 15:41:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:14,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 15:41:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:14,065 INFO L225 Difference]: With dead ends: 837 [2018-12-09 15:41:14,065 INFO L226 Difference]: Without dead ends: 578 [2018-12-09 15:41:14,066 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-12-09 15:41:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-12-09 15:41:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 552. [2018-12-09 15:41:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-09 15:41:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2018-12-09 15:41:14,088 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 68 [2018-12-09 15:41:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:14,088 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2018-12-09 15:41:14,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2018-12-09 15:41:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 15:41:14,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:14,089 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-12-09 15:41:14,090 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:14,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:14,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2112462179, now seen corresponding path program 1 times [2018-12-09 15:41:14,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:14,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:14,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:14,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:14,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:41:14,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:41:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:41:14,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:41:14,140 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand 6 states. [2018-12-09 15:41:14,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:14,189 INFO L93 Difference]: Finished difference Result 805 states and 1000 transitions. [2018-12-09 15:41:14,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:14,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 15:41:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:14,191 INFO L225 Difference]: With dead ends: 805 [2018-12-09 15:41:14,191 INFO L226 Difference]: Without dead ends: 579 [2018-12-09 15:41:14,191 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-12-09 15:41:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-09 15:41:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 552. [2018-12-09 15:41:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-09 15:41:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 679 transitions. [2018-12-09 15:41:14,213 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 679 transitions. Word has length 68 [2018-12-09 15:41:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:14,214 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 679 transitions. [2018-12-09 15:41:14,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:41:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 679 transitions. [2018-12-09 15:41:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 15:41:14,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:14,214 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-12-09 15:41:14,215 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:14,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1566897792, now seen corresponding path program 1 times [2018-12-09 15:41:14,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:14,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:14,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:14,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:14,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:14,263 INFO L87 Difference]: Start difference. First operand 552 states and 679 transitions. Second operand 9 states. [2018-12-09 15:41:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:14,389 INFO L93 Difference]: Finished difference Result 569 states and 696 transitions. [2018-12-09 15:41:14,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:14,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-09 15:41:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:14,391 INFO L225 Difference]: With dead ends: 569 [2018-12-09 15:41:14,391 INFO L226 Difference]: Without dead ends: 548 [2018-12-09 15:41:14,391 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-12-09 15:41:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-12-09 15:41:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2018-12-09 15:41:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-12-09 15:41:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 673 transitions. [2018-12-09 15:41:14,414 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 673 transitions. Word has length 60 [2018-12-09 15:41:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:14,414 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 673 transitions. [2018-12-09 15:41:14,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 673 transitions. [2018-12-09 15:41:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 15:41:14,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:14,415 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-12-09 15:41:14,415 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:14,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:14,415 INFO L82 PathProgramCache]: Analyzing trace with hash -938148036, now seen corresponding path program 1 times [2018-12-09 15:41:14,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:14,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:14,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:14,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:14,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:14,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:14,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:14,469 INFO L87 Difference]: Start difference. First operand 548 states and 673 transitions. Second operand 9 states. [2018-12-09 15:41:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:14,622 INFO L93 Difference]: Finished difference Result 565 states and 690 transitions. [2018-12-09 15:41:14,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:14,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-12-09 15:41:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:14,623 INFO L225 Difference]: With dead ends: 565 [2018-12-09 15:41:14,623 INFO L226 Difference]: Without dead ends: 543 [2018-12-09 15:41:14,624 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-12-09 15:41:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-09 15:41:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2018-12-09 15:41:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-12-09 15:41:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 666 transitions. [2018-12-09 15:41:14,646 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 666 transitions. Word has length 61 [2018-12-09 15:41:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:14,646 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 666 transitions. [2018-12-09 15:41:14,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 666 transitions. [2018-12-09 15:41:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 15:41:14,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:14,647 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-12-09 15:41:14,647 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:14,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1868259506, now seen corresponding path program 1 times [2018-12-09 15:41:14,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:14,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:14,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:14,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:14,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:14,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:14,686 INFO L87 Difference]: Start difference. First operand 543 states and 666 transitions. Second operand 9 states. [2018-12-09 15:41:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:14,802 INFO L93 Difference]: Finished difference Result 560 states and 683 transitions. [2018-12-09 15:41:14,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:14,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-12-09 15:41:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:14,804 INFO L225 Difference]: With dead ends: 560 [2018-12-09 15:41:14,804 INFO L226 Difference]: Without dead ends: 539 [2018-12-09 15:41:14,804 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-12-09 15:41:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-12-09 15:41:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2018-12-09 15:41:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-12-09 15:41:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 660 transitions. [2018-12-09 15:41:14,828 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 660 transitions. Word has length 61 [2018-12-09 15:41:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:14,829 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 660 transitions. [2018-12-09 15:41:14,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 660 transitions. [2018-12-09 15:41:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 15:41:14,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:14,829 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] [2018-12-09 15:41:14,830 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:14,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash -441395590, now seen corresponding path program 1 times [2018-12-09 15:41:14,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:14,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:14,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:14,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:41:14,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:41:14,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:41:14,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:41:14,863 INFO L87 Difference]: Start difference. First operand 539 states and 660 transitions. Second operand 3 states. [2018-12-09 15:41:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:14,897 INFO L93 Difference]: Finished difference Result 896 states and 1107 transitions. [2018-12-09 15:41:14,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:41:14,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-09 15:41:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:14,899 INFO L225 Difference]: With dead ends: 896 [2018-12-09 15:41:14,899 INFO L226 Difference]: Without dead ends: 643 [2018-12-09 15:41:14,900 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-12-09 15:41:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-12-09 15:41:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 613. [2018-12-09 15:41:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-12-09 15:41:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 754 transitions. [2018-12-09 15:41:14,934 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 754 transitions. Word has length 70 [2018-12-09 15:41:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:14,935 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 754 transitions. [2018-12-09 15:41:14,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:41:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 754 transitions. [2018-12-09 15:41:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 15:41:14,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:14,936 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-12-09 15:41:14,936 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:14,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1726599875, now seen corresponding path program 1 times [2018-12-09 15:41:14,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:14,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:14,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:14,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:14,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:14,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:14,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:14,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:14,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:14,997 INFO L87 Difference]: Start difference. First operand 613 states and 754 transitions. Second operand 9 states. [2018-12-09 15:41:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:15,109 INFO L93 Difference]: Finished difference Result 630 states and 771 transitions. [2018-12-09 15:41:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:15,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-12-09 15:41:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:15,111 INFO L225 Difference]: With dead ends: 630 [2018-12-09 15:41:15,111 INFO L226 Difference]: Without dead ends: 587 [2018-12-09 15:41:15,112 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-12-09 15:41:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-12-09 15:41:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-12-09 15:41:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-12-09 15:41:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 722 transitions. [2018-12-09 15:41:15,149 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 722 transitions. Word has length 65 [2018-12-09 15:41:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:15,149 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 722 transitions. [2018-12-09 15:41:15,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 722 transitions. [2018-12-09 15:41:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 15:41:15,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:15,150 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-12-09 15:41:15,150 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:15,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1495752637, now seen corresponding path program 1 times [2018-12-09 15:41:15,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:15,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:15,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:15,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:15,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:41:15,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:41:15,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:41:15,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:41:15,214 INFO L87 Difference]: Start difference. First operand 587 states and 722 transitions. Second operand 7 states. [2018-12-09 15:41:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:15,591 INFO L93 Difference]: Finished difference Result 891 states and 1100 transitions. [2018-12-09 15:41:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:41:15,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-12-09 15:41:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:15,593 INFO L225 Difference]: With dead ends: 891 [2018-12-09 15:41:15,593 INFO L226 Difference]: Without dead ends: 582 [2018-12-09 15:41:15,594 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-12-09 15:41:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-12-09 15:41:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 571. [2018-12-09 15:41:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-12-09 15:41:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 697 transitions. [2018-12-09 15:41:15,620 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 697 transitions. Word has length 79 [2018-12-09 15:41:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:15,620 INFO L480 AbstractCegarLoop]: Abstraction has 571 states and 697 transitions. [2018-12-09 15:41:15,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:41:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 697 transitions. [2018-12-09 15:41:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 15:41:15,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:15,621 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-12-09 15:41:15,621 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:15,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash -229993641, now seen corresponding path program 1 times [2018-12-09 15:41:15,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:15,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:15,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:15,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:41:15,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:41:15,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:41:15,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:41:15,686 INFO L87 Difference]: Start difference. First operand 571 states and 697 transitions. Second operand 6 states. [2018-12-09 15:41:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:15,745 INFO L93 Difference]: Finished difference Result 888 states and 1109 transitions. [2018-12-09 15:41:15,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:15,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-12-09 15:41:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:15,746 INFO L225 Difference]: With dead ends: 888 [2018-12-09 15:41:15,746 INFO L226 Difference]: Without dead ends: 634 [2018-12-09 15:41:15,747 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-12-09 15:41:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-12-09 15:41:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 537. [2018-12-09 15:41:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-12-09 15:41:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 653 transitions. [2018-12-09 15:41:15,772 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 653 transitions. Word has length 80 [2018-12-09 15:41:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:15,772 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 653 transitions. [2018-12-09 15:41:15,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:41:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 653 transitions. [2018-12-09 15:41:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 15:41:15,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:15,773 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-12-09 15:41:15,773 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:15,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:15,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1921735627, now seen corresponding path program 1 times [2018-12-09 15:41:15,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:15,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:15,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:15,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:15,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:15,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:15,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:15,806 INFO L87 Difference]: Start difference. First operand 537 states and 653 transitions. Second operand 5 states. [2018-12-09 15:41:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:16,082 INFO L93 Difference]: Finished difference Result 973 states and 1159 transitions. [2018-12-09 15:41:16,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:16,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-09 15:41:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:16,084 INFO L225 Difference]: With dead ends: 973 [2018-12-09 15:41:16,084 INFO L226 Difference]: Without dead ends: 603 [2018-12-09 15:41:16,085 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-12-09 15:41:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-12-09 15:41:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 580. [2018-12-09 15:41:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-09 15:41:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 690 transitions. [2018-12-09 15:41:16,111 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 690 transitions. Word has length 75 [2018-12-09 15:41:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:16,112 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 690 transitions. [2018-12-09 15:41:16,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 690 transitions. [2018-12-09 15:41:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 15:41:16,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:16,113 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-12-09 15:41:16,113 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:16,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:16,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1118408541, now seen corresponding path program 1 times [2018-12-09 15:41:16,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:16,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:16,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:16,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:16,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-12-09 15:41:16,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:16,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:16,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:16,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:16,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:16,158 INFO L87 Difference]: Start difference. First operand 580 states and 690 transitions. Second operand 9 states. [2018-12-09 15:41:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:16,276 INFO L93 Difference]: Finished difference Result 582 states and 691 transitions. [2018-12-09 15:41:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:16,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-12-09 15:41:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:16,277 INFO L225 Difference]: With dead ends: 582 [2018-12-09 15:41:16,277 INFO L226 Difference]: Without dead ends: 446 [2018-12-09 15:41:16,278 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-12-09 15:41:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-09 15:41:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-12-09 15:41:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-12-09 15:41:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 532 transitions. [2018-12-09 15:41:16,313 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 532 transitions. Word has length 78 [2018-12-09 15:41:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:16,313 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 532 transitions. [2018-12-09 15:41:16,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 532 transitions. [2018-12-09 15:41:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 15:41:16,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:16,314 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-12-09 15:41:16,314 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:16,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:16,315 INFO L82 PathProgramCache]: Analyzing trace with hash -534163168, now seen corresponding path program 1 times [2018-12-09 15:41:16,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:16,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:16,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:16,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:16,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:16,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:16,385 INFO L87 Difference]: Start difference. First operand 446 states and 532 transitions. Second operand 9 states. [2018-12-09 15:41:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:16,462 INFO L93 Difference]: Finished difference Result 467 states and 554 transitions. [2018-12-09 15:41:16,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:16,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-12-09 15:41:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:16,463 INFO L225 Difference]: With dead ends: 467 [2018-12-09 15:41:16,463 INFO L226 Difference]: Without dead ends: 446 [2018-12-09 15:41:16,464 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-12-09 15:41:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-09 15:41:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-12-09 15:41:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-12-09 15:41:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 531 transitions. [2018-12-09 15:41:16,485 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 531 transitions. Word has length 85 [2018-12-09 15:41:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:16,485 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 531 transitions. [2018-12-09 15:41:16,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 531 transitions. [2018-12-09 15:41:16,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 15:41:16,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:16,486 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-12-09 15:41:16,486 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:16,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1730477814, now seen corresponding path program 1 times [2018-12-09 15:41:16,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:16,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:16,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-12-09 15:41:16,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:16,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:41:16,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:41:16,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:41:16,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:41:16,521 INFO L87 Difference]: Start difference. First operand 446 states and 531 transitions. Second operand 6 states. [2018-12-09 15:41:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:16,556 INFO L93 Difference]: Finished difference Result 479 states and 563 transitions. [2018-12-09 15:41:16,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:16,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 15:41:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:16,558 INFO L225 Difference]: With dead ends: 479 [2018-12-09 15:41:16,558 INFO L226 Difference]: Without dead ends: 440 [2018-12-09 15:41:16,558 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-12-09 15:41:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-12-09 15:41:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 387. [2018-12-09 15:41:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-09 15:41:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 455 transitions. [2018-12-09 15:41:16,586 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 455 transitions. Word has length 96 [2018-12-09 15:41:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:16,586 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 455 transitions. [2018-12-09 15:41:16,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:41:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 455 transitions. [2018-12-09 15:41:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 15:41:16,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:16,588 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-12-09 15:41:16,588 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:16,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash -342402432, now seen corresponding path program 1 times [2018-12-09 15:41:16,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:16,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:16,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:16,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:41:16,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:41:16,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:41:16,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:41:16,631 INFO L87 Difference]: Start difference. First operand 387 states and 455 transitions. Second operand 7 states. [2018-12-09 15:41:16,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:16,736 INFO L93 Difference]: Finished difference Result 730 states and 864 transitions. [2018-12-09 15:41:16,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:16,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 15:41:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:16,739 INFO L225 Difference]: With dead ends: 730 [2018-12-09 15:41:16,739 INFO L226 Difference]: Without dead ends: 685 [2018-12-09 15:41:16,739 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-12-09 15:41:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-12-09 15:41:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 367. [2018-12-09 15:41:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-09 15:41:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 430 transitions. [2018-12-09 15:41:16,763 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 430 transitions. Word has length 96 [2018-12-09 15:41:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:16,763 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 430 transitions. [2018-12-09 15:41:16,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:41:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 430 transitions. [2018-12-09 15:41:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:41:16,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:16,764 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-12-09 15:41:16,764 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:16,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash 730694435, now seen corresponding path program 1 times [2018-12-09 15:41:16,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:16,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:16,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:16,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 15:41:16,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 15:41:16,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 15:41:16,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:41:16,833 INFO L87 Difference]: Start difference. First operand 367 states and 430 transitions. Second operand 11 states. [2018-12-09 15:41:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:16,924 INFO L93 Difference]: Finished difference Result 512 states and 604 transitions. [2018-12-09 15:41:16,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:41:16,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-12-09 15:41:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:16,925 INFO L225 Difference]: With dead ends: 512 [2018-12-09 15:41:16,925 INFO L226 Difference]: Without dead ends: 363 [2018-12-09 15:41:16,925 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-12-09 15:41:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-09 15:41:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 350. [2018-12-09 15:41:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-12-09 15:41:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 407 transitions. [2018-12-09 15:41:16,946 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 407 transitions. Word has length 101 [2018-12-09 15:41:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:16,946 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 407 transitions. [2018-12-09 15:41:16,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 15:41:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 407 transitions. [2018-12-09 15:41:16,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 15:41:16,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:16,947 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-12-09 15:41:16,947 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:16,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:16,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1042284347, now seen corresponding path program 1 times [2018-12-09 15:41:16,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:16,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 15:41:16,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:16,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:16,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:16,984 INFO L87 Difference]: Start difference. First operand 350 states and 407 transitions. Second operand 5 states. [2018-12-09 15:41:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:17,020 INFO L93 Difference]: Finished difference Result 601 states and 707 transitions. [2018-12-09 15:41:17,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:41:17,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-09 15:41:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:17,021 INFO L225 Difference]: With dead ends: 601 [2018-12-09 15:41:17,021 INFO L226 Difference]: Without dead ends: 349 [2018-12-09 15:41:17,022 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-12-09 15:41:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-09 15:41:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-12-09 15:41:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-09 15:41:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 405 transitions. [2018-12-09 15:41:17,055 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 405 transitions. Word has length 110 [2018-12-09 15:41:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:17,055 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 405 transitions. [2018-12-09 15:41:17,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 405 transitions. [2018-12-09 15:41:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 15:41:17,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:17,057 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-12-09 15:41:17,057 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:17,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1716247270, now seen corresponding path program 1 times [2018-12-09 15:41:17,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:17,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 15:41:17,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:17,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:41:17,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:41:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:41:17,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:41:17,106 INFO L87 Difference]: Start difference. First operand 349 states and 405 transitions. Second operand 6 states. [2018-12-09 15:41:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:17,153 INFO L93 Difference]: Finished difference Result 377 states and 432 transitions. [2018-12-09 15:41:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:17,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-09 15:41:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:17,154 INFO L225 Difference]: With dead ends: 377 [2018-12-09 15:41:17,154 INFO L226 Difference]: Without dead ends: 301 [2018-12-09 15:41:17,155 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-12-09 15:41:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-09 15:41:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2018-12-09 15:41:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-12-09 15:41:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 265 transitions. [2018-12-09 15:41:17,179 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 265 transitions. Word has length 110 [2018-12-09 15:41:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:17,179 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 265 transitions. [2018-12-09 15:41:17,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:41:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 265 transitions. [2018-12-09 15:41:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 15:41:17,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:17,180 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-12-09 15:41:17,180 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:17,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 424283100, now seen corresponding path program 1 times [2018-12-09 15:41:17,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:17,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:17,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:17,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 15:41:17,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:17,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:17,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:17,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:17,255 INFO L87 Difference]: Start difference. First operand 239 states and 265 transitions. Second operand 9 states. [2018-12-09 15:41:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:17,328 INFO L93 Difference]: Finished difference Result 312 states and 353 transitions. [2018-12-09 15:41:17,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:17,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-12-09 15:41:17,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:17,329 INFO L225 Difference]: With dead ends: 312 [2018-12-09 15:41:17,330 INFO L226 Difference]: Without dead ends: 283 [2018-12-09 15:41:17,330 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-12-09 15:41:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-09 15:41:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2018-12-09 15:41:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-09 15:41:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2018-12-09 15:41:17,354 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 131 [2018-12-09 15:41:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:17,354 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2018-12-09 15:41:17,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2018-12-09 15:41:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 15:41:17,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:17,356 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-12-09 15:41:17,356 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:17,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash 765037084, now seen corresponding path program 1 times [2018-12-09 15:41:17,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:17,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 15:41:17,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:17,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:17,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:17,425 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand 9 states. [2018-12-09 15:41:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:17,490 INFO L93 Difference]: Finished difference Result 334 states and 374 transitions. [2018-12-09 15:41:17,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:17,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2018-12-09 15:41:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:17,492 INFO L225 Difference]: With dead ends: 334 [2018-12-09 15:41:17,492 INFO L226 Difference]: Without dead ends: 263 [2018-12-09 15:41:17,492 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-12-09 15:41:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-09 15:41:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 241. [2018-12-09 15:41:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-09 15:41:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 265 transitions. [2018-12-09 15:41:17,517 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 265 transitions. Word has length 132 [2018-12-09 15:41:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:17,517 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 265 transitions. [2018-12-09 15:41:17,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 265 transitions. [2018-12-09 15:41:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 15:41:17,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:17,519 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-12-09 15:41:17,519 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:17,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:17,519 INFO L82 PathProgramCache]: Analyzing trace with hash -672296009, now seen corresponding path program 1 times [2018-12-09 15:41:17,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:17,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:17,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:17,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:41:17,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:17,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:17,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:41:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:17,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:17,571 INFO L87 Difference]: Start difference. First operand 241 states and 265 transitions. Second operand 5 states. [2018-12-09 15:41:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:17,606 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-12-09 15:41:17,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:41:17,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-09 15:41:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:17,607 INFO L225 Difference]: With dead ends: 277 [2018-12-09 15:41:17,608 INFO L226 Difference]: Without dead ends: 247 [2018-12-09 15:41:17,608 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-12-09 15:41:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-09 15:41:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-12-09 15:41:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-09 15:41:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 269 transitions. [2018-12-09 15:41:17,637 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 269 transitions. Word has length 147 [2018-12-09 15:41:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:17,638 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 269 transitions. [2018-12-09 15:41:17,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:41:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 269 transitions. [2018-12-09 15:41:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 15:41:17,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:17,639 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-12-09 15:41:17,639 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:17,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash -490809512, now seen corresponding path program 1 times [2018-12-09 15:41:17,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:17,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 15:41:17,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:17,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 15:41:17,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 15:41:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 15:41:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-09 15:41:17,771 INFO L87 Difference]: Start difference. First operand 245 states and 269 transitions. Second operand 15 states. [2018-12-09 15:41:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:17,907 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2018-12-09 15:41:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 15:41:17,907 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-12-09 15:41:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:17,908 INFO L225 Difference]: With dead ends: 311 [2018-12-09 15:41:17,908 INFO L226 Difference]: Without dead ends: 276 [2018-12-09 15:41:17,908 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-12-09 15:41:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-09 15:41:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 262. [2018-12-09 15:41:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-09 15:41:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 290 transitions. [2018-12-09 15:41:17,924 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 290 transitions. Word has length 147 [2018-12-09 15:41:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:17,924 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 290 transitions. [2018-12-09 15:41:17,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 15:41:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 290 transitions. [2018-12-09 15:41:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 15:41:17,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:17,925 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-12-09 15:41:17,925 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:17,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:17,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1053414808, now seen corresponding path program 1 times [2018-12-09 15:41:17,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:17,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:17,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:17,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 15:41:17,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:17,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:41:17,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:41:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:41:17,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:41:17,974 INFO L87 Difference]: Start difference. First operand 262 states and 290 transitions. Second operand 9 states. [2018-12-09 15:41:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:18,039 INFO L93 Difference]: Finished difference Result 351 states and 391 transitions. [2018-12-09 15:41:18,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:41:18,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-12-09 15:41:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:18,040 INFO L225 Difference]: With dead ends: 351 [2018-12-09 15:41:18,040 INFO L226 Difference]: Without dead ends: 270 [2018-12-09 15:41:18,040 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-12-09 15:41:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-09 15:41:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2018-12-09 15:41:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-09 15:41:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 289 transitions. [2018-12-09 15:41:18,066 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 289 transitions. Word has length 148 [2018-12-09 15:41:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:18,066 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 289 transitions. [2018-12-09 15:41:18,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:41:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 289 transitions. [2018-12-09 15:41:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 15:41:18,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:18,067 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-12-09 15:41:18,067 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:18,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1979295687, now seen corresponding path program 1 times [2018-12-09 15:41:18,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:18,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:18,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 15:41:18,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:41:18,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/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-12-09 15:41:18,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:18,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:41:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:41:18,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:41:18,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-12-09 15:41:18,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 15:41:18,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 15:41:18,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-09 15:41:18,415 INFO L87 Difference]: Start difference. First operand 262 states and 289 transitions. Second operand 21 states. [2018-12-09 15:41:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:18,558 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2018-12-09 15:41:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 15:41:18,558 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 150 [2018-12-09 15:41:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:18,559 INFO L225 Difference]: With dead ends: 307 [2018-12-09 15:41:18,559 INFO L226 Difference]: Without dead ends: 266 [2018-12-09 15:41:18,560 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-12-09 15:41:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-09 15:41:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2018-12-09 15:41:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 15:41:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 280 transitions. [2018-12-09 15:41:18,591 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 280 transitions. Word has length 150 [2018-12-09 15:41:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:18,592 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 280 transitions. [2018-12-09 15:41:18,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 15:41:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 280 transitions. [2018-12-09 15:41:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 15:41:18,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:18,593 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-12-09 15:41:18,593 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:18,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2052783288, now seen corresponding path program 1 times [2018-12-09 15:41:18,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:18,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:18,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:18,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:18,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 15:41:18,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:41:18,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/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-12-09 15:41:18,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:18,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:41:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 15:41:18,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:41:18,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-12-09 15:41:18,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 15:41:18,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 15:41:18,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:41:18,871 INFO L87 Difference]: Start difference. First operand 256 states and 280 transitions. Second operand 14 states. [2018-12-09 15:41:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:19,036 INFO L93 Difference]: Finished difference Result 317 states and 345 transitions. [2018-12-09 15:41:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:41:19,036 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-12-09 15:41:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:19,037 INFO L225 Difference]: With dead ends: 317 [2018-12-09 15:41:19,037 INFO L226 Difference]: Without dead ends: 242 [2018-12-09 15:41:19,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-09 15:41:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-09 15:41:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 228. [2018-12-09 15:41:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-09 15:41:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 246 transitions. [2018-12-09 15:41:19,057 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 246 transitions. Word has length 155 [2018-12-09 15:41:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:19,057 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 246 transitions. [2018-12-09 15:41:19,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 15:41:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 246 transitions. [2018-12-09 15:41:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 15:41:19,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:19,058 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-12-09 15:41:19,058 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:19,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1661694165, now seen corresponding path program 1 times [2018-12-09 15:41:19,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:19,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:19,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:19,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:19,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 15:41:19,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:19,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:41:19,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:41:19,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:41:19,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:41:19,101 INFO L87 Difference]: Start difference. First operand 228 states and 246 transitions. Second operand 6 states. [2018-12-09 15:41:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:19,135 INFO L93 Difference]: Finished difference Result 318 states and 344 transitions. [2018-12-09 15:41:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:19,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-12-09 15:41:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:19,136 INFO L225 Difference]: With dead ends: 318 [2018-12-09 15:41:19,136 INFO L226 Difference]: Without dead ends: 233 [2018-12-09 15:41:19,136 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-12-09 15:41:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-09 15:41:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2018-12-09 15:41:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-09 15:41:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 244 transitions. [2018-12-09 15:41:19,161 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 244 transitions. Word has length 157 [2018-12-09 15:41:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:19,161 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 244 transitions. [2018-12-09 15:41:19,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:41:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 244 transitions. [2018-12-09 15:41:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 15:41:19,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:19,162 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-12-09 15:41:19,163 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:19,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash 386317675, now seen corresponding path program 1 times [2018-12-09 15:41:19,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 15:41:19,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:19,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 15:41:19,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:41:19,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:41:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:41:19,270 INFO L87 Difference]: Start difference. First operand 227 states and 244 transitions. Second operand 10 states. [2018-12-09 15:41:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:19,739 INFO L93 Difference]: Finished difference Result 448 states and 483 transitions. [2018-12-09 15:41:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 15:41:19,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2018-12-09 15:41:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:19,741 INFO L225 Difference]: With dead ends: 448 [2018-12-09 15:41:19,741 INFO L226 Difference]: Without dead ends: 230 [2018-12-09 15:41:19,742 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-12-09 15:41:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-09 15:41:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-12-09 15:41:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-09 15:41:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 243 transitions. [2018-12-09 15:41:19,765 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 243 transitions. Word has length 158 [2018-12-09 15:41:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:19,765 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 243 transitions. [2018-12-09 15:41:19,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:41:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 243 transitions. [2018-12-09 15:41:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 15:41:19,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:41:19,766 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-12-09 15:41:19,766 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:41:19,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1977523987, now seen corresponding path program 1 times [2018-12-09 15:41:19,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:19,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:19,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:19,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:19,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 15:41:19,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:41:19,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/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-12-09 15:41:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:19,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:41:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 15:41:20,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:41:20,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-12-09 15:41:20,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 15:41:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 15:41:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-12-09 15:41:20,060 INFO L87 Difference]: Start difference. First operand 227 states and 243 transitions. Second operand 19 states. [2018-12-09 15:41:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:20,704 INFO L93 Difference]: Finished difference Result 298 states and 323 transitions. [2018-12-09 15:41:20,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 15:41:20,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 158 [2018-12-09 15:41:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:41:20,704 INFO L225 Difference]: With dead ends: 298 [2018-12-09 15:41:20,704 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 15:41:20,705 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-12-09 15:41:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 15:41:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 15:41:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 15:41:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 15:41:20,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2018-12-09 15:41:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:41:20,706 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:41:20,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 15:41:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:41:20,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 15:41:20,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 15:41:20,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:20,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:21,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:41:22,053 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 84 [2018-12-09 15:41:22,489 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 93 [2018-12-09 15:41:22,753 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 54 [2018-12-09 15:41:23,030 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 92 [2018-12-09 15:41:23,231 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 70 [2018-12-09 15:41:23,412 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-12-09 15:41:23,619 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 71 [2018-12-09 15:41:23,947 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 87 [2018-12-09 15:41:24,209 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2018-12-09 15:41:24,342 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2018-12-09 15:41:24,506 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 67 [2018-12-09 15:41:24,681 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 71 [2018-12-09 15:41:24,795 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2018-12-09 15:41:25,351 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 74 [2018-12-09 15:41:27,109 WARN L180 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 204 DAG size of output: 103 [2018-12-09 15:41:27,617 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 92 [2018-12-09 15:41:27,861 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2018-12-09 15:41:28,258 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-12-09 15:41:28,414 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 1 [2018-12-09 15:41:28,641 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-12-09 15:41:29,277 WARN L180 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 90 [2018-12-09 15:41:29,558 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2018-12-09 15:41:29,879 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 71 [2018-12-09 15:41:30,101 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2018-12-09 15:41:30,242 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2018-12-09 15:41:30,854 WARN L180 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 85 [2018-12-09 15:41:30,980 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-12-09 15:41:31,265 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2018-12-09 15:41:31,702 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-12-09 15:41:32,216 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 87 [2018-12-09 15:41:32,704 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 94 [2018-12-09 15:41:32,995 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 96 [2018-12-09 15:41:33,303 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2018-12-09 15:41:33,404 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-12-09 15:41:33,510 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2018-12-09 15:41:33,632 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-12-09 15:41:33,863 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-12-09 15:41:34,134 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2018-12-09 15:41:34,420 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 96 [2018-12-09 15:41:34,596 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2018-12-09 15:41:34,702 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-12-09 15:41:35,053 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 94 [2018-12-09 15:41:35,337 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-12-09 15:41:35,661 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 90 [2018-12-09 15:41:36,483 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 61 [2018-12-09 15:41:36,604 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-12-09 15:41:37,344 WARN L180 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2018-12-09 15:41:37,631 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2018-12-09 15:41:37,833 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-12-09 15:41:37,960 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-12-09 15:41:38,090 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-12-09 15:41:38,246 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 1 [2018-12-09 15:41:38,467 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2018-12-09 15:41:38,589 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-12-09 15:41:39,097 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2018-12-09 15:41:39,315 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2018-12-09 15:41:39,438 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-12-09 15:41:39,827 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2018-12-09 15:41:40,027 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2018-12-09 15:41:40,153 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-12-09 15:41:40,373 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2018-12-09 15:41:40,377 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 878 899) no Hoare annotation was computed. [2018-12-09 15:41:40,377 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 878 899) no Hoare annotation was computed. [2018-12-09 15:41:40,377 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 878 899) the Hoare annotation is: true [2018-12-09 15:41:40,377 INFO L451 ceAbstractionStarter]: At program point L888(lines 887 897) the Hoare annotation is: true [2018-12-09 15:41:40,377 INFO L451 ceAbstractionStarter]: At program point L886(lines 885 897) the Hoare annotation is: true [2018-12-09 15:41:40,378 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 897) no Hoare annotation was computed. [2018-12-09 15:41:40,378 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 889 896) no Hoare annotation was computed. [2018-12-09 15:41:40,378 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 889 896) no Hoare annotation was computed. [2018-12-09 15:41:40,378 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 69 89) no Hoare annotation was computed. [2018-12-09 15:41:40,378 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-12-09 15:41:40,378 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 69 89) no Hoare annotation was computed. [2018-12-09 15:41:40,378 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 900 920) no Hoare annotation was computed. [2018-12-09 15:41:40,379 INFO L451 ceAbstractionStarter]: At program point L909(lines 908 918) the Hoare annotation is: true [2018-12-09 15:41:40,379 INFO L451 ceAbstractionStarter]: At program point L907(lines 906 918) the Hoare annotation is: true [2018-12-09 15:41:40,379 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 918) no Hoare annotation was computed. [2018-12-09 15:41:40,379 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 900 920) the Hoare annotation is: true [2018-12-09 15:41:40,379 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 910 917) no Hoare annotation was computed. [2018-12-09 15:41:40,379 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 900 920) no Hoare annotation was computed. [2018-12-09 15:41:40,379 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 910 917) no Hoare annotation was computed. [2018-12-09 15:41:40,379 INFO L444 ceAbstractionStarter]: At program point L225(lines 224 423) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-09 15:41:40,380 INFO L448 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2018-12-09 15:41:40,380 INFO L444 ceAbstractionStarter]: At program point L283(line 283) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,380 INFO L448 ceAbstractionStarter]: For program point L283-1(line 283) no Hoare annotation was computed. [2018-12-09 15:41:40,380 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 248) no Hoare annotation was computed. [2018-12-09 15:41:40,380 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 428) no Hoare annotation was computed. [2018-12-09 15:41:40,380 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-09 15:41:40,380 INFO L448 ceAbstractionStarter]: For program point L399-1(lines 399 403) no Hoare annotation was computed. [2018-12-09 15:41:40,380 INFO L448 ceAbstractionStarter]: For program point L366-1(lines 362 368) no Hoare annotation was computed. [2018-12-09 15:41:40,381 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2018-12-09 15:41:40,381 INFO L448 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2018-12-09 15:41:40,381 INFO L448 ceAbstractionStarter]: For program point L267-2(lines 267 269) no Hoare annotation was computed. [2018-12-09 15:41:40,381 INFO L444 ceAbstractionStarter]: At program point L391(line 391) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~NP~0 5)) (.cse8 (+ ~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) (< ~MPR3~0 .cse7) (< ~SKIP2~0 .cse8) (< ~MPR3~0 6) (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) (<= .cse7 ~MPR3~0) (<= .cse8 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-09 15:41:40,381 INFO L448 ceAbstractionStarter]: For program point L391-1(line 391) no Hoare annotation was computed. [2018-12-09 15:41:40,381 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-09 15:41:40,381 INFO L448 ceAbstractionStarter]: For program point L383-1(lines 379 385) no Hoare annotation was computed. [2018-12-09 15:41:40,381 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 425) no Hoare annotation was computed. [2018-12-09 15:41:40,382 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2018-12-09 15:41:40,382 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 347) no Hoare annotation was computed. [2018-12-09 15:41:40,382 INFO L444 ceAbstractionStarter]: At program point L210(lines 209 428) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (< 0 ~MaximumInterfaceType~0)) (.cse5 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (and .cse0 .cse1 .cse2 (= |old(~myStatus~0)| ~myStatus~0) (= 0 FloppyPnp_~ntStatus~0) .cse3) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse4 .cse5) (or (and .cse0 .cse1 .cse2 (= 0 ~myStatus~0) (= |old(~myStatus~0)| FloppyPnp_~ntStatus~0) .cse3) (not (= |old(~myStatus~0)| 0)) .cse4 .cse5))) [2018-12-09 15:41:40,382 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 231 421) no Hoare annotation was computed. [2018-12-09 15:41:40,382 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 231 421) no Hoare annotation was computed. [2018-12-09 15:41:40,382 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 332) no Hoare annotation was computed. [2018-12-09 15:41:40,382 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 321 333) no Hoare annotation was computed. [2018-12-09 15:41:40,382 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 422) no Hoare annotation was computed. [2018-12-09 15:41:40,383 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~NP~0 5)) (.cse8 (+ ~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) (< ~MPR3~0 .cse7) (< ~SKIP2~0 .cse8) (< ~MPR3~0 6) (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) (<= .cse7 ~MPR3~0) (<= .cse8 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-09 15:41:40,383 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-12-09 15:41:40,383 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,383 INFO L448 ceAbstractionStarter]: For program point L252-1(line 252) no Hoare annotation was computed. [2018-12-09 15:41:40,383 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-09 15:41:40,383 INFO L448 ceAbstractionStarter]: For program point L277-1(lines 273 279) no Hoare annotation was computed. [2018-12-09 15:41:40,384 INFO L444 ceAbstractionStarter]: At program point L401(line 401) the Hoare annotation is: (let ((.cse0 (and (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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,384 INFO L448 ceAbstractionStarter]: For program point L401-1(line 401) no Hoare annotation was computed. [2018-12-09 15:41:40,384 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 398) no Hoare annotation was computed. [2018-12-09 15:41:40,384 INFO L448 ceAbstractionStarter]: For program point L393-2(lines 231 419) no Hoare annotation was computed. [2018-12-09 15:41:40,384 INFO L444 ceAbstractionStarter]: At program point L228(lines 227 422) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-09 15:41:40,384 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 197) no Hoare annotation was computed. [2018-12-09 15:41:40,384 INFO L448 ceAbstractionStarter]: For program point L195-2(lines 195 197) no Hoare annotation was computed. [2018-12-09 15:41:40,384 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) (= 1 ~setEventCalled~0) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-12-09 15:41:40,385 INFO L448 ceAbstractionStarter]: For program point L344-1(line 344) no Hoare annotation was computed. [2018-12-09 15:41:40,385 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 427) no Hoare annotation was computed. [2018-12-09 15:41:40,385 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 309) no Hoare annotation was computed. [2018-12-09 15:41:40,385 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-09 15:41:40,385 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 293) no Hoare annotation was computed. [2018-12-09 15:41:40,385 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 424) no Hoare annotation was computed. [2018-12-09 15:41:40,385 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-09 15:41:40,385 INFO L448 ceAbstractionStarter]: For program point L411-1(lines 407 413) no Hoare annotation was computed. [2018-12-09 15:41:40,386 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-09 15:41:40,386 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 242 248) no Hoare annotation was computed. [2018-12-09 15:41:40,386 INFO L444 ceAbstractionStarter]: At program point L205(line 205) the Hoare annotation is: (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse0 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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)) .cse1 .cse0 .cse2))) [2018-12-09 15:41:40,386 INFO L448 ceAbstractionStarter]: For program point L238-1(lines 231 419) no Hoare annotation was computed. [2018-12-09 15:41:40,386 INFO L448 ceAbstractionStarter]: For program point L205-1(line 205) no Hoare annotation was computed. [2018-12-09 15:41:40,386 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,386 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 368) no Hoare annotation was computed. [2018-12-09 15:41:40,386 INFO L448 ceAbstractionStarter]: For program point L395-1(lines 395 396) no Hoare annotation was computed. [2018-12-09 15:41:40,387 INFO L444 ceAbstractionStarter]: At program point L230(lines 229 422) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-09 15:41:40,387 INFO L444 ceAbstractionStarter]: At program point L420(lines 231 421) the Hoare annotation is: (let ((.cse9 (+ ~SKIP1~0 2)) (.cse8 (+ ~DC~0 2)) (.cse7 (+ ~NP~0 5)) (.cse10 (+ ~DC~0 5)) (.cse6 (+ ~NP~0 2))) (let ((.cse11 (= 0 ~pended~0)) (.cse12 (= ~SKIP2~0 ~s~0)) (.cse13 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse22 (<= ~MPR3~0 6)) (.cse23 (<= 6 ~MPR3~0)) (.cse15 (<= .cse6 ~SKIP1~0)) (.cse16 (= ~DC~0 ~s~0)) (.cse17 (<= .cse10 ~IPC~0)) (.cse18 (<= .cse7 ~MPR3~0)) (.cse19 (<= .cse8 ~SKIP2~0)) (.cse20 (<= .cse9 ~MPR1~0)) (.cse21 (= ~NP~0 |old(~s~0)|)) (.cse14 (<= ~compRegistered~0 0))) (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and .cse15 .cse16 (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse14)) (.cse4 (and .cse15 .cse17 .cse12 .cse20 (= 0 ~customIrp~0) .cse13 .cse18 .cse19 .cse22 (= |old(~customIrp~0)| ~customIrp~0) (not (= |old(~s~0)| ~MPR3~0)) .cse14 .cse23)) (.cse5 (and (not (= 259 FloppyPnp_~ntStatus~0)) (and (and .cse15 (and .cse16 .cse11 .cse17 .cse18 .cse19) .cse20 .cse21) .cse22 .cse23))) (.cse0 (and .cse11 .cse12 .cse13 .cse14)) (.cse2 (or (< ~SKIP1~0 .cse6) (< 6 ~MPR3~0) (< ~MPR3~0 .cse7) (< ~SKIP2~0 .cse8) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse9) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse10) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (not (= |old(~myStatus~0)| 0)) .cse1 .cse3 .cse4 .cse5 .cse0 .cse2))))) [2018-12-09 15:41:40,387 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)) (= 1 ~setEventCalled~0) .cse4 .cse5)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 .cse3) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3)))) [2018-12-09 15:41:40,387 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 333) no Hoare annotation was computed. [2018-12-09 15:41:40,388 INFO L444 ceAbstractionStarter]: At program point L222(lines 218 425) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 5)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~NP~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse7 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse6 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= .cse4 ~MPR3~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse5 ~SKIP2~0) (= 0 ~myStatus~0) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0))) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse4) (< ~SKIP2~0 .cse5) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse7) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse2 .cse1)))) [2018-12-09 15:41:40,388 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 385) no Hoare annotation was computed. [2018-12-09 15:41:40,388 INFO L444 ceAbstractionStarter]: At program point L313(line 313) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~NP~0 5)) (.cse8 (+ ~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) (< ~MPR3~0 .cse7) (< ~SKIP2~0 .cse8) (< ~MPR3~0 6) (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) (<= .cse7 ~MPR3~0) (<= .cse8 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-09 15:41:40,388 INFO L448 ceAbstractionStarter]: For program point L313-1(line 313) no Hoare annotation was computed. [2018-12-09 15:41:40,388 INFO L444 ceAbstractionStarter]: At program point L338(line 338) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,388 INFO L448 ceAbstractionStarter]: For program point L338-1(line 338) no Hoare annotation was computed. [2018-12-09 15:41:40,389 INFO L444 ceAbstractionStarter]: At program point L264(lines 264 265) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (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) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (<= ~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-12-09 15:41:40,389 INFO L448 ceAbstractionStarter]: For program point L297-1(lines 231 419) no Hoare annotation was computed. [2018-12-09 15:41:40,389 INFO L448 ceAbstractionStarter]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2018-12-09 15:41:40,389 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 162 435) no Hoare annotation was computed. [2018-12-09 15:41:40,389 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 426) no Hoare annotation was computed. [2018-12-09 15:41:40,389 INFO L444 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~NP~0 5)) (.cse8 (+ ~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) (< ~MPR3~0 .cse7) (< ~SKIP2~0 .cse8) (< ~MPR3~0 6) (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) (<= .cse7 ~MPR3~0) (<= .cse8 ~SKIP2~0)))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-09 15:41:40,389 INFO L448 ceAbstractionStarter]: For program point L372-1(line 372) no Hoare annotation was computed. [2018-12-09 15:41:40,389 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 279) no Hoare annotation was computed. [2018-12-09 15:41:40,390 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-12-09 15:41:40,390 INFO L448 ceAbstractionStarter]: For program point L430-2(lines 430 432) no Hoare annotation was computed. [2018-12-09 15:41:40,390 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-09 15:41:40,390 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 423) no Hoare annotation was computed. [2018-12-09 15:41:40,390 INFO L444 ceAbstractionStarter]: At program point L216(lines 212 427) the Hoare annotation is: (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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)) .cse1 .cse0 .cse2))) [2018-12-09 15:41:40,390 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-09 15:41:40,390 INFO L448 ceAbstractionStarter]: For program point L307-1(lines 303 309) no Hoare annotation was computed. [2018-12-09 15:41:40,391 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 162 435) no Hoare annotation was computed. [2018-12-09 15:41:40,391 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 208) no Hoare annotation was computed. [2018-12-09 15:41:40,391 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 162 435) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (and .cse1 .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4) .cse5) (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4) .cse5))) [2018-12-09 15:41:40,391 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,391 INFO L444 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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)) .cse1 .cse0 .cse2))) [2018-12-09 15:41:40,391 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-12-09 15:41:40,392 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 669 808) no Hoare annotation was computed. [2018-12-09 15:41:40,392 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2018-12-09 15:41:40,392 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-12-09 15:41:40,392 INFO L444 ceAbstractionStarter]: At program point L780(lines 767 800) the Hoare annotation is: (let ((.cse8 (= ~DC~0 ~s~0)) (.cse3 (= main_~status~1 ~lowerDriverReturn~0)) (.cse4 (<= (+ ~DC~0 5) ~IPC~0)) (.cse5 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= ~compRegistered~0 0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (or (and .cse8 .cse5 .cse4 .cse6) (and .cse3 .cse4 .cse5 .cse6 .cse7)))) (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 (and (and .cse0 .cse1 .cse2) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse3 .cse0 .cse1 (<= ~SKIP2~0 ~s~0) (and .cse4 .cse5 .cse6 .cse7)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 (<= (+ main_~status~1 1073741823) 0) .cse1 .cse2) (and .cse2 (= 0 main_~status~1)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse8 .cse5 .cse4 .cse6 (<= (+ 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-12-09 15:41:40,392 INFO L448 ceAbstractionStarter]: For program point L739(line 739) no Hoare annotation was computed. [2018-12-09 15:41:40,393 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) (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 (and (and .cse8 (and .cse7 .cse1 .cse2 .cse3) .cse9) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= 259 main_~status~1))) (and .cse0 .cse1 .cse2 .cse3 .cse5 (= ~IPC~0 ~s~0) .cse6) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-09 15:41:40,393 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-12-09 15:41:40,393 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)) (.cse7 (<= ~compRegistered~0 0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= ~MPR3~0 6)) (.cse11 (<= 6 ~MPR3~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 .cse1 .cse5 .cse9 .cse3 .cse4 .cse10 (= |old(~customIrp~0)| ~customIrp~0) .cse11 .cse7) (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 (and (and .cse8 .cse9 (and .cse12 .cse1 .cse2 .cse3 .cse4)) .cse10 .cse11) (not (= 259 main_~status~1))) (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-12-09 15:41:40,393 INFO L448 ceAbstractionStarter]: For program point L723(lines 709 748) no Hoare annotation was computed. [2018-12-09 15:41:40,393 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 669 808) no Hoare annotation was computed. [2018-12-09 15:41:40,393 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 736 746) no Hoare annotation was computed. [2018-12-09 15:41:40,394 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-12-09 15:41:40,394 INFO L448 ceAbstractionStarter]: For program point L707-1(lines 703 807) no Hoare annotation was computed. [2018-12-09 15:41:40,394 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 736 746) no Hoare annotation was computed. [2018-12-09 15:41:40,394 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-12-09 15:41:40,394 INFO L448 ceAbstractionStarter]: For program point L765(lines 749 804) no Hoare annotation was computed. [2018-12-09 15:41:40,394 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 747) no Hoare annotation was computed. [2018-12-09 15:41:40,394 INFO L448 ceAbstractionStarter]: For program point L782(lines 782 784) no Hoare annotation was computed. [2018-12-09 15:41:40,394 INFO L448 ceAbstractionStarter]: For program point L766(lines 766 801) no Hoare annotation was computed. [2018-12-09 15:41:40,395 INFO L444 ceAbstractionStarter]: At program point L733(lines 732 747) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 main_~status~1)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (<= ~MPR3~0 6)) (.cse10 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (<= ~MaximumInterfaceType~0 0)) (.cse12 (<= 6 ~MPR3~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(~MPR1~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0) .cse10 .cse11 .cse12) (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)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0) .cse9 .cse10 .cse11 .cse12) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-09 15:41:40,395 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2018-12-09 15:41:40,395 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 754) no Hoare annotation was computed. [2018-12-09 15:41:40,395 INFO L444 ceAbstractionStarter]: At program point L709(lines 703 807) the Hoare annotation is: (let ((.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse5 (= 0 main_~status~1)) (.cse6 (<= ~compRegistered~0 0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= ~DC~0 ~s~0)) (.cse1 (= 0 ~pended~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)) (.cse11 (<= ~MPR3~0 6)) (.cse12 (<= 6 ~MPR3~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 .cse3 .cse9 .cse10 .cse2 .cse4 .cse11 (= |old(~customIrp~0)| ~customIrp~0) .cse12 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (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)|)) (and (and (and .cse8 (and .cse7 .cse1 .cse3 .cse2 .cse4) .cse10) .cse11 .cse12) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-09 15:41:40,395 INFO L448 ceAbstractionStarter]: For program point L767(lines 767 800) no Hoare annotation was computed. [2018-12-09 15:41:40,395 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 721) no Hoare annotation was computed. [2018-12-09 15:41:40,396 INFO L444 ceAbstractionStarter]: At program point L718-2(lines 718 721) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 main_~status~1)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (<= ~MPR3~0 6)) (.cse10 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (<= ~MaximumInterfaceType~0 0)) (.cse12 (<= 6 ~MPR3~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(~MPR1~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0) .cse10 .cse11 .cse12) (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)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0) .cse9 .cse10 .cse11 .cse12) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-09 15:41:40,396 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 778) no Hoare annotation was computed. [2018-12-09 15:41:40,396 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-12-09 15:41:40,396 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 797) no Hoare annotation was computed. [2018-12-09 15:41:40,396 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 775) no Hoare annotation was computed. [2018-12-09 15:41:40,396 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 798) no Hoare annotation was computed. [2018-12-09 15:41:40,396 INFO L444 ceAbstractionStarter]: At program point L929(line 929) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (not (= ~setEventCalled~0 1)) (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2))))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1))) [2018-12-09 15:41:40,396 INFO L448 ceAbstractionStarter]: For program point L929-1(lines 921 934) no Hoare annotation was computed. [2018-12-09 15:41:40,397 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 921 934) the Hoare annotation is: (let ((.cse0 (= ~s~0 |old(~s~0)|)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (not (= ~setEventCalled~0 1)) (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2))) [2018-12-09 15:41:40,397 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 921 934) no Hoare annotation was computed. [2018-12-09 15:41:40,397 INFO L451 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: true [2018-12-09 15:41:40,397 INFO L448 ceAbstractionStarter]: For program point L609-1(line 609) no Hoare annotation was computed. [2018-12-09 15:41:40,397 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 604 613) the Hoare annotation is: true [2018-12-09 15:41:40,397 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 604 613) no Hoare annotation was computed. [2018-12-09 15:41:40,397 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 604 613) no Hoare annotation was computed. [2018-12-09 15:41:40,397 INFO L448 ceAbstractionStarter]: For program point L1057(lines 1057 1069) no Hoare annotation was computed. [2018-12-09 15:41:40,397 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1030 1071) no Hoare annotation was computed. [2018-12-09 15:41:40,397 INFO L444 ceAbstractionStarter]: At program point L1043(lines 1035 1054) the Hoare annotation is: (let ((.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse16 (not (= 0 ~pended~0))) (.cse17 (< ~compRegistered~0 1)) (.cse18 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~MPR3~0 |old(~s~0)|)) (.cse6 (or .cse13 .cse16 .cse17 .cse18)) (.cse7 (< ~MPR3~0 6)) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< |old(~s~0)| ~MPR3~0)) (.cse21 (= |old(~s~0)| ~s~0)) (.cse22 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse19 (< 0 (+ ~myStatus~0 1073741637))) (.cse11 (and .cse21 (= 1 ~setEventCalled~0) .cse22)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (not (= ~myStatus~0 0))) (.cse12 (< 0 ~MaximumInterfaceType~0)) (.cse20 (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10)) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse4 .cse12 (or .cse0 .cse2 .cse13 .cse14 .cse8 .cse7 .cse15 .cse3 .cse16 .cse17 .cse18 .cse9)) (or .cse19 .cse12 .cse20) (or .cse19 .cse12 .cse11 (or .cse0 .cse2 .cse13 .cse14 .cse8 .cse7 .cse15 .cse3 .cse16 .cse17 .cse18)) (or .cse4 .cse12 .cse20) (or .cse1 .cse2 .cse13 (and .cse21 .cse22) .cse8 .cse7 .cse15 .cse3 (not (= ~compRegistered~0 0)) .cse18 .cse9))))) [2018-12-09 15:41:40,398 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1061 1068) no Hoare annotation was computed. [2018-12-09 15:41:40,398 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1061 1068) no Hoare annotation was computed. [2018-12-09 15:41:40,398 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1054) no Hoare annotation was computed. [2018-12-09 15:41:40,398 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1069) the Hoare annotation is: (let ((.cse26 (+ ~DC~0 5)) (.cse29 (+ ~DC~0 2)) (.cse27 (= 0 ~pended~0)) (.cse28 (+ ~NP~0 5))) (let ((.cse2 (< ~MPR3~0 .cse28)) (.cse23 (not .cse27)) (.cse24 (< ~compRegistered~0 1)) (.cse3 (< ~SKIP2~0 .cse29)) (.cse9 (< ~IPC~0 .cse26)) (.cse5 (= |old(~s~0)| ~s~0)) (.cse25 (+ ~SKIP1~0 2))) (let ((.cse20 (and (<= .cse26 ~IPC~0) .cse27 .cse5 (<= .cse25 ~MPR1~0) (<= 1 ~compRegistered~0) (<= .cse28 ~MPR3~0) (<= .cse29 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (= 1 ~setEventCalled~0) (<= (+ ~s~0 2) ~SKIP1~0) (<= 6 ~MPR3~0))) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse15 (not (= |old(~setEventCalled~0)| 1))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse8 (< ~MPR1~0 .cse25)) (.cse17 (< ~MPR3~0 |old(~s~0)|)) (.cse18 (or .cse2 .cse23 .cse24 .cse3 .cse9)) (.cse4 (< ~MPR3~0 6)) (.cse19 (< |old(~s~0)| ~MPR3~0))) (let ((.cse14 (or .cse15 .cse0 .cse1 .cse8 .cse17 .cse18 .cse4 .cse19)) (.cse13 (and (= ~s~0 ~NP~0) .cse6)) (.cse11 (< 0 (+ ~myStatus~0 1073741637))) (.cse21 (and .cse20 .cse6)) (.cse16 (not (= ~myStatus~0 0))) (.cse12 (< 0 ~MaximumInterfaceType~0)) (.cse22 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse10 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6) .cse7 .cse8 (not (= ~compRegistered~0 0)) .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse0 .cse1 .cse13 .cse16 .cse4 .cse8 .cse17 .cse18 .cse10 .cse19) (or .cse16 .cse12 .cse14 .cse13) (or (or (and (= |old(~customIrp~0)| 1) .cse20 (= 0 ~customIrp~0)) .cse21) .cse11 .cse12 (or .cse15 .cse1 .cse2 .cse22 .cse3 .cse4 .cse7 .cse8 .cse23 .cse24 .cse9)) (or .cse21 .cse16 .cse12 (or .cse15 .cse1 .cse2 .cse22 .cse3 .cse4 .cse7 .cse8 .cse23 .cse24 .cse9 .cse10))))))) [2018-12-09 15:41:40,398 INFO L444 ceAbstractionStarter]: At program point L1058(lines 1057 1069) the Hoare annotation is: (let ((.cse26 (+ ~DC~0 5)) (.cse29 (+ ~DC~0 2)) (.cse27 (= 0 ~pended~0)) (.cse28 (+ ~NP~0 5))) (let ((.cse2 (< ~MPR3~0 .cse28)) (.cse23 (not .cse27)) (.cse24 (< ~compRegistered~0 1)) (.cse3 (< ~SKIP2~0 .cse29)) (.cse9 (< ~IPC~0 .cse26)) (.cse5 (= |old(~s~0)| ~s~0)) (.cse25 (+ ~SKIP1~0 2))) (let ((.cse20 (and (<= .cse26 ~IPC~0) .cse27 .cse5 (<= .cse25 ~MPR1~0) (<= 1 ~compRegistered~0) (<= .cse28 ~MPR3~0) (<= .cse29 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (= 1 ~setEventCalled~0) (<= (+ ~s~0 2) ~SKIP1~0) (<= 6 ~MPR3~0))) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse15 (not (= |old(~setEventCalled~0)| 1))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse8 (< ~MPR1~0 .cse25)) (.cse17 (< ~MPR3~0 |old(~s~0)|)) (.cse18 (or .cse2 .cse23 .cse24 .cse3 .cse9)) (.cse4 (< ~MPR3~0 6)) (.cse19 (< |old(~s~0)| ~MPR3~0))) (let ((.cse14 (or .cse15 .cse0 .cse1 .cse8 .cse17 .cse18 .cse4 .cse19)) (.cse13 (and (= ~s~0 ~NP~0) .cse6)) (.cse11 (< 0 (+ ~myStatus~0 1073741637))) (.cse21 (and .cse20 .cse6)) (.cse16 (not (= ~myStatus~0 0))) (.cse12 (< 0 ~MaximumInterfaceType~0)) (.cse22 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse10 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6) .cse7 .cse8 (not (= ~compRegistered~0 0)) .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse0 .cse1 .cse13 .cse16 .cse4 .cse8 .cse17 .cse18 .cse10 .cse19) (or .cse16 .cse12 .cse14 .cse13) (or (or (and (= |old(~customIrp~0)| 1) .cse20 (= 0 ~customIrp~0)) .cse21) .cse11 .cse12 (or .cse15 .cse1 .cse2 .cse22 .cse3 .cse4 .cse7 .cse8 .cse23 .cse24 .cse9)) (or .cse21 .cse16 .cse12 (or .cse15 .cse1 .cse2 .cse22 .cse3 .cse4 .cse7 .cse8 .cse23 .cse24 .cse9 .cse10))))))) [2018-12-09 15:41:40,398 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1030 1071) no Hoare annotation was computed. [2018-12-09 15:41:40,399 INFO L444 ceAbstractionStarter]: At program point L1050(line 1050) the Hoare annotation is: (let ((.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse18 (not (= 0 ~pended~0))) (.cse19 (< ~compRegistered~0 1)) (.cse13 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~MPR3~0 |old(~s~0)|)) (.cse6 (or .cse11 .cse18 .cse19 .cse13)) (.cse7 (< ~MPR3~0 6)) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< |old(~s~0)| ~MPR3~0))) (let ((.cse9 (not (= |old(~customIrp~0)| 0))) (.cse14 (< 0 (+ ~myStatus~0 1073741637))) (.cse17 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (= ~myStatus~0 0))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse16 (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse11 .cse8 .cse7 .cse12 .cse3 (not (= ~compRegistered~0 0)) .cse13 .cse9) (or .cse14 .cse15 .cse16) (or .cse4 .cse15 (or .cse0 .cse2 .cse11 .cse17 .cse8 .cse7 .cse12 .cse3 .cse18 .cse19 .cse13 .cse9)) (or .cse14 .cse15 (or .cse0 .cse2 .cse11 .cse17 .cse8 .cse7 .cse12 .cse3 .cse18 .cse19 .cse13)) (or .cse4 .cse15 .cse16))))) [2018-12-09 15:41:40,399 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2018-12-09 15:41:40,399 INFO L448 ceAbstractionStarter]: For program point L1048-1(lines 1035 1054) no Hoare annotation was computed. [2018-12-09 15:41:40,399 INFO L448 ceAbstractionStarter]: For program point L1036(lines 1036 1041) no Hoare annotation was computed. [2018-12-09 15:41:40,399 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1030 1071) the Hoare annotation is: (let ((.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse10 (not (= 0 ~pended~0))) (.cse11 (< ~compRegistered~0 1)) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse18 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< 6 ~MPR3~0)) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse19 (< ~MPR3~0 |old(~s~0)|)) (.cse20 (or .cse4 .cse10 .cse11 .cse6 .cse12)) (.cse7 (< ~MPR3~0 6)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse22 (= ~s~0 |old(~s~0)|)) (.cse24 (= 1 ~setEventCalled~0)) (.cse23 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse14 (and .cse22 .cse24 .cse23)) (.cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse0 (not (= ~myStatus~0 0))) (.cse15 (< 0 (+ ~myStatus~0 1073741637))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse17 (or .cse2 .cse18 .cse3 .cse9 .cse19 .cse20 .cse7 .cse21)) (.cse16 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse24 .cse23)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse13 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse14 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (or .cse0 .cse16 .cse1 .cse17) (or .cse2 .cse18 .cse3 .cse0 .cse7 .cse9 .cse19 .cse20 .cse16 .cse13 .cse21) (or .cse15 .cse1 .cse17 .cse16) (or .cse18 .cse3 .cse4 .cse6 .cse7 (and .cse22 .cse23) .cse8 .cse9 (not (= ~compRegistered~0 0)) .cse12 .cse13))))) [2018-12-09 15:41:40,399 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1008 1021) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (= 0 ~pended~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |old(~s~0)| ~s~0)) (or .cse1 (= ~s~0 ~NP~0) (or .cse2 .cse4 .cse7) .cse5 .cse6) (or (or (< 6 ~MPR3~0) (or .cse0 .cse1 (or .cse2 .cse7) .cse3 (< ~compRegistered~0 1) .cse6) (< ~MPR3~0 6) .cse5) (= ~s~0 |old(~s~0)|)))) [2018-12-09 15:41:40,400 INFO L444 ceAbstractionStarter]: At program point L1016(line 1016) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (< 6 ~MPR3~0) (or .cse0 .cse1 (or .cse2 .cse3) .cse4 (< ~compRegistered~0 1) .cse5) (< ~MPR3~0 6) .cse6) (or .cse1 (or .cse2 .cse7 .cse3) .cse6 .cse5) (or .cse0 .cse1 .cse2 .cse4 .cse7 .cse6 .cse5))) [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point L1016-1(lines 1008 1021) no Hoare annotation was computed. [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1008 1021) no Hoare annotation was computed. [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1018) no Hoare annotation was computed. [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point L514-2(lines 514 519) no Hoare annotation was computed. [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point L564(lines 564 566) no Hoare annotation was computed. [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 504) no Hoare annotation was computed. [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 493 505) no Hoare annotation was computed. [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 436 603) no Hoare annotation was computed. [2018-12-09 15:41:40,400 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 436 603) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3) .cse4) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and .cse1 (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3) .cse4))) [2018-12-09 15:41:40,400 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 572) no Hoare annotation was computed. [2018-12-09 15:41:40,401 INFO L444 ceAbstractionStarter]: At program point L516(line 516) the Hoare annotation is: (let ((.cse9 (< 0 ~MaximumInterfaceType~0)) (.cse7 (<= ~MPR3~0 ~s~0)) (.cse8 (<= ~s~0 ~MPR3~0)) (.cse10 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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)))) (.cse0 (= |old(~s~0)| ~s~0)) (.cse2 (<= 1 ~compRegistered~0)) (.cse3 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse4 (= 1 ~setEventCalled~0)) (.cse5 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0))) (and (let ((.cse1 (= |old(~myStatus~0)| ~myStatus~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) .cse9 .cse10)) (let ((.cse11 (= 0 ~myStatus~0))) (or (not (= |old(~myStatus~0)| 0)) .cse9 (and .cse2 .cse7 .cse8 .cse3 .cse11 .cse4 .cse5 .cse6) .cse10 (and .cse0 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6))))) [2018-12-09 15:41:40,401 INFO L448 ceAbstractionStarter]: For program point L516-1(line 516) no Hoare annotation was computed. [2018-12-09 15:41:40,401 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 581) no Hoare annotation was computed. [2018-12-09 15:41:40,401 INFO L444 ceAbstractionStarter]: At program point L574-2(lines 574 581) the Hoare annotation is: (let ((.cse6 (= 0 ~pended~0)) (.cse7 (+ ~DC~0 5)) (.cse3 (+ ~NP~0 5)) (.cse4 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (and .cse6 (<= .cse7 ~IPC~0) (<= .cse3 ~MPR3~0) (<= .cse4 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 .cse3) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not .cse6) (< ~IPC~0 .cse7) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse2 .cse1)))) [2018-12-09 15:41:40,403 INFO L444 ceAbstractionStarter]: At program point L599(line 599) the Hoare annotation is: (let ((.cse5 (+ ~NP~0 5)) (.cse6 (+ ~DC~0 2)) (.cse7 (+ ~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) (< ~MPR3~0 .cse5) (< ~SKIP2~0 .cse6) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse7) (not (= |old(~compRegistered~0)| 0)) (not .cse3) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (and (and .cse3 (<= .cse4 ~IPC~0) (<= .cse5 ~MPR3~0) (<= .cse6 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse7 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2018-12-09 15:41:40,403 INFO L448 ceAbstractionStarter]: For program point L599-1(line 599) no Hoare annotation was computed. [2018-12-09 15:41:40,403 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 543) no Hoare annotation was computed. [2018-12-09 15:41:40,403 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-09 15:41:40,403 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2018-12-09 15:41:40,403 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 505) no Hoare annotation was computed. [2018-12-09 15:41:40,404 INFO L444 ceAbstractionStarter]: At program point L510(line 510) the Hoare annotation is: (let ((.cse0 (= ~s~0 |old(~s~0)|)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse3 (< 0 ~MaximumInterfaceType~0)) (.cse4 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (and .cse0 (= |old(~myStatus~0)| ~myStatus~0) .cse1 .cse2) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse3 .cse4) (or (and .cse0 .cse1 (= 0 ~myStatus~0) .cse2) (not (= |old(~myStatus~0)| 0)) .cse3 .cse4))) [2018-12-09 15:41:40,404 INFO L448 ceAbstractionStarter]: For program point L510-1(line 510) no Hoare annotation was computed. [2018-12-09 15:41:40,404 INFO L444 ceAbstractionStarter]: At program point L535(line 535) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-09 15:41:40,410 INFO L448 ceAbstractionStarter]: For program point L535-1(line 535) no Hoare annotation was computed. [2018-12-09 15:41:40,410 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-09 15:41:40,410 INFO L448 ceAbstractionStarter]: For program point L560-1(lines 560 562) no Hoare annotation was computed. [2018-12-09 15:41:40,410 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 436 603) no Hoare annotation was computed. [2018-12-09 15:41:40,410 INFO L444 ceAbstractionStarter]: At program point L552-2(lines 552 568) the Hoare annotation is: (let ((.cse0 (and (and (and (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))) (<= 0 FloppyStartDevice_~InterfaceType~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-09 15:41:40,411 INFO L444 ceAbstractionStarter]: At program point L569(lines 530 595) the Hoare annotation is: (let ((.cse6 (= 0 ~pended~0)) (.cse7 (+ ~DC~0 5)) (.cse3 (+ ~NP~0 5)) (.cse4 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (and .cse6 (<= .cse7 ~IPC~0) (<= .cse3 ~MPR3~0) (<= .cse4 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 .cse3) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not .cse6) (< ~IPC~0 .cse7) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse2 .cse1)))) [2018-12-09 15:41:40,411 INFO L444 ceAbstractionStarter]: At program point L528(line 528) the Hoare annotation is: (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse0 (and (let ((.cse3 (and (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0))) (.cse4 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse3 (<= FloppyStartDevice_~__cil_tmp42~0 259) (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse4) (and (and .cse3 (= 1 ~setEventCalled~0)) .cse4))) (= |old(~myStatus~0)| ~myStatus~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse1 .cse0 .cse2))) [2018-12-09 15:41:40,416 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) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L528-1(line 528) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L553(lines 552 568) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L586-2(lines 586 591) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L444 ceAbstractionStarter]: At program point L545(lines 532 572) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)) (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 540) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 546 549) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 595) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 595) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L444 ceAbstractionStarter]: At program point L588(lines 588 589) the Hoare annotation is: (let ((.cse0 (and (and (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 588 589) no Hoare annotation was computed. [2018-12-09 15:41:40,416 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 519) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L451 ceAbstractionStarter]: At program point L1104(lines 1103 1113) the Hoare annotation is: true [2018-12-09 15:41:40,421 INFO L451 ceAbstractionStarter]: At program point L1102(lines 1101 1113) the Hoare annotation is: true [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1094 1115) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point L1101(lines 1101 1113) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1105 1112) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1094 1115) the Hoare annotation is: true [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1105 1112) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1094 1115) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1072 1093) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1072 1093) the Hoare annotation is: true [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1072 1093) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L451 ceAbstractionStarter]: At program point L1082(lines 1081 1091) the Hoare annotation is: true [2018-12-09 15:41:40,421 INFO L451 ceAbstractionStarter]: At program point L1080(lines 1079 1091) the Hoare annotation is: true [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point L1079(lines 1079 1091) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1083 1090) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1083 1090) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 809 833) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 809 833) no Hoare annotation was computed. [2018-12-09 15:41:40,421 INFO L451 ceAbstractionStarter]: At program point L822(lines 821 831) the Hoare annotation is: true [2018-12-09 15:41:40,422 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 823 830) no Hoare annotation was computed. [2018-12-09 15:41:40,422 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 809 833) the Hoare annotation is: (let ((.cse5 (+ ~NP~0 5)) (.cse3 (= 0 ~pended~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5)) (.cse7 (+ ~DC~0 2))) (let ((.cse1 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 .cse5) (or (not (= ~s~0 ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse6) (< ~compRegistered~0 1) (< ~IPC~0 .cse4)) (< ~MPR3~0 6) (< ~SKIP2~0 .cse7) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse0 (and (and .cse3 (<= .cse4 ~IPC~0) (<= .cse5 ~MPR3~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse7 ~SKIP2~0) (<= ~MPR3~0 6) (= 0 ~customIrp~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse1 (not (= ~myStatus~0 0)) .cse2 .cse0)))) [2018-12-09 15:41:40,422 INFO L451 ceAbstractionStarter]: At program point L820(lines 819 831) the Hoare annotation is: true [2018-12-09 15:41:40,423 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 831) no Hoare annotation was computed. [2018-12-09 15:41:40,423 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 823 830) no Hoare annotation was computed. [2018-12-09 15:41:40,423 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1022 1029) the Hoare annotation is: true [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1022 1029) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1022 1029) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 656 668) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 656 668) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2))) [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 656 668) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 64) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 60 67) the Hoare annotation is: true [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 60 67) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 60 67) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 1003) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L448 ceAbstractionStarter]: For program point L949(lines 949 953) no Hoare annotation was computed. [2018-12-09 15:41:40,424 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 935 1007) the Hoare annotation is: (let ((.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (not (= 0 ~pended~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse4 (< 6 ~MPR3~0)) (.cse5 (or (or .cse8 .cse9 (or (not (= |old(~s~0)| ~NP~0)) .cse15) .cse12 (< ~compRegistered~0 1) .cse14) .cse11)) (.cse6 (< ~MPR3~0 6))) (let ((.cse0 (not (= ~myStatus~0 0))) (.cse7 (not (= ~customIrp~0 0))) (.cse10 (= ~s~0 ~SKIP1~0)) (.cse13 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or .cse4 .cse5 .cse6))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse0 .cse1 .cse6 .cse7) (or .cse8 .cse4 .cse9 .cse10 .cse11 .cse6 (< ~SKIP1~0 |old(~s~0)|) .cse12 (< |old(~s~0)| ~SKIP1~0) .cse13 .cse14 .cse7) (or .cse8 .cse9 .cse12 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse14 (or .cse13 .cse15)) (or (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3))))) [2018-12-09 15:41:40,424 INFO L444 ceAbstractionStarter]: At program point L978(lines 942 1006) the Hoare annotation is: (let ((.cse37 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse32 (+ ~DC~0 2)) (.cse35 (+ ~DC~0 5)) (.cse34 (+ ~SKIP1~0 2)) (.cse26 (= 0 ~pended~0)) (.cse33 (+ ~NP~0 5)) (.cse36 (+ ~NP~0 2))) (let ((.cse5 (< ~SKIP1~0 .cse36)) (.cse7 (< ~MPR3~0 .cse33)) (.cse16 (not .cse26)) (.cse11 (< ~MPR1~0 .cse34)) (.cse14 (< ~IPC~0 .cse35)) (.cse8 (< ~SKIP2~0 .cse32)) (.cse20 (= ~MPR1~0 ~s~0)) (.cse21 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse37) 3221225494))) (.cse22 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse23 (<= (+ .cse37 1) 0))) (let ((.cse18 (let ((.cse24 (<= .cse36 ~SKIP1~0)) (.cse25 (<= .cse35 ~IPC~0)) (.cse27 (<= .cse34 ~MPR1~0)) (.cse28 (<= 1 ~compRegistered~0)) (.cse29 (<= .cse33 ~MPR3~0)) (.cse30 (<= .cse32 ~SKIP2~0)) (.cse31 (= ~NP~0 |old(~s~0)|))) (or (and .cse24 .cse25 .cse26 .cse27 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse28 .cse29 .cse20 .cse30 .cse21 .cse22 .cse23 .cse31) (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse20 .cse30 .cse21 (= 0 IofCallDriver_~returnVal2~0) .cse22 .cse23 .cse31)))) (.cse19 (= 1 ~setEventCalled~0)) (.cse6 (< 6 ~MPR3~0)) (.cse17 (or (or .cse5 .cse7 (or (not (= |old(~s~0)| ~NP~0)) .cse16) .cse11 (< ~compRegistered~0 1) .cse14) .cse8)) (.cse9 (< ~MPR3~0 6))) (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse6 .cse17 .cse9)) (.cse3 (and (and .cse18 (<= ~MPR3~0 6) .cse19 (<= 6 ~MPR3~0)) (<= ~MaximumInterfaceType~0 0))) (.cse10 (< ~SKIP1~0 |old(~s~0)|)) (.cse12 (< |old(~s~0)| ~SKIP1~0)) (.cse13 (not (= ~compRegistered~0 0))) (.cse0 (and .cse20 .cse21 .cse22 .cse23 .cse19 (= IofCallDriver_~returnVal2~0 259))) (.cse4 (not (= ~myStatus~0 0))) (.cse15 (not (= ~customIrp~0 0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse1 .cse2 .cse3 .cse0) (or .cse5 .cse6 .cse7 (= ~s~0 ~SKIP1~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse5 .cse7 (= |old(~s~0)| ~s~0) .cse8 .cse10 .cse11 .cse12 .cse14 (or .cse13 .cse16)) (or .cse6 .cse17 .cse0 .cse4 .cse9 (and .cse18 .cse19) .cse15)))))) [2018-12-09 15:41:40,428 INFO L444 ceAbstractionStarter]: At program point L945(line 945) the Hoare annotation is: (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse10 (not (= 0 ~pended~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse11 (< 6 ~MPR3~0)) (.cse12 (or (or .cse4 .cse5 (or (not (= |old(~s~0)| ~NP~0)) .cse10) .cse6 (< ~compRegistered~0 1) .cse8) .cse7)) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (not (= ~myStatus~0 0))) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or .cse11 .cse12 .cse13)) (.cse9 (not (= ~compRegistered~0 0))) (.cse14 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7 .cse8 (or .cse9 .cse10)) (or .cse11 .cse12 .cse0 .cse1 .cse13 .cse14) (or (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3) (or .cse4 .cse11 .cse5 .cse7 .cse13 (< ~SKIP1~0 |old(~s~0)|) .cse6 (< |old(~s~0)| ~SKIP1~0) .cse9 .cse8 .cse14))))) [2018-12-09 15:41:40,428 INFO L448 ceAbstractionStarter]: For program point L945-1(line 945) no Hoare annotation was computed. [2018-12-09 15:41:40,428 INFO L444 ceAbstractionStarter]: At program point L966(lines 965 980) the Hoare annotation is: (let ((.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (not (= 0 ~pended~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse3 (< 6 ~MPR3~0)) (.cse4 (or (or .cse8 .cse9 (or (not (= |old(~s~0)| ~NP~0)) .cse15) .cse12 (< ~compRegistered~0 1) .cse14) .cse11)) (.cse6 (< ~MPR3~0 6))) (let ((.cse0 (let ((.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse16 1) 0) (= 1 ~setEventCalled~0)))) (.cse5 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse3 .cse4 .cse6)) (.cse7 (not (= ~customIrp~0 0))) (.cse10 (= ~s~0 ~SKIP1~0)) (.cse13 (not (= ~compRegistered~0 0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (or .cse0 .cse5 .cse1 .cse2) (or .cse8 .cse3 .cse9 .cse10 .cse11 .cse6 (< ~SKIP1~0 |old(~s~0)|) .cse12 (< |old(~s~0)| ~SKIP1~0) .cse13 .cse14 .cse7) (or .cse8 .cse9 .cse12 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse14 (or .cse13 .cse15)))))) [2018-12-09 15:41:40,433 INFO L448 ceAbstractionStarter]: For program point L995(lines 995 1002) no Hoare annotation was computed. [2018-12-09 15:41:40,433 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 935 1007) no Hoare annotation was computed. [2018-12-09 15:41:40,433 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 981) no Hoare annotation was computed. [2018-12-09 15:41:40,433 INFO L448 ceAbstractionStarter]: For program point L987(lines 987 993) no Hoare annotation was computed. [2018-12-09 15:41:40,434 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 935 1007) no Hoare annotation was computed. [2018-12-09 15:41:40,434 INFO L444 ceAbstractionStarter]: At program point L1000(line 1000) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= 0 ~pended~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~DC~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse9 (< 6 ~MPR3~0)) (.cse10 (or (or .cse0 .cse1 (or (not (= |old(~s~0)| ~NP~0)) .cse6) .cse2 (< ~compRegistered~0 1) .cse4) .cse3)) (.cse12 (< ~MPR3~0 6))) (let ((.cse11 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse9 .cse10 .cse12)) (.cse5 (not (= ~compRegistered~0 0))) (.cse13 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3 .cse4 (or .cse5 .cse6)) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse11 .cse7 .cse8) (or .cse0 .cse9 .cse1 .cse3 .cse12 (< ~SKIP1~0 |old(~s~0)|) .cse2 (< |old(~s~0)| ~SKIP1~0) .cse5 .cse4 .cse13))))) [2018-12-09 15:41:40,434 INFO L448 ceAbstractionStarter]: For program point L1000-1(lines 982 1004) no Hoare annotation was computed. [2018-12-09 15:41:40,434 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 980) no Hoare annotation was computed. [2018-12-09 15:41:40,434 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 967 979) no Hoare annotation was computed. [2018-12-09 15:41:40,434 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 967 979) no Hoare annotation was computed. [2018-12-09 15:41:40,434 INFO L444 ceAbstractionStarter]: At program point L959(lines 958 981) the Hoare annotation is: (let ((.cse26 (+ ~DC~0 2)) (.cse22 (+ ~DC~0 5)) (.cse24 (+ ~SKIP1~0 2)) (.cse23 (= 0 ~pended~0)) (.cse25 (+ ~NP~0 5)) (.cse21 (+ ~NP~0 2))) (let ((.cse10 (< ~SKIP1~0 .cse21)) (.cse11 (< ~MPR3~0 .cse25)) (.cse17 (not .cse23)) (.cse14 (< ~MPR1~0 .cse24)) (.cse16 (< ~IPC~0 .cse22)) (.cse13 (< ~SKIP2~0 .cse26)) (.cse27 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse2 (= ~MPR1~0 ~s~0)) (.cse3 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse27) 3221225494))) (.cse4 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse5 (<= (+ .cse27 1) 0)) (.cse6 (= 1 ~setEventCalled~0)) (.cse0 (< 6 ~MPR3~0)) (.cse1 (or (or .cse10 .cse11 (or (not (= |old(~s~0)| ~NP~0)) .cse17) .cse14 (< ~compRegistered~0 1) .cse16) .cse13)) (.cse8 (< ~MPR3~0 6))) (let ((.cse9 (not (= ~customIrp~0 0))) (.cse12 (= ~s~0 ~SKIP1~0)) (.cse15 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~myStatus~0 0))) (.cse18 (< 0 ~MaximumInterfaceType~0)) (.cse19 (or .cse0 .cse1 .cse8)) (.cse20 (and (<= .cse21 ~SKIP1~0) (<= .cse22 ~IPC~0) .cse23 (<= .cse24 ~MPR1~0) (<= 1 ~compRegistered~0) (<= .cse25 ~MPR3~0) .cse2 (<= .cse26 ~SKIP2~0) .cse3 .cse4 .cse5 (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) .cse6 (<= ~MaximumInterfaceType~0 0) (<= 6 ~MPR3~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse12 .cse13 .cse8 (< ~SKIP1~0 |old(~s~0)|) .cse14 (< |old(~s~0)| ~SKIP1~0) .cse15 .cse16 .cse9) (or .cse10 .cse11 .cse14 .cse12 (not (= ~SKIP1~0 |old(~s~0)|)) .cse13 .cse16 (or .cse15 .cse17)) (or (< 0 (+ ~myStatus~0 1073741637)) .cse18 .cse19 .cse20) (or .cse7 .cse18 .cse19 .cse20)))))) [2018-12-09 15:41:40,438 INFO L444 ceAbstractionStarter]: At program point L951(line 951) the Hoare annotation is: (let ((.cse19 (+ ~DC~0 2)) (.cse16 (+ ~DC~0 5)) (.cse17 (+ ~SKIP1~0 2)) (.cse15 (= 0 ~pended~0)) (.cse18 (+ ~NP~0 5))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 .cse18)) (.cse6 (not .cse15)) (.cse2 (< ~MPR1~0 .cse17)) (.cse4 (< ~IPC~0 .cse16)) (.cse3 (< ~SKIP2~0 .cse19))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse0 .cse1 (or (not (= |old(~s~0)| ~NP~0)) .cse6) .cse2 (< ~compRegistered~0 1) .cse4) .cse3)) (.cse13 (< ~MPR3~0 6))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse8 (< 0 ~MaximumInterfaceType~0)) (.cse9 (or .cse10 .cse11 .cse13)) (.cse7 (and (= 1 ~setEventCalled~0) (let ((.cse20 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse15 (<= .cse16 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse17 ~MPR1~0) (<= 1 ~compRegistered~0) (<= .cse18 ~MPR3~0) (<= .cse19 ~SKIP2~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse20 1) 0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0))))) (.cse5 (not (= ~compRegistered~0 0))) (.cse14 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3 .cse4 (or .cse5 .cse6)) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse7 .cse12 .cse13 .cse14) (or .cse12 .cse8 .cse9 .cse7) (or .cse0 .cse10 .cse1 .cse3 .cse13 (< ~SKIP1~0 |old(~s~0)|) .cse2 (< |old(~s~0)| ~SKIP1~0) .cse5 .cse4 .cse14)))))) [2018-12-09 15:41:40,438 INFO L448 ceAbstractionStarter]: For program point L943(lines 943 955) no Hoare annotation was computed. [2018-12-09 15:41:40,438 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 943 955) no Hoare annotation was computed. [2018-12-09 15:41:40,438 INFO L444 ceAbstractionStarter]: At program point L964(lines 963 980) the Hoare annotation is: (let ((.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (not (= 0 ~pended~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse3 (< 6 ~MPR3~0)) (.cse4 (or (or .cse8 .cse9 (or (not (= |old(~s~0)| ~NP~0)) .cse15) .cse12 (< ~compRegistered~0 1) .cse14) .cse11)) (.cse6 (< ~MPR3~0 6))) (let ((.cse0 (let ((.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse16 1) 0) (= 1 ~setEventCalled~0)))) (.cse5 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse3 .cse4 .cse6)) (.cse7 (not (= ~customIrp~0 0))) (.cse10 (= ~s~0 ~SKIP1~0)) (.cse13 (not (= ~compRegistered~0 0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse0 .cse5 .cse6 .cse7) (or .cse0 .cse5 .cse1 .cse2) (or .cse8 .cse3 .cse9 .cse10 .cse11 .cse6 (< ~SKIP1~0 |old(~s~0)|) .cse12 (< |old(~s~0)| ~SKIP1~0) .cse13 .cse14 .cse7) (or .cse8 .cse9 .cse12 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse14 (or .cse13 .cse15)))))) [2018-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 150) no Hoare annotation was computed. [2018-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 112 160) no Hoare annotation was computed. [2018-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 99 161) no Hoare annotation was computed. [2018-12-09 15:41:40,440 INFO L444 ceAbstractionStarter]: At program point L143(line 143) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (= 0 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point L143-1(line 143) no Hoare annotation was computed. [2018-12-09 15:41:40,440 INFO L444 ceAbstractionStarter]: At program point L141(lines 141 142) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (= 0 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 141 142) no Hoare annotation was computed. [2018-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 138) no Hoare annotation was computed. [2018-12-09 15:41:40,440 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 99 161) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (= 0 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 128) no Hoare annotation was computed. [2018-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 99 161) no Hoare annotation was computed. [2018-12-09 15:41:40,440 INFO L444 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,440 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 125) no Hoare annotation was computed. [2018-12-09 15:41:40,443 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 152 158) no Hoare annotation was computed. [2018-12-09 15:41:40,443 INFO L444 ceAbstractionStarter]: At program point L123-2(lines 123 125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (= 0 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (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-12-09 15:41:40,443 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-12-09 15:41:40,443 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 118) no Hoare annotation was computed. [2018-12-09 15:41:40,443 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 136) no Hoare annotation was computed. [2018-12-09 15:41:40,443 INFO L448 ceAbstractionStarter]: For program point L134-2(lines 134 136) no Hoare annotation was computed. [2018-12-09 15:41:40,444 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 15:41:40,444 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-12-09 15:41:40,444 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:41:40,444 INFO L444 ceAbstractionStarter]: At program point L641(line 641) the Hoare annotation is: (let ((.cse1 (= 1 ~setEventCalled~0)) (.cse2 (= 259 FlFdcDeviceIo_~__cil_tmp11~0))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~customIrp~0)| 0)))) (.cse3 (< 0 ~MaximumInterfaceType~0)) (.cse4 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse1 .cse2))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) (and (= |old(~s~0)| ~s~0) .cse1 .cse2) .cse3 .cse4) (or .cse0 (not (= ~myStatus~0 0)) .cse3 .cse4)))) [2018-12-09 15:41:40,444 INFO L448 ceAbstractionStarter]: For program point L641-1(line 641) no Hoare annotation was computed. [2018-12-09 15:41:40,444 INFO L448 ceAbstractionStarter]: For program point L639(lines 639 644) no Hoare annotation was computed. [2018-12-09 15:41:40,444 INFO L448 ceAbstractionStarter]: For program point L639-2(lines 639 644) no Hoare annotation was computed. [2018-12-09 15:41:40,444 INFO L444 ceAbstractionStarter]: At program point L635(line 635) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse2 (not (= ~myStatus~0 0)) .cse1))) [2018-12-09 15:41:40,444 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 614 648) the Hoare annotation is: (let ((.cse5 (+ ~NP~0 5)) (.cse3 (= 0 ~pended~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5)) (.cse7 (+ ~DC~0 2))) (let ((.cse1 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 .cse5) (or (not (= |old(~s~0)| ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse6) (< ~compRegistered~0 1) (< ~IPC~0 .cse4)) (< ~MPR3~0 6) (< ~SKIP2~0 .cse7) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse0 (and (and .cse3 (<= .cse4 ~IPC~0) (<= .cse5 ~MPR3~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse7 ~SKIP2~0) (= ~s~0 |old(~s~0)|) (<= ~MPR3~0 6) (= 0 ~customIrp~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse1 (not (= ~myStatus~0 0)) .cse2 .cse0)))) [2018-12-09 15:41:40,448 INFO L448 ceAbstractionStarter]: For program point L635-1(line 635) no Hoare annotation was computed. [2018-12-09 15:41:40,448 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 614 648) no Hoare annotation was computed. [2018-12-09 15:41:40,448 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 631) no Hoare annotation was computed. [2018-12-09 15:41:40,448 INFO L444 ceAbstractionStarter]: At program point L626(lines 626 627) the Hoare annotation is: (let ((.cse5 (+ ~NP~0 5)) (.cse3 (= 0 ~pended~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5)) (.cse7 (+ ~DC~0 2))) (let ((.cse1 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 .cse5) (or (not (= |old(~s~0)| ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse6) (< ~compRegistered~0 1) (< ~IPC~0 .cse4)) (< ~MPR3~0 6) (< ~SKIP2~0 .cse7) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse0 (and (and .cse3 (<= .cse4 ~IPC~0) (<= .cse5 ~MPR3~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse7 ~SKIP2~0) (= ~s~0 |old(~s~0)|) (<= ~MPR3~0 6) (= 0 ~customIrp~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse1 (not (= ~myStatus~0 0)) .cse2 .cse0)))) [2018-12-09 15:41:40,448 INFO L448 ceAbstractionStarter]: For program point L626-1(lines 626 627) no Hoare annotation was computed. [2018-12-09 15:41:40,448 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 614 648) no Hoare annotation was computed. [2018-12-09 15:41:40,448 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 92 98) no Hoare annotation was computed. [2018-12-09 15:41:40,448 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 92 98) the Hoare annotation is: true [2018-12-09 15:41:40,448 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 92 98) no Hoare annotation was computed. [2018-12-09 15:41:40,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:41:40,448 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-12-09 15:41:40,448 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 15:41:40,449 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 15:41:40,449 INFO L451 ceAbstractionStarter]: At program point L864(lines 863 875) the Hoare annotation is: true [2018-12-09 15:41:40,449 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 875) no Hoare annotation was computed. [2018-12-09 15:41:40,449 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 855 877) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 867 874) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 855 877) the Hoare annotation is: true [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 855 877) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L451 ceAbstractionStarter]: At program point L866(lines 865 875) the Hoare annotation is: true [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 867 874) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 834 854) the Hoare annotation is: true [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 834 854) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L451 ceAbstractionStarter]: At program point L843(lines 842 852) the Hoare annotation is: true [2018-12-09 15:41:40,455 INFO L451 ceAbstractionStarter]: At program point L841(lines 840 852) the Hoare annotation is: true [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 852) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 834 854) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 844 851) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 844 851) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1116 1136) the Hoare annotation is: true [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1116 1136) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L451 ceAbstractionStarter]: At program point L1125(lines 1124 1134) the Hoare annotation is: true [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1126 1133) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L451 ceAbstractionStarter]: At program point L1123(lines 1122 1134) the Hoare annotation is: true [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1116 1136) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1134) no Hoare annotation was computed. [2018-12-09 15:41:40,455 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1126 1133) no Hoare annotation was computed. [2018-12-09 15:41:40,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:41:40 BoogieIcfgContainer [2018-12-09 15:41:40,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:41:40,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:41:40,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:41:40,493 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:41:40,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:41:08" (3/4) ... [2018-12-09 15:41:40,496 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-12-09 15:41:40,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-12-09 15:41:40,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-09 15:41:40,510 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2018-12-09 15:41:40,510 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2018-12-09 15:41:40,511 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 15:41:40,511 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 15:41:40,530 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) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((((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))) || (((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-09 15:41:40,530 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) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || !(\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)) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || (((((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-12-09 15:41:40,530 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)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || (((((NP + 2 <= SKIP1 && ((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || ((((((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-12-09 15:41:40,530 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && 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))) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || !(\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)) || (((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-12-09 15:41:40,531 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(myStatus) + 1073741637 || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\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 && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (!(259 == ntStatus) && ((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && MPR3 <= 6) && 6 <= MPR3)) && ((((((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((((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 && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (!(259 == ntStatus) && ((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && MPR3 <= 6) && 6 <= MPR3)) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,531 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (\old(s) == s && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR3 < 6) || \old(s) < MPR3)) && ((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || (s == NP && \old(customIrp) == customIrp)) || !(myStatus == 0)) || MPR3 < 6) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR3 < 6) || \old(s) < MPR3) || (s == NP && \old(customIrp) == customIrp))) && ((((((\old(customIrp) == 1 && ((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5)) && (((((((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,531 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (\old(s) == s && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR3 < 6) || \old(s) < MPR3)) && ((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || (s == NP && \old(customIrp) == customIrp)) || !(myStatus == 0)) || MPR3 < 6) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR3 < 6) || \old(s) < MPR3) || (s == NP && \old(customIrp) == customIrp))) && ((((((\old(customIrp) == 1 && ((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5)) && (((((((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,531 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))) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == status) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == status) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-09 15:41:40,532 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-12-09 15:41:40,532 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(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))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (((((((((((((((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 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && MaximumInterfaceType <= 0) && 6 <= MPR3))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (((((((((((((((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 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && MaximumInterfaceType <= 0) && 6 <= MPR3)) [2018-12-09 15:41:40,532 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 < myStatus + 1073741637 || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || 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))) && MPR3 <= 6) && 1 == setEventCalled) && 6 <= MPR3) && MaximumInterfaceType <= 0)) && ((((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || 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))) && MPR3 <= 6) && 1 == setEventCalled) && 6 <= MPR3) && MaximumInterfaceType <= 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || \old(s) == s) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && ((((((6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || !(myStatus == 0)) || 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)) || !(customIrp == 0)) [2018-12-09 15:41:40,532 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || MPR3 < \old(s)) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || MPR3 < 6) || SKIP2 < DC + 2) || !(\old(customIrp) == 0)) || \old(s) < MPR3) && (((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) || (((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5)) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || (\old(s) == s && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,532 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < myStatus + 1073741637 || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((((6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(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)) [2018-12-09 15:41:40,532 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < myStatus + 1073741637 || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((((6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || !(myStatus == 0)) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(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)) [2018-12-09 15:41:40,533 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((\old(s) == s && 1 <= compRegistered) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((\old(s) == s && 1 <= compRegistered) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,533 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(s) == s && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || (((\old(s) == s && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,533 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus))) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus))) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == pended && 0 == compRegistered) && s == \old(s)) && \old(myStatus) == myStatus) && 0 == ntStatus) && \old(customIrp) == customIrp) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && ((((((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == myStatus) && \old(myStatus) == ntStatus) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || (((0 == pended && 0 == compRegistered) && s == \old(s)) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((0 == pended && 0 == compRegistered) && s == \old(s)) && \old(customIrp) == customIrp)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\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) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-12-09 15:41:40,582 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_85104a83-c0b1-4561-9ed7-fab8a0fb71e4/bin-2019/uautomizer/witness.graphml [2018-12-09 15:41:40,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:41:40,582 INFO L168 Benchmark]: Toolchain (without parser) took 32947.64 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 838.3 MB). Free memory was 951.7 MB in the beginning and 1.4 GB in the end (delta: -471.1 MB). Peak memory consumption was 367.3 MB. Max. memory is 11.5 GB. [2018-12-09 15:41:40,583 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:41:40,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 15:41:40,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:41:40,583 INFO L168 Benchmark]: Boogie Preprocessor took 31.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:41:40,583 INFO L168 Benchmark]: RCFGBuilder took 489.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. [2018-12-09 15:41:40,583 INFO L168 Benchmark]: TraceAbstraction took 32044.75 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 693.1 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -401.5 MB). Peak memory consumption was 869.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:41:40,583 INFO L168 Benchmark]: Witness Printer took 89.13 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-12-09 15:41:40,584 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 489.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32044.75 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 693.1 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -401.5 MB). Peak memory consumption was 869.9 MB. Max. memory is 11.5 GB. * Witness Printer took 89.13 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 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) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\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) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 887]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: ((((((0 < myStatus + 1073741637 || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((((6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(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)) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || MPR3 < \old(s)) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || MPR3 < 6) || SKIP2 < DC + 2) || !(\old(customIrp) == 0)) || \old(s) < MPR3) && (((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) || (((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5)) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || (\old(s) == s && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) - 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) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || !(\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)) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || (((((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) || (((\old(s) == s && 1 <= compRegistered) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((\old(s) == s && 1 <= compRegistered) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 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: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((((((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus))) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((((((((0 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == ntStatus))) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\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: ((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (\old(s) == s && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR3 < 6) || \old(s) < MPR3)) && ((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || (s == NP && \old(customIrp) == customIrp)) || !(myStatus == 0)) || MPR3 < 6) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR3 < 6) || \old(s) < MPR3) || (s == NP && \old(customIrp) == customIrp))) && ((((((\old(customIrp) == 1 && ((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5)) && (((((((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) - 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: ((((((0 < \old(myStatus) + 1073741637 || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\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 && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (!(259 == ntStatus) && ((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && MPR3 <= 6) && 6 <= MPR3)) && ((((((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((((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 && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (!(259 == ntStatus) && ((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && MPR3 <= 6) && 6 <= MPR3)) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 958]: Loop Invariant Derived loop invariant: ((((((((6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(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))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (((((((((((((((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 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && MaximumInterfaceType <= 0) && 6 <= MPR3))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (((((((((((((((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 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && MaximumInterfaceType <= 0) && 6 <= MPR3)) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((\old(s) == s && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || (((\old(s) == s && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\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: ((((((0 < myStatus + 1073741637 || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((((6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || !(myStatus == 0)) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(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)) - 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: ((((((((0 == pended && 0 == compRegistered) && s == \old(s)) && \old(myStatus) == myStatus) && 0 == ntStatus) && \old(customIrp) == customIrp) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && ((((((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == myStatus) && \old(myStatus) == ntStatus) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\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: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 732]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == status) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == status) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\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)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || (((((NP + 2 <= SKIP1 && ((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || ((((((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: ((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (\old(s) == s && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR3 < 6) || \old(s) < MPR3)) && ((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || (s == NP && \old(customIrp) == customIrp)) || !(myStatus == 0)) || MPR3 < 6) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || (((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR3 < 6) || \old(s) < MPR3) || (s == NP && \old(customIrp) == customIrp))) && ((((((\old(customIrp) == 1 && ((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5)) && (((((((((((((((DC + 5 <= IPC && 0 == pended) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && MPR3 <= 6) && 1 == setEventCalled) && s + 2 <= SKIP1) && 6 <= MPR3) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) - 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) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((((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))) || (((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || !(\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 == pended && 0 == compRegistered) && s == \old(s)) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((0 == pended && 0 == compRegistered) && s == \old(s)) && \old(customIrp) == customIrp)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || (((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && 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))) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || !(\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)) || (((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: (((((((0 < myStatus + 1073741637 || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || 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))) && MPR3 <= 6) && 1 == setEventCalled) && 6 <= MPR3) && MaximumInterfaceType <= 0)) && ((((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || 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))) && MPR3 <= 6) && 1 == setEventCalled) && 6 <= MPR3) && MaximumInterfaceType <= 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || \old(s) == s) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || IPC < DC + 5) || !(compRegistered == 0) || !(0 == pended))) && ((((((6 < MPR3 || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(s) == NP) || !(0 == pended)) || MPR1 < SKIP1 + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || !(myStatus == 0)) || 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)) || !(customIrp == 0)) - 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, 31.9s OverallTime, 50 OverallIterations, 2 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 19.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 15919 SDtfs, 8229 SDslu, 49312 SDs, 0 SdLazy, 9343 SolverSat, 1451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 946 GetRequests, 580 SyntacticMatches, 15 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.9s 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.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 1629 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 117 LocationsWithAnnotation, 1959 PreInvPairs, 2214 NumberOfFragments, 17665 HoareAnnotationTreeSize, 1959 FomulaSimplifications, 95841 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 117 FomulaSimplificationsInter, 271083 FormulaSimplificationTreeSizeReductionInter, 18.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 4377 NumberOfCodeBlocks, 4377 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4324 ConstructedInterpolants, 0 QuantifiedInterpolants, 729543 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...