./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/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 9187bc92090d01e0892e8fd14c7d6a75e3556b66 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:12:29,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:12:29,680 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:12:29,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:12:29,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:12:29,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:12:29,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:12:29,690 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:12:29,691 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:12:29,692 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:12:29,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:12:29,693 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:12:29,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:12:29,694 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:12:29,694 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:12:29,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:12:29,695 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:12:29,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:12:29,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:12:29,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:12:29,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:12:29,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:12:29,701 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:12:29,701 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:12:29,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:12:29,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:12:29,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:12:29,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:12:29,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:12:29,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:12:29,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:12:29,704 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:12:29,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:12:29,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:12:29,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:12:29,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:12:29,706 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:12:29,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:12:29,713 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:12:29,713 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:12:29,713 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:12:29,714 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:12:29,714 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:12:29,714 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:12:29,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:12:29,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:12:29,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:12:29,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:12:29,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:12:29,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:12:29,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:12:29,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:12:29,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:12:29,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:12:29,715 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:12:29,715 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:12:29,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:12:29,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:12:29,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:12:29,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:12:29,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:12:29,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:12:29,716 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:12:29,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:12:29,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:12:29,717 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:12:29,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:12:29,717 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_98717026-d6cf-4ae9-9214-2641187f2e75/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 -> 9187bc92090d01e0892e8fd14c7d6a75e3556b66 [2018-11-28 13:12:29,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:12:29,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:12:29,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:12:29,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:12:29,753 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:12:29,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 13:12:29,795 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/data/454e09883/46817e79ced34efaa9ab8a3da21d1f6f/FLAGdca4d1a7f [2018-11-28 13:12:30,247 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:12:30,248 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 13:12:30,259 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/data/454e09883/46817e79ced34efaa9ab8a3da21d1f6f/FLAGdca4d1a7f [2018-11-28 13:12:30,270 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/data/454e09883/46817e79ced34efaa9ab8a3da21d1f6f [2018-11-28 13:12:30,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:12:30,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:12:30,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:12:30,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:12:30,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:12:30,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309deed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30, skipping insertion in model container [2018-11-28 13:12:30,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:12:30,323 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:12:30,552 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:12:30,556 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:12:30,694 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:12:30,709 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:12:30,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30 WrapperNode [2018-11-28 13:12:30,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:12:30,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:12:30,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:12:30,710 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:12:30,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:12:30,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:12:30,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:12:30,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:12:30,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... [2018-11-28 13:12:30,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:12:30,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:12:30,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:12:30,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:12:30,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:12:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-28 13:12:30,833 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-28 13:12:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-28 13:12:30,833 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-28 13:12:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-28 13:12:30,833 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-28 13:12:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-28 13:12:30,834 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-28 13:12:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:12:30,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:12:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-28 13:12:30,834 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-28 13:12:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-28 13:12:30,834 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-28 13:12:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-28 13:12:30,834 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-28 13:12:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-28 13:12:30,835 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-28 13:12:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-28 13:12:30,835 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-28 13:12:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-28 13:12:30,835 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-28 13:12:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-28 13:12:30,835 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-28 13:12:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-28 13:12:30,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-28 13:12:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-28 13:12:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-28 13:12:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-28 13:12:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-28 13:12:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-28 13:12:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-28 13:12:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-28 13:12:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-28 13:12:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-28 13:12:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-28 13:12:30,837 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-28 13:12:30,837 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-28 13:12:30,837 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-28 13:12:30,837 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-28 13:12:30,837 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-28 13:12:30,837 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-28 13:12:30,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:12:30,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:12:30,837 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-28 13:12:30,837 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-28 13:12:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-28 13:12:30,838 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-28 13:12:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-28 13:12:30,838 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-28 13:12:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:12:30,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:12:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-28 13:12:30,838 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-28 13:12:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-28 13:12:30,838 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-28 13:12:30,839 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-28 13:12:30,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-28 13:12:31,068 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,068 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,111 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,112 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,121 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,121 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,260 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,261 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,311 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,311 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,379 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,379 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,383 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,383 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,402 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,402 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,417 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,417 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,488 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,488 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,593 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,593 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,597 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,598 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,607 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:12:31,607 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:12:31,616 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:12:31,616 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 13:12:31,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:12:31 BoogieIcfgContainer [2018-11-28 13:12:31,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:12:31,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:12:31,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:12:31,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:12:31,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:12:30" (1/3) ... [2018-11-28 13:12:31,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2283c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:12:31, skipping insertion in model container [2018-11-28 13:12:31,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:30" (2/3) ... [2018-11-28 13:12:31,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2283c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:12:31, skipping insertion in model container [2018-11-28 13:12:31,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:12:31" (3/3) ... [2018-11-28 13:12:31,621 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 13:12:31,627 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:12:31,632 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:12:31,642 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:12:31,666 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:12:31,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:12:31,666 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:12:31,666 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:12:31,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:12:31,667 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:12:31,667 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:12:31,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:12:31,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:12:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2018-11-28 13:12:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 13:12:31,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:31,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:31,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:31,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash -688252531, now seen corresponding path program 1 times [2018-11-28 13:12:31,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:31,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:31,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:31,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:31,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:31,867 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2018-11-28 13:12:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:31,967 INFO L93 Difference]: Finished difference Result 624 states and 909 transitions. [2018-11-28 13:12:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:31,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 13:12:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:31,981 INFO L225 Difference]: With dead ends: 624 [2018-11-28 13:12:31,981 INFO L226 Difference]: Without dead ends: 380 [2018-11-28 13:12:31,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-28 13:12:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-28 13:12:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-28 13:12:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2018-11-28 13:12:32,040 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2018-11-28 13:12:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:32,041 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2018-11-28 13:12:32,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2018-11-28 13:12:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:12:32,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:32,043 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] [2018-11-28 13:12:32,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:32,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1177754650, now seen corresponding path program 1 times [2018-11-28 13:12:32,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:32,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:32,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:32,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:32,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:32,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,167 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2018-11-28 13:12:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:32,306 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2018-11-28 13:12:32,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:32,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 13:12:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:32,311 INFO L225 Difference]: With dead ends: 699 [2018-11-28 13:12:32,311 INFO L226 Difference]: Without dead ends: 536 [2018-11-28 13:12:32,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-28 13:12:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2018-11-28 13:12:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-11-28 13:12:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2018-11-28 13:12:32,349 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2018-11-28 13:12:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:32,349 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2018-11-28 13:12:32,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2018-11-28 13:12:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:12:32,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:32,351 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] [2018-11-28 13:12:32,351 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:32,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:32,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1821616786, now seen corresponding path program 1 times [2018-11-28 13:12:32,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:32,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:32,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:32,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:32,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:32,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:32,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:32,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,442 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2018-11-28 13:12:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:32,476 INFO L93 Difference]: Finished difference Result 642 states and 859 transitions. [2018-11-28 13:12:32,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:32,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 13:12:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:32,479 INFO L225 Difference]: With dead ends: 642 [2018-11-28 13:12:32,480 INFO L226 Difference]: Without dead ends: 623 [2018-11-28 13:12:32,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-11-28 13:12:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2018-11-28 13:12:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-11-28 13:12:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2018-11-28 13:12:32,506 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2018-11-28 13:12:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:32,506 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2018-11-28 13:12:32,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2018-11-28 13:12:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:12:32,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:32,508 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] [2018-11-28 13:12:32,508 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:32,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:32,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1105627836, now seen corresponding path program 1 times [2018-11-28 13:12:32,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:32,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:32,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:32,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:32,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,576 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2018-11-28 13:12:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:32,624 INFO L93 Difference]: Finished difference Result 1080 states and 1455 transitions. [2018-11-28 13:12:32,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:32,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 13:12:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:32,630 INFO L225 Difference]: With dead ends: 1080 [2018-11-28 13:12:32,631 INFO L226 Difference]: Without dead ends: 788 [2018-11-28 13:12:32,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-11-28 13:12:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2018-11-28 13:12:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-28 13:12:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2018-11-28 13:12:32,669 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2018-11-28 13:12:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:32,669 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2018-11-28 13:12:32,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2018-11-28 13:12:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 13:12:32,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:32,671 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] [2018-11-28 13:12:32,671 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:32,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:32,671 INFO L82 PathProgramCache]: Analyzing trace with hash 149710402, now seen corresponding path program 1 times [2018-11-28 13:12:32,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:32,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:32,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:32,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:32,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:32,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:32,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:32,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:32,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,710 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2018-11-28 13:12:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:32,791 INFO L93 Difference]: Finished difference Result 795 states and 1072 transitions. [2018-11-28 13:12:32,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:32,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-28 13:12:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:32,796 INFO L225 Difference]: With dead ends: 795 [2018-11-28 13:12:32,796 INFO L226 Difference]: Without dead ends: 790 [2018-11-28 13:12:32,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-11-28 13:12:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2018-11-28 13:12:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-11-28 13:12:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2018-11-28 13:12:32,828 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 39 [2018-11-28 13:12:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:32,828 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2018-11-28 13:12:32,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2018-11-28 13:12:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 13:12:32,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:32,830 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] [2018-11-28 13:12:32,830 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:32,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1382897701, now seen corresponding path program 1 times [2018-11-28 13:12:32,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:32,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:32,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:32,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:32,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:32,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:32,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:32,890 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2018-11-28 13:12:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:33,006 INFO L93 Difference]: Finished difference Result 803 states and 1085 transitions. [2018-11-28 13:12:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:33,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-28 13:12:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:33,010 INFO L225 Difference]: With dead ends: 803 [2018-11-28 13:12:33,010 INFO L226 Difference]: Without dead ends: 800 [2018-11-28 13:12:33,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-11-28 13:12:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2018-11-28 13:12:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-11-28 13:12:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2018-11-28 13:12:33,040 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2018-11-28 13:12:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:33,041 INFO L480 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2018-11-28 13:12:33,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2018-11-28 13:12:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 13:12:33,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:33,042 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] [2018-11-28 13:12:33,043 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:33,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash -91658760, now seen corresponding path program 1 times [2018-11-28 13:12:33,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:33,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:33,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:33,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:33,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:33,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:33,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:33,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:33,087 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2018-11-28 13:12:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:33,144 INFO L93 Difference]: Finished difference Result 812 states and 1093 transitions. [2018-11-28 13:12:33,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:33,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-28 13:12:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:33,147 INFO L225 Difference]: With dead ends: 812 [2018-11-28 13:12:33,148 INFO L226 Difference]: Without dead ends: 797 [2018-11-28 13:12:33,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-11-28 13:12:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2018-11-28 13:12:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-28 13:12:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2018-11-28 13:12:33,176 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2018-11-28 13:12:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:33,176 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2018-11-28 13:12:33,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2018-11-28 13:12:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 13:12:33,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:33,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:33,177 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:33,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:33,178 INFO L82 PathProgramCache]: Analyzing trace with hash 797704003, now seen corresponding path program 1 times [2018-11-28 13:12:33,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:33,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:33,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:33,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:33,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:33,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:33,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:33,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:33,220 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2018-11-28 13:12:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:33,282 INFO L93 Difference]: Finished difference Result 810 states and 1089 transitions. [2018-11-28 13:12:33,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:33,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-28 13:12:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:33,287 INFO L225 Difference]: With dead ends: 810 [2018-11-28 13:12:33,287 INFO L226 Difference]: Without dead ends: 790 [2018-11-28 13:12:33,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-11-28 13:12:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-11-28 13:12:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-11-28 13:12:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2018-11-28 13:12:33,317 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2018-11-28 13:12:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:33,317 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2018-11-28 13:12:33,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2018-11-28 13:12:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 13:12:33,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:33,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:33,319 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:33,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:33,319 INFO L82 PathProgramCache]: Analyzing trace with hash 354660221, now seen corresponding path program 1 times [2018-11-28 13:12:33,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:33,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:33,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:33,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:33,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:33,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:33,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:33,410 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 5 states. [2018-11-28 13:12:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:33,657 INFO L93 Difference]: Finished difference Result 798 states and 1072 transitions. [2018-11-28 13:12:33,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:33,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-28 13:12:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:33,660 INFO L225 Difference]: With dead ends: 798 [2018-11-28 13:12:33,660 INFO L226 Difference]: Without dead ends: 792 [2018-11-28 13:12:33,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-11-28 13:12:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2018-11-28 13:12:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-11-28 13:12:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1065 transitions. [2018-11-28 13:12:33,708 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1065 transitions. Word has length 43 [2018-11-28 13:12:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:33,708 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1065 transitions. [2018-11-28 13:12:33,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1065 transitions. [2018-11-28 13:12:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 13:12:33,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:33,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:33,710 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:33,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash 472733380, now seen corresponding path program 1 times [2018-11-28 13:12:33,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:33,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:33,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:33,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:33,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:33,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:12:33,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:12:33,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:12:33,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:12:33,741 INFO L87 Difference]: Start difference. First operand 790 states and 1065 transitions. Second operand 4 states. [2018-11-28 13:12:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:33,780 INFO L93 Difference]: Finished difference Result 818 states and 1098 transitions. [2018-11-28 13:12:33,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:12:33,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-28 13:12:33,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:33,782 INFO L225 Difference]: With dead ends: 818 [2018-11-28 13:12:33,783 INFO L226 Difference]: Without dead ends: 796 [2018-11-28 13:12:33,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-11-28 13:12:33,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 792. [2018-11-28 13:12:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-28 13:12:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1067 transitions. [2018-11-28 13:12:33,802 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1067 transitions. Word has length 42 [2018-11-28 13:12:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:33,802 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1067 transitions. [2018-11-28 13:12:33,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:12:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1067 transitions. [2018-11-28 13:12:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:12:33,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:33,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:33,803 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:33,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:33,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1725637380, now seen corresponding path program 1 times [2018-11-28 13:12:33,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:33,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:33,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:33,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:33,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:33,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:33,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:33,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:33,844 INFO L87 Difference]: Start difference. First operand 792 states and 1067 transitions. Second operand 3 states. [2018-11-28 13:12:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:33,921 INFO L93 Difference]: Finished difference Result 1170 states and 1590 transitions. [2018-11-28 13:12:33,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:33,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-28 13:12:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:33,924 INFO L225 Difference]: With dead ends: 1170 [2018-11-28 13:12:33,924 INFO L226 Difference]: Without dead ends: 1167 [2018-11-28 13:12:33,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-11-28 13:12:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 915. [2018-11-28 13:12:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-11-28 13:12:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2018-11-28 13:12:33,953 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 44 [2018-11-28 13:12:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:33,953 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2018-11-28 13:12:33,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2018-11-28 13:12:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:12:33,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:33,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:33,954 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:33,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1543911893, now seen corresponding path program 1 times [2018-11-28 13:12:33,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:33,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:33,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:34,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:34,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:34,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:34,003 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 5 states. [2018-11-28 13:12:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:34,226 INFO L93 Difference]: Finished difference Result 923 states and 1242 transitions. [2018-11-28 13:12:34,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:34,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-28 13:12:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:34,229 INFO L225 Difference]: With dead ends: 923 [2018-11-28 13:12:34,229 INFO L226 Difference]: Without dead ends: 917 [2018-11-28 13:12:34,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-11-28 13:12:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 915. [2018-11-28 13:12:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-11-28 13:12:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1235 transitions. [2018-11-28 13:12:34,259 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1235 transitions. Word has length 44 [2018-11-28 13:12:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:34,259 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1235 transitions. [2018-11-28 13:12:34,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1235 transitions. [2018-11-28 13:12:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 13:12:34,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:34,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:34,261 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:34,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash 381844807, now seen corresponding path program 1 times [2018-11-28 13:12:34,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:34,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:34,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:34,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:34,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:12:34,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:12:34,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:12:34,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:12:34,296 INFO L87 Difference]: Start difference. First operand 915 states and 1235 transitions. Second operand 4 states. [2018-11-28 13:12:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:34,349 INFO L93 Difference]: Finished difference Result 943 states and 1268 transitions. [2018-11-28 13:12:34,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:12:34,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-28 13:12:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:34,352 INFO L225 Difference]: With dead ends: 943 [2018-11-28 13:12:34,352 INFO L226 Difference]: Without dead ends: 921 [2018-11-28 13:12:34,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-11-28 13:12:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2018-11-28 13:12:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-11-28 13:12:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1235 transitions. [2018-11-28 13:12:34,380 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1235 transitions. Word has length 43 [2018-11-28 13:12:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:34,380 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1235 transitions. [2018-11-28 13:12:34,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:12:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1235 transitions. [2018-11-28 13:12:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:12:34,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:34,382 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] [2018-11-28 13:12:34,382 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:34,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1717093558, now seen corresponding path program 1 times [2018-11-28 13:12:34,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:34,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:34,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:34,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:34,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:34,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:34,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:34,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:34,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:34,436 INFO L87 Difference]: Start difference. First operand 915 states and 1235 transitions. Second operand 5 states. [2018-11-28 13:12:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:34,865 INFO L93 Difference]: Finished difference Result 1639 states and 2181 transitions. [2018-11-28 13:12:34,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:34,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 13:12:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:34,868 INFO L225 Difference]: With dead ends: 1639 [2018-11-28 13:12:34,868 INFO L226 Difference]: Without dead ends: 1088 [2018-11-28 13:12:34,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-11-28 13:12:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 906. [2018-11-28 13:12:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-28 13:12:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2018-11-28 13:12:34,902 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 45 [2018-11-28 13:12:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:34,902 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2018-11-28 13:12:34,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2018-11-28 13:12:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:12:34,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:34,903 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] [2018-11-28 13:12:34,904 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:34,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash 700175398, now seen corresponding path program 1 times [2018-11-28 13:12:34,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:34,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:34,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:34,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:34,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:34,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:34,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:34,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:34,937 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2018-11-28 13:12:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:34,973 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2018-11-28 13:12:34,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:34,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 13:12:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:34,976 INFO L225 Difference]: With dead ends: 922 [2018-11-28 13:12:34,976 INFO L226 Difference]: Without dead ends: 904 [2018-11-28 13:12:34,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-28 13:12:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-11-28 13:12:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-28 13:12:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2018-11-28 13:12:35,006 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2018-11-28 13:12:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:35,007 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2018-11-28 13:12:35,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2018-11-28 13:12:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:12:35,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:35,008 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] [2018-11-28 13:12:35,008 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:35,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash -47081320, now seen corresponding path program 1 times [2018-11-28 13:12:35,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:35,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:35,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:35,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-11-28 13:12:35,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:35,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:35,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:35,032 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2018-11-28 13:12:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:35,079 INFO L93 Difference]: Finished difference Result 944 states and 1257 transitions. [2018-11-28 13:12:35,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:35,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-28 13:12:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:35,082 INFO L225 Difference]: With dead ends: 944 [2018-11-28 13:12:35,082 INFO L226 Difference]: Without dead ends: 868 [2018-11-28 13:12:35,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-11-28 13:12:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2018-11-28 13:12:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-28 13:12:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2018-11-28 13:12:35,113 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2018-11-28 13:12:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:35,113 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2018-11-28 13:12:35,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2018-11-28 13:12:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:12:35,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:35,114 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] [2018-11-28 13:12:35,115 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:35,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:35,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1679726262, now seen corresponding path program 1 times [2018-11-28 13:12:35,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:35,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:35,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:35,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:35,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:35,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:35,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:35,153 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2018-11-28 13:12:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:35,189 INFO L93 Difference]: Finished difference Result 881 states and 1174 transitions. [2018-11-28 13:12:35,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:35,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 13:12:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:35,192 INFO L225 Difference]: With dead ends: 881 [2018-11-28 13:12:35,192 INFO L226 Difference]: Without dead ends: 863 [2018-11-28 13:12:35,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-28 13:12:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2018-11-28 13:12:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-11-28 13:12:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2018-11-28 13:12:35,219 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2018-11-28 13:12:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:35,219 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2018-11-28 13:12:35,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2018-11-28 13:12:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:12:35,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:35,221 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] [2018-11-28 13:12:35,221 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:35,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1637294242, now seen corresponding path program 1 times [2018-11-28 13:12:35,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:35,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:35,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:35,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:35,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-11-28 13:12:35,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:35,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:12:35,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:35,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:35,264 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 6 states. [2018-11-28 13:12:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:35,329 INFO L93 Difference]: Finished difference Result 883 states and 1175 transitions. [2018-11-28 13:12:35,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:35,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-28 13:12:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:35,332 INFO L225 Difference]: With dead ends: 883 [2018-11-28 13:12:35,332 INFO L226 Difference]: Without dead ends: 863 [2018-11-28 13:12:35,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-28 13:12:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2018-11-28 13:12:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-11-28 13:12:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1143 transitions. [2018-11-28 13:12:35,380 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1143 transitions. Word has length 50 [2018-11-28 13:12:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:35,380 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1143 transitions. [2018-11-28 13:12:35,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1143 transitions. [2018-11-28 13:12:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:12:35,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:35,382 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] [2018-11-28 13:12:35,382 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:35,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1826385380, now seen corresponding path program 1 times [2018-11-28 13:12:35,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:35,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:35,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:35,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:35,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:35,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:35,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:35,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:35,412 INFO L87 Difference]: Start difference. First operand 863 states and 1143 transitions. Second operand 3 states. [2018-11-28 13:12:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:35,501 INFO L93 Difference]: Finished difference Result 1180 states and 1584 transitions. [2018-11-28 13:12:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:35,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 13:12:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:35,505 INFO L225 Difference]: With dead ends: 1180 [2018-11-28 13:12:35,505 INFO L226 Difference]: Without dead ends: 1153 [2018-11-28 13:12:35,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-11-28 13:12:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 966. [2018-11-28 13:12:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-11-28 13:12:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1285 transitions. [2018-11-28 13:12:35,539 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1285 transitions. Word has length 50 [2018-11-28 13:12:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:35,539 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 1285 transitions. [2018-11-28 13:12:35,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1285 transitions. [2018-11-28 13:12:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:12:35,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:35,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:35,541 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:35,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash -273092308, now seen corresponding path program 1 times [2018-11-28 13:12:35,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:35,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:35,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:12:35,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:12:35,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:12:35,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:12:35,571 INFO L87 Difference]: Start difference. First operand 966 states and 1285 transitions. Second operand 4 states. [2018-11-28 13:12:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:35,697 INFO L93 Difference]: Finished difference Result 1059 states and 1376 transitions. [2018-11-28 13:12:35,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:12:35,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-11-28 13:12:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:35,700 INFO L225 Difference]: With dead ends: 1059 [2018-11-28 13:12:35,700 INFO L226 Difference]: Without dead ends: 659 [2018-11-28 13:12:35,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:12:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-28 13:12:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 622. [2018-11-28 13:12:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-28 13:12:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2018-11-28 13:12:35,723 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 52 [2018-11-28 13:12:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:35,724 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2018-11-28 13:12:35,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:12:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2018-11-28 13:12:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 13:12:35,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:35,725 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] [2018-11-28 13:12:35,725 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:35,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:35,725 INFO L82 PathProgramCache]: Analyzing trace with hash 998036193, now seen corresponding path program 1 times [2018-11-28 13:12:35,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:35,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:35,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:35,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:35,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:35,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:12:35,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:12:35,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:12:35,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:35,769 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2018-11-28 13:12:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:35,845 INFO L93 Difference]: Finished difference Result 661 states and 836 transitions. [2018-11-28 13:12:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:12:35,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-28 13:12:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:35,847 INFO L225 Difference]: With dead ends: 661 [2018-11-28 13:12:35,848 INFO L226 Difference]: Without dead ends: 612 [2018-11-28 13:12:35,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:12:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-28 13:12:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2018-11-28 13:12:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-28 13:12:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2018-11-28 13:12:35,870 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2018-11-28 13:12:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:35,870 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2018-11-28 13:12:35,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:12:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2018-11-28 13:12:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 13:12:35,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:35,871 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] [2018-11-28 13:12:35,871 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:35,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1800502866, now seen corresponding path program 1 times [2018-11-28 13:12:35,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:35,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:35,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:35,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:12:35,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:35,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:35,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:35,908 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2018-11-28 13:12:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:35,949 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2018-11-28 13:12:35,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:35,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-28 13:12:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:35,952 INFO L225 Difference]: With dead ends: 637 [2018-11-28 13:12:35,952 INFO L226 Difference]: Without dead ends: 612 [2018-11-28 13:12:35,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-28 13:12:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-11-28 13:12:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-28 13:12:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2018-11-28 13:12:35,974 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2018-11-28 13:12:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:35,974 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2018-11-28 13:12:35,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2018-11-28 13:12:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 13:12:35,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:35,976 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] [2018-11-28 13:12:35,976 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:35,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1235297599, now seen corresponding path program 1 times [2018-11-28 13:12:35,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:35,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:35,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:35,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:36,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:36,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:12:36,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:12:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:12:36,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:12:36,027 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2018-11-28 13:12:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:36,139 INFO L93 Difference]: Finished difference Result 642 states and 810 transitions. [2018-11-28 13:12:36,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:12:36,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-28 13:12:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:36,141 INFO L225 Difference]: With dead ends: 642 [2018-11-28 13:12:36,142 INFO L226 Difference]: Without dead ends: 638 [2018-11-28 13:12:36,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-28 13:12:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2018-11-28 13:12:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-11-28 13:12:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2018-11-28 13:12:36,170 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2018-11-28 13:12:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:36,171 INFO L480 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2018-11-28 13:12:36,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:12:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2018-11-28 13:12:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 13:12:36,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:36,172 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] [2018-11-28 13:12:36,173 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:36,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1235020769, now seen corresponding path program 1 times [2018-11-28 13:12:36,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:36,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:36,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:36,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:36,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:12:36,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:12:36,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:12:36,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:12:36,230 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2018-11-28 13:12:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:36,307 INFO L93 Difference]: Finished difference Result 1024 states and 1318 transitions. [2018-11-28 13:12:36,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:12:36,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-28 13:12:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:36,309 INFO L225 Difference]: With dead ends: 1024 [2018-11-28 13:12:36,309 INFO L226 Difference]: Without dead ends: 670 [2018-11-28 13:12:36,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:12:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-28 13:12:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-11-28 13:12:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-28 13:12:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2018-11-28 13:12:36,354 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2018-11-28 13:12:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:36,354 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2018-11-28 13:12:36,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:12:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2018-11-28 13:12:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:12:36,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:36,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:36,356 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:36,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash -203655125, now seen corresponding path program 1 times [2018-11-28 13:12:36,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:36,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:36,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:36,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:36,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:36,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:12:36,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:12:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:12:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:36,410 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 7 states. [2018-11-28 13:12:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:36,881 INFO L93 Difference]: Finished difference Result 805 states and 1032 transitions. [2018-11-28 13:12:36,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:12:36,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-28 13:12:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:36,883 INFO L225 Difference]: With dead ends: 805 [2018-11-28 13:12:36,883 INFO L226 Difference]: Without dead ends: 708 [2018-11-28 13:12:36,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:12:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-11-28 13:12:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 680. [2018-11-28 13:12:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-11-28 13:12:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 873 transitions. [2018-11-28 13:12:36,913 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 873 transitions. Word has length 52 [2018-11-28 13:12:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:36,913 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 873 transitions. [2018-11-28 13:12:36,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:12:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 873 transitions. [2018-11-28 13:12:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:12:36,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:36,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:36,915 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:36,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash -60375767, now seen corresponding path program 1 times [2018-11-28 13:12:36,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:36,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:36,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:36,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:36,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:36,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:36,945 INFO L87 Difference]: Start difference. First operand 680 states and 873 transitions. Second operand 3 states. [2018-11-28 13:12:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:37,040 INFO L93 Difference]: Finished difference Result 838 states and 1091 transitions. [2018-11-28 13:12:37,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:37,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 13:12:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:37,044 INFO L225 Difference]: With dead ends: 838 [2018-11-28 13:12:37,044 INFO L226 Difference]: Without dead ends: 765 [2018-11-28 13:12:37,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-28 13:12:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 653. [2018-11-28 13:12:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-11-28 13:12:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 852 transitions. [2018-11-28 13:12:37,074 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 852 transitions. Word has length 52 [2018-11-28 13:12:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:37,074 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 852 transitions. [2018-11-28 13:12:37,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 852 transitions. [2018-11-28 13:12:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:12:37,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:37,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:37,076 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:37,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:37,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2114998175, now seen corresponding path program 1 times [2018-11-28 13:12:37,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:37,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:37,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:37,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:37,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:37,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:37,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:37,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:37,145 INFO L87 Difference]: Start difference. First operand 653 states and 852 transitions. Second operand 9 states. [2018-11-28 13:12:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:38,092 INFO L93 Difference]: Finished difference Result 850 states and 1093 transitions. [2018-11-28 13:12:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:12:38,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-28 13:12:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:38,095 INFO L225 Difference]: With dead ends: 850 [2018-11-28 13:12:38,095 INFO L226 Difference]: Without dead ends: 783 [2018-11-28 13:12:38,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:12:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-11-28 13:12:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 620. [2018-11-28 13:12:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-28 13:12:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 789 transitions. [2018-11-28 13:12:38,123 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 789 transitions. Word has length 52 [2018-11-28 13:12:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:38,123 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 789 transitions. [2018-11-28 13:12:38,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 789 transitions. [2018-11-28 13:12:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:12:38,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:38,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:38,124 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:38,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1870270086, now seen corresponding path program 1 times [2018-11-28 13:12:38,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:38,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:38,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:38,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:38,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:38,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:38,161 INFO L87 Difference]: Start difference. First operand 620 states and 789 transitions. Second operand 5 states. [2018-11-28 13:12:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:38,428 INFO L93 Difference]: Finished difference Result 767 states and 997 transitions. [2018-11-28 13:12:38,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:38,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-28 13:12:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:38,431 INFO L225 Difference]: With dead ends: 767 [2018-11-28 13:12:38,431 INFO L226 Difference]: Without dead ends: 749 [2018-11-28 13:12:38,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-11-28 13:12:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 603. [2018-11-28 13:12:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-11-28 13:12:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 762 transitions. [2018-11-28 13:12:38,460 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 762 transitions. Word has length 54 [2018-11-28 13:12:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:38,460 INFO L480 AbstractCegarLoop]: Abstraction has 603 states and 762 transitions. [2018-11-28 13:12:38,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 762 transitions. [2018-11-28 13:12:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:12:38,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:38,461 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:38,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:38,462 INFO L82 PathProgramCache]: Analyzing trace with hash -936674225, now seen corresponding path program 1 times [2018-11-28 13:12:38,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:38,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:38,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:38,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:12:38,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:12:38,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:12:38,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:12:38,508 INFO L87 Difference]: Start difference. First operand 603 states and 762 transitions. Second operand 8 states. [2018-11-28 13:12:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:38,551 INFO L93 Difference]: Finished difference Result 616 states and 774 transitions. [2018-11-28 13:12:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:12:38,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-28 13:12:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:38,554 INFO L225 Difference]: With dead ends: 616 [2018-11-28 13:12:38,554 INFO L226 Difference]: Without dead ends: 588 [2018-11-28 13:12:38,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-11-28 13:12:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2018-11-28 13:12:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-28 13:12:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 743 transitions. [2018-11-28 13:12:38,583 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 743 transitions. Word has length 55 [2018-11-28 13:12:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:38,584 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 743 transitions. [2018-11-28 13:12:38,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:12:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 743 transitions. [2018-11-28 13:12:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 13:12:38,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:38,585 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] [2018-11-28 13:12:38,585 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:38,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash -492692256, now seen corresponding path program 1 times [2018-11-28 13:12:38,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:38,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:38,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:38,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:38,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:38,617 INFO L87 Difference]: Start difference. First operand 588 states and 743 transitions. Second operand 3 states. [2018-11-28 13:12:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:38,672 INFO L93 Difference]: Finished difference Result 896 states and 1142 transitions. [2018-11-28 13:12:38,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:38,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-28 13:12:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:38,674 INFO L225 Difference]: With dead ends: 896 [2018-11-28 13:12:38,674 INFO L226 Difference]: Without dead ends: 587 [2018-11-28 13:12:38,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-28 13:12:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-11-28 13:12:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-11-28 13:12:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 739 transitions. [2018-11-28 13:12:38,702 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 739 transitions. Word has length 58 [2018-11-28 13:12:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:38,702 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 739 transitions. [2018-11-28 13:12:38,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 739 transitions. [2018-11-28 13:12:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:12:38,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:38,703 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] [2018-11-28 13:12:38,703 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:38,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 331311930, now seen corresponding path program 1 times [2018-11-28 13:12:38,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:38,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:38,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:38,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:38,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:38,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:38,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:38,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:38,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:38,794 INFO L87 Difference]: Start difference. First operand 587 states and 739 transitions. Second operand 5 states. [2018-11-28 13:12:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:38,839 INFO L93 Difference]: Finished difference Result 846 states and 1074 transitions. [2018-11-28 13:12:38,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:38,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-28 13:12:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:38,841 INFO L225 Difference]: With dead ends: 846 [2018-11-28 13:12:38,841 INFO L226 Difference]: Without dead ends: 538 [2018-11-28 13:12:38,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-11-28 13:12:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-11-28 13:12:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-11-28 13:12:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 671 transitions. [2018-11-28 13:12:38,875 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 671 transitions. Word has length 64 [2018-11-28 13:12:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:38,875 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 671 transitions. [2018-11-28 13:12:38,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 671 transitions. [2018-11-28 13:12:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 13:12:38,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:38,877 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] [2018-11-28 13:12:38,877 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:38,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash 800339537, now seen corresponding path program 1 times [2018-11-28 13:12:38,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:38,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:38,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:38,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:12:38,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:12:38,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:12:38,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:12:38,940 INFO L87 Difference]: Start difference. First operand 538 states and 671 transitions. Second operand 8 states. [2018-11-28 13:12:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:39,050 INFO L93 Difference]: Finished difference Result 552 states and 684 transitions. [2018-11-28 13:12:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:12:39,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-28 13:12:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:39,052 INFO L225 Difference]: With dead ends: 552 [2018-11-28 13:12:39,052 INFO L226 Difference]: Without dead ends: 534 [2018-11-28 13:12:39,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-11-28 13:12:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-11-28 13:12:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-11-28 13:12:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 665 transitions. [2018-11-28 13:12:39,099 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 665 transitions. Word has length 58 [2018-11-28 13:12:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:39,099 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 665 transitions. [2018-11-28 13:12:39,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:12:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 665 transitions. [2018-11-28 13:12:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:12:39,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:39,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:39,100 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:39,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash -247744455, now seen corresponding path program 1 times [2018-11-28 13:12:39,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:39,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:39,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:12:39,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:39,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:39,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:39,136 INFO L87 Difference]: Start difference. First operand 534 states and 665 transitions. Second operand 6 states. [2018-11-28 13:12:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:39,187 INFO L93 Difference]: Finished difference Result 553 states and 684 transitions. [2018-11-28 13:12:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:39,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 13:12:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:39,189 INFO L225 Difference]: With dead ends: 553 [2018-11-28 13:12:39,190 INFO L226 Difference]: Without dead ends: 529 [2018-11-28 13:12:39,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-28 13:12:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-11-28 13:12:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-28 13:12:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 659 transitions. [2018-11-28 13:12:39,217 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 659 transitions. Word has length 60 [2018-11-28 13:12:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:39,217 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 659 transitions. [2018-11-28 13:12:39,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 659 transitions. [2018-11-28 13:12:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:12:39,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:39,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:39,219 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:39,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 502127777, now seen corresponding path program 1 times [2018-11-28 13:12:39,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:39,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:39,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:39,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:39,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:39,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:39,259 INFO L87 Difference]: Start difference. First operand 529 states and 659 transitions. Second operand 5 states. [2018-11-28 13:12:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:39,452 INFO L93 Difference]: Finished difference Result 788 states and 988 transitions. [2018-11-28 13:12:39,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:39,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 13:12:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:39,454 INFO L225 Difference]: With dead ends: 788 [2018-11-28 13:12:39,454 INFO L226 Difference]: Without dead ends: 529 [2018-11-28 13:12:39,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-28 13:12:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-11-28 13:12:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-28 13:12:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 657 transitions. [2018-11-28 13:12:39,483 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 657 transitions. Word has length 68 [2018-11-28 13:12:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:39,483 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 657 transitions. [2018-11-28 13:12:39,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 657 transitions. [2018-11-28 13:12:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:12:39,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:39,484 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] [2018-11-28 13:12:39,485 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:39,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1762057128, now seen corresponding path program 1 times [2018-11-28 13:12:39,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:39,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:39,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:39,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:39,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:39,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:39,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:39,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:39,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:39,529 INFO L87 Difference]: Start difference. First operand 529 states and 657 transitions. Second operand 5 states. [2018-11-28 13:12:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:39,569 INFO L93 Difference]: Finished difference Result 648 states and 797 transitions. [2018-11-28 13:12:39,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:39,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-28 13:12:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:39,571 INFO L225 Difference]: With dead ends: 648 [2018-11-28 13:12:39,571 INFO L226 Difference]: Without dead ends: 535 [2018-11-28 13:12:39,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-28 13:12:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2018-11-28 13:12:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-28 13:12:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 661 transitions. [2018-11-28 13:12:39,599 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 661 transitions. Word has length 63 [2018-11-28 13:12:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:39,599 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 661 transitions. [2018-11-28 13:12:39,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 661 transitions. [2018-11-28 13:12:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:12:39,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:39,601 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] [2018-11-28 13:12:39,601 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:39,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash 517740439, now seen corresponding path program 1 times [2018-11-28 13:12:39,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:39,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:39,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:39,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:39,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:39,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:39,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:39,660 INFO L87 Difference]: Start difference. First operand 533 states and 661 transitions. Second operand 9 states. [2018-11-28 13:12:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:39,719 INFO L93 Difference]: Finished difference Result 666 states and 815 transitions. [2018-11-28 13:12:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:39,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-28 13:12:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:39,722 INFO L225 Difference]: With dead ends: 666 [2018-11-28 13:12:39,722 INFO L226 Difference]: Without dead ends: 535 [2018-11-28 13:12:39,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-28 13:12:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2018-11-28 13:12:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-28 13:12:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 660 transitions. [2018-11-28 13:12:39,752 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 660 transitions. Word has length 63 [2018-11-28 13:12:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:39,752 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 660 transitions. [2018-11-28 13:12:39,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 660 transitions. [2018-11-28 13:12:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:12:39,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:39,754 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:39,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1193132232, now seen corresponding path program 1 times [2018-11-28 13:12:39,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:39,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:39,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:39,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:39,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:12:39,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:39,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:39,781 INFO L87 Difference]: Start difference. First operand 533 states and 660 transitions. Second operand 3 states. [2018-11-28 13:12:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:39,824 INFO L93 Difference]: Finished difference Result 808 states and 1014 transitions. [2018-11-28 13:12:39,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:39,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-28 13:12:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:39,827 INFO L225 Difference]: With dead ends: 808 [2018-11-28 13:12:39,827 INFO L226 Difference]: Without dead ends: 549 [2018-11-28 13:12:39,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-11-28 13:12:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2018-11-28 13:12:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-28 13:12:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 660 transitions. [2018-11-28 13:12:39,855 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 660 transitions. Word has length 71 [2018-11-28 13:12:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:39,855 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 660 transitions. [2018-11-28 13:12:39,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 660 transitions. [2018-11-28 13:12:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:12:39,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:39,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:39,857 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:39,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1107799800, now seen corresponding path program 1 times [2018-11-28 13:12:39,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:39,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:39,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:39,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:39,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:39,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:12:39,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:39,915 INFO L87 Difference]: Start difference. First operand 533 states and 660 transitions. Second operand 6 states. [2018-11-28 13:12:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:39,961 INFO L93 Difference]: Finished difference Result 776 states and 968 transitions. [2018-11-28 13:12:39,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:39,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-28 13:12:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:39,963 INFO L225 Difference]: With dead ends: 776 [2018-11-28 13:12:39,964 INFO L226 Difference]: Without dead ends: 550 [2018-11-28 13:12:39,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-11-28 13:12:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2018-11-28 13:12:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-28 13:12:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 658 transitions. [2018-11-28 13:12:39,992 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 658 transitions. Word has length 71 [2018-11-28 13:12:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:39,992 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 658 transitions. [2018-11-28 13:12:39,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 658 transitions. [2018-11-28 13:12:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:12:39,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:39,993 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] [2018-11-28 13:12:39,993 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:39,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash 848393777, now seen corresponding path program 1 times [2018-11-28 13:12:39,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:39,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:39,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:39,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:40,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:40,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:40,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:40,050 INFO L87 Difference]: Start difference. First operand 533 states and 658 transitions. Second operand 9 states. [2018-11-28 13:12:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:40,163 INFO L93 Difference]: Finished difference Result 550 states and 675 transitions. [2018-11-28 13:12:40,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:40,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-28 13:12:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:40,165 INFO L225 Difference]: With dead ends: 550 [2018-11-28 13:12:40,165 INFO L226 Difference]: Without dead ends: 529 [2018-11-28 13:12:40,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-28 13:12:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-11-28 13:12:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-28 13:12:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 652 transitions. [2018-11-28 13:12:40,190 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 652 transitions. Word has length 63 [2018-11-28 13:12:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:40,190 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 652 transitions. [2018-11-28 13:12:40,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 652 transitions. [2018-11-28 13:12:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:12:40,192 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:40,192 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] [2018-11-28 13:12:40,192 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:40,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1112788646, now seen corresponding path program 1 times [2018-11-28 13:12:40,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:40,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:40,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:40,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:12:40,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:12:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:12:40,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:12:40,262 INFO L87 Difference]: Start difference. First operand 529 states and 652 transitions. Second operand 8 states. [2018-11-28 13:12:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:40,349 INFO L93 Difference]: Finished difference Result 540 states and 662 transitions. [2018-11-28 13:12:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:12:40,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-11-28 13:12:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:40,351 INFO L225 Difference]: With dead ends: 540 [2018-11-28 13:12:40,352 INFO L226 Difference]: Without dead ends: 518 [2018-11-28 13:12:40,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-28 13:12:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2018-11-28 13:12:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-28 13:12:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 637 transitions. [2018-11-28 13:12:40,376 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 637 transitions. Word has length 64 [2018-11-28 13:12:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:40,376 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 637 transitions. [2018-11-28 13:12:40,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:12:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 637 transitions. [2018-11-28 13:12:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:12:40,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:40,377 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] [2018-11-28 13:12:40,378 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:40,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash -757918773, now seen corresponding path program 1 times [2018-11-28 13:12:40,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:40,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:40,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:40,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:40,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:40,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:40,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:40,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:40,429 INFO L87 Difference]: Start difference. First operand 518 states and 637 transitions. Second operand 9 states. [2018-11-28 13:12:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:40,533 INFO L93 Difference]: Finished difference Result 535 states and 654 transitions. [2018-11-28 13:12:40,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:40,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-28 13:12:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:40,535 INFO L225 Difference]: With dead ends: 535 [2018-11-28 13:12:40,535 INFO L226 Difference]: Without dead ends: 513 [2018-11-28 13:12:40,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:40,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-11-28 13:12:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-11-28 13:12:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-28 13:12:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 630 transitions. [2018-11-28 13:12:40,559 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 630 transitions. Word has length 64 [2018-11-28 13:12:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:40,560 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 630 transitions. [2018-11-28 13:12:40,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 630 transitions. [2018-11-28 13:12:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:12:40,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:40,561 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] [2018-11-28 13:12:40,561 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:40,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1688030243, now seen corresponding path program 1 times [2018-11-28 13:12:40,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:40,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:40,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:40,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:40,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:40,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:40,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:40,620 INFO L87 Difference]: Start difference. First operand 513 states and 630 transitions. Second operand 9 states. [2018-11-28 13:12:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:40,721 INFO L93 Difference]: Finished difference Result 530 states and 647 transitions. [2018-11-28 13:12:40,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:40,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-28 13:12:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:40,723 INFO L225 Difference]: With dead ends: 530 [2018-11-28 13:12:40,723 INFO L226 Difference]: Without dead ends: 509 [2018-11-28 13:12:40,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-11-28 13:12:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-11-28 13:12:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-11-28 13:12:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 624 transitions. [2018-11-28 13:12:40,747 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 624 transitions. Word has length 64 [2018-11-28 13:12:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:40,748 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 624 transitions. [2018-11-28 13:12:40,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 624 transitions. [2018-11-28 13:12:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 13:12:40,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:40,749 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-11-28 13:12:40,749 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:40,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash 70476455, now seen corresponding path program 1 times [2018-11-28 13:12:40,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:40,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:40,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:40,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:40,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:40,820 INFO L87 Difference]: Start difference. First operand 509 states and 624 transitions. Second operand 5 states. [2018-11-28 13:12:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:41,075 INFO L93 Difference]: Finished difference Result 878 states and 1083 transitions. [2018-11-28 13:12:41,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:41,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-28 13:12:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:41,078 INFO L225 Difference]: With dead ends: 878 [2018-11-28 13:12:41,078 INFO L226 Difference]: Without dead ends: 625 [2018-11-28 13:12:41,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:12:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-28 13:12:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 583. [2018-11-28 13:12:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-11-28 13:12:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 718 transitions. [2018-11-28 13:12:41,110 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 718 transitions. Word has length 70 [2018-11-28 13:12:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:41,110 INFO L480 AbstractCegarLoop]: Abstraction has 583 states and 718 transitions. [2018-11-28 13:12:41,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2018-11-28 13:12:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:12:41,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:41,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:41,112 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:41,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:41,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1382250420, now seen corresponding path program 1 times [2018-11-28 13:12:41,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:41,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:41,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:41,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:41,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:41,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:41,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:41,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:41,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:41,165 INFO L87 Difference]: Start difference. First operand 583 states and 718 transitions. Second operand 9 states. [2018-11-28 13:12:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:41,282 INFO L93 Difference]: Finished difference Result 600 states and 735 transitions. [2018-11-28 13:12:41,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:41,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-28 13:12:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:41,285 INFO L225 Difference]: With dead ends: 600 [2018-11-28 13:12:41,285 INFO L226 Difference]: Without dead ends: 557 [2018-11-28 13:12:41,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-11-28 13:12:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-11-28 13:12:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-11-28 13:12:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 686 transitions. [2018-11-28 13:12:41,314 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 686 transitions. Word has length 68 [2018-11-28 13:12:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:41,314 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 686 transitions. [2018-11-28 13:12:41,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 686 transitions. [2018-11-28 13:12:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 13:12:41,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:41,316 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] [2018-11-28 13:12:41,316 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:41,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1735546476, now seen corresponding path program 1 times [2018-11-28 13:12:41,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:41,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:41,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:41,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:41,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:41,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:41,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:41,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:41,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:41,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:41,389 INFO L87 Difference]: Start difference. First operand 557 states and 686 transitions. Second operand 9 states. [2018-11-28 13:12:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:41,444 INFO L93 Difference]: Finished difference Result 592 states and 726 transitions. [2018-11-28 13:12:41,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:41,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-28 13:12:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:41,447 INFO L225 Difference]: With dead ends: 592 [2018-11-28 13:12:41,447 INFO L226 Difference]: Without dead ends: 565 [2018-11-28 13:12:41,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-11-28 13:12:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2018-11-28 13:12:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-28 13:12:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 693 transitions. [2018-11-28 13:12:41,482 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 693 transitions. Word has length 76 [2018-11-28 13:12:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:41,482 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 693 transitions. [2018-11-28 13:12:41,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 693 transitions. [2018-11-28 13:12:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 13:12:41,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:41,484 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] [2018-11-28 13:12:41,484 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:41,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1846504819, now seen corresponding path program 1 times [2018-11-28 13:12:41,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:41,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:41,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:41,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:41,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:41,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:41,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:41,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:41,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:41,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:41,522 INFO L87 Difference]: Start difference. First operand 563 states and 693 transitions. Second operand 5 states. [2018-11-28 13:12:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:41,566 INFO L93 Difference]: Finished difference Result 657 states and 801 transitions. [2018-11-28 13:12:41,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:41,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 13:12:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:41,569 INFO L225 Difference]: With dead ends: 657 [2018-11-28 13:12:41,569 INFO L226 Difference]: Without dead ends: 510 [2018-11-28 13:12:41,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-28 13:12:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-11-28 13:12:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-11-28 13:12:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 624 transitions. [2018-11-28 13:12:41,623 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 624 transitions. Word has length 76 [2018-11-28 13:12:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:41,623 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 624 transitions. [2018-11-28 13:12:41,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 624 transitions. [2018-11-28 13:12:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:12:41,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:41,624 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] [2018-11-28 13:12:41,625 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:41,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1102145568, now seen corresponding path program 1 times [2018-11-28 13:12:41,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:41,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:41,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:41,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:41,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:41,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:12:41,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:12:41,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:12:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:41,682 INFO L87 Difference]: Start difference. First operand 510 states and 624 transitions. Second operand 7 states. [2018-11-28 13:12:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:42,108 INFO L93 Difference]: Finished difference Result 814 states and 1002 transitions. [2018-11-28 13:12:42,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:12:42,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-28 13:12:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:42,110 INFO L225 Difference]: With dead ends: 814 [2018-11-28 13:12:42,111 INFO L226 Difference]: Without dead ends: 505 [2018-11-28 13:12:42,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:12:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-28 13:12:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2018-11-28 13:12:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-28 13:12:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 599 transitions. [2018-11-28 13:12:42,141 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 599 transitions. Word has length 82 [2018-11-28 13:12:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:42,142 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 599 transitions. [2018-11-28 13:12:42,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:12:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 599 transitions. [2018-11-28 13:12:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 13:12:42,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:42,143 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] [2018-11-28 13:12:42,143 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:42,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1177659047, now seen corresponding path program 1 times [2018-11-28 13:12:42,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:42,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:42,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:42,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:12:42,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:42,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:42,198 INFO L87 Difference]: Start difference. First operand 494 states and 599 transitions. Second operand 6 states. [2018-11-28 13:12:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:42,250 INFO L93 Difference]: Finished difference Result 801 states and 999 transitions. [2018-11-28 13:12:42,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:42,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-28 13:12:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:42,253 INFO L225 Difference]: With dead ends: 801 [2018-11-28 13:12:42,253 INFO L226 Difference]: Without dead ends: 547 [2018-11-28 13:12:42,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-11-28 13:12:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 460. [2018-11-28 13:12:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-28 13:12:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 555 transitions. [2018-11-28 13:12:42,281 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 555 transitions. Word has length 83 [2018-11-28 13:12:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:42,282 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 555 transitions. [2018-11-28 13:12:42,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 555 transitions. [2018-11-28 13:12:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:12:42,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:42,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:42,283 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:42,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:42,283 INFO L82 PathProgramCache]: Analyzing trace with hash 583311642, now seen corresponding path program 1 times [2018-11-28 13:12:42,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:42,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:42,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:42,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:42,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:42,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:42,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:42,332 INFO L87 Difference]: Start difference. First operand 460 states and 555 transitions. Second operand 5 states. [2018-11-28 13:12:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:42,575 INFO L93 Difference]: Finished difference Result 880 states and 1043 transitions. [2018-11-28 13:12:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:42,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-28 13:12:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:42,577 INFO L225 Difference]: With dead ends: 880 [2018-11-28 13:12:42,577 INFO L226 Difference]: Without dead ends: 561 [2018-11-28 13:12:42,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-11-28 13:12:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 538. [2018-11-28 13:12:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-11-28 13:12:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 637 transitions. [2018-11-28 13:12:42,609 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 637 transitions. Word has length 78 [2018-11-28 13:12:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:42,609 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 637 transitions. [2018-11-28 13:12:42,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 637 transitions. [2018-11-28 13:12:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 13:12:42,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:42,610 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] [2018-11-28 13:12:42,611 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:42,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash -561171894, now seen corresponding path program 1 times [2018-11-28 13:12:42,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:42,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:42,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:42,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:42,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:42,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:42,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:42,664 INFO L87 Difference]: Start difference. First operand 538 states and 637 transitions. Second operand 9 states. [2018-11-28 13:12:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:42,760 INFO L93 Difference]: Finished difference Result 540 states and 638 transitions. [2018-11-28 13:12:42,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:42,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-28 13:12:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:42,762 INFO L225 Difference]: With dead ends: 540 [2018-11-28 13:12:42,762 INFO L226 Difference]: Without dead ends: 449 [2018-11-28 13:12:42,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-28 13:12:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-11-28 13:12:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-28 13:12:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 535 transitions. [2018-11-28 13:12:42,789 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 535 transitions. Word has length 81 [2018-11-28 13:12:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:42,789 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 535 transitions. [2018-11-28 13:12:42,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 535 transitions. [2018-11-28 13:12:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 13:12:42,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:42,791 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] [2018-11-28 13:12:42,791 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:42,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1831635273, now seen corresponding path program 1 times [2018-11-28 13:12:42,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:42,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:42,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:42,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:42,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:42,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:42,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:42,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:42,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:42,853 INFO L87 Difference]: Start difference. First operand 449 states and 535 transitions. Second operand 9 states. [2018-11-28 13:12:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:42,926 INFO L93 Difference]: Finished difference Result 470 states and 557 transitions. [2018-11-28 13:12:42,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:42,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-28 13:12:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:42,929 INFO L225 Difference]: With dead ends: 470 [2018-11-28 13:12:42,929 INFO L226 Difference]: Without dead ends: 449 [2018-11-28 13:12:42,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:12:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-28 13:12:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-11-28 13:12:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-28 13:12:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 534 transitions. [2018-11-28 13:12:42,956 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 534 transitions. Word has length 88 [2018-11-28 13:12:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:42,956 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 534 transitions. [2018-11-28 13:12:42,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 534 transitions. [2018-11-28 13:12:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:12:42,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:42,957 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] [2018-11-28 13:12:42,957 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:42,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1636495317, now seen corresponding path program 1 times [2018-11-28 13:12:42,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:42,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:43,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:43,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:12:43,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:43,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:43,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:43,012 INFO L87 Difference]: Start difference. First operand 449 states and 534 transitions. Second operand 6 states. [2018-11-28 13:12:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:43,081 INFO L93 Difference]: Finished difference Result 482 states and 566 transitions. [2018-11-28 13:12:43,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:43,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-28 13:12:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:43,083 INFO L225 Difference]: With dead ends: 482 [2018-11-28 13:12:43,083 INFO L226 Difference]: Without dead ends: 443 [2018-11-28 13:12:43,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-28 13:12:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 390. [2018-11-28 13:12:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-28 13:12:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 458 transitions. [2018-11-28 13:12:43,106 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 458 transitions. Word has length 99 [2018-11-28 13:12:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:43,107 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 458 transitions. [2018-11-28 13:12:43,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 458 transitions. [2018-11-28 13:12:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:12:43,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:43,108 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] [2018-11-28 13:12:43,108 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:43,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash -363913567, now seen corresponding path program 1 times [2018-11-28 13:12:43,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:43,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:43,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:43,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:43,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:43,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:12:43,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:12:43,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:12:43,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:43,150 INFO L87 Difference]: Start difference. First operand 390 states and 458 transitions. Second operand 7 states. [2018-11-28 13:12:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:43,258 INFO L93 Difference]: Finished difference Result 736 states and 870 transitions. [2018-11-28 13:12:43,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:43,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-28 13:12:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:43,261 INFO L225 Difference]: With dead ends: 736 [2018-11-28 13:12:43,261 INFO L226 Difference]: Without dead ends: 691 [2018-11-28 13:12:43,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-11-28 13:12:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 370. [2018-11-28 13:12:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-28 13:12:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 433 transitions. [2018-11-28 13:12:43,287 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 433 transitions. Word has length 99 [2018-11-28 13:12:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:43,287 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 433 transitions. [2018-11-28 13:12:43,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:12:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 433 transitions. [2018-11-28 13:12:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:12:43,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:43,289 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, 1, 1, 1] [2018-11-28 13:12:43,289 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:43,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1119440733, now seen corresponding path program 1 times [2018-11-28 13:12:43,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:43,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:43,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:43,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:43,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:12:43,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:12:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:12:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:43,364 INFO L87 Difference]: Start difference. First operand 370 states and 433 transitions. Second operand 11 states. [2018-11-28 13:12:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:43,439 INFO L93 Difference]: Finished difference Result 515 states and 607 transitions. [2018-11-28 13:12:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:12:43,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2018-11-28 13:12:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:43,441 INFO L225 Difference]: With dead ends: 515 [2018-11-28 13:12:43,442 INFO L226 Difference]: Without dead ends: 366 [2018-11-28 13:12:43,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:12:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-28 13:12:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2018-11-28 13:12:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-11-28 13:12:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 410 transitions. [2018-11-28 13:12:43,466 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 410 transitions. Word has length 104 [2018-11-28 13:12:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:43,466 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 410 transitions. [2018-11-28 13:12:43,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:12:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 410 transitions. [2018-11-28 13:12:43,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 13:12:43,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:43,467 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, 1, 1, 1] [2018-11-28 13:12:43,468 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:43,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1545373669, now seen corresponding path program 1 times [2018-11-28 13:12:43,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:43,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:43,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:12:43,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:43,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:12:43,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:43,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:43,526 INFO L87 Difference]: Start difference. First operand 353 states and 410 transitions. Second operand 6 states. [2018-11-28 13:12:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:43,558 INFO L93 Difference]: Finished difference Result 381 states and 437 transitions. [2018-11-28 13:12:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:43,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-28 13:12:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:43,560 INFO L225 Difference]: With dead ends: 381 [2018-11-28 13:12:43,560 INFO L226 Difference]: Without dead ends: 305 [2018-11-28 13:12:43,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-28 13:12:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2018-11-28 13:12:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-28 13:12:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2018-11-28 13:12:43,577 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 113 [2018-11-28 13:12:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:43,578 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2018-11-28 13:12:43,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2018-11-28 13:12:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-28 13:12:43,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:43,579 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] [2018-11-28 13:12:43,579 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:43,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash 268673567, now seen corresponding path program 1 times [2018-11-28 13:12:43,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:43,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:43,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:43,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 13:12:43,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:43,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:43,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:43,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:43,649 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand 9 states. [2018-11-28 13:12:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:43,710 INFO L93 Difference]: Finished difference Result 316 states and 358 transitions. [2018-11-28 13:12:43,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:43,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-11-28 13:12:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:43,712 INFO L225 Difference]: With dead ends: 316 [2018-11-28 13:12:43,712 INFO L226 Difference]: Without dead ends: 287 [2018-11-28 13:12:43,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-28 13:12:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2018-11-28 13:12:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-28 13:12:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 295 transitions. [2018-11-28 13:12:43,731 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 295 transitions. Word has length 134 [2018-11-28 13:12:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:43,731 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 295 transitions. [2018-11-28 13:12:43,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 295 transitions. [2018-11-28 13:12:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-28 13:12:43,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:43,733 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] [2018-11-28 13:12:43,733 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:43,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash 13585617, now seen corresponding path program 1 times [2018-11-28 13:12:43,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:43,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:43,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:43,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 13:12:43,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:43,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:43,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:43,803 INFO L87 Difference]: Start difference. First operand 263 states and 295 transitions. Second operand 9 states. [2018-11-28 13:12:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:43,862 INFO L93 Difference]: Finished difference Result 338 states and 379 transitions. [2018-11-28 13:12:43,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:43,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-11-28 13:12:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:43,864 INFO L225 Difference]: With dead ends: 338 [2018-11-28 13:12:43,864 INFO L226 Difference]: Without dead ends: 267 [2018-11-28 13:12:43,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-28 13:12:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2018-11-28 13:12:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-28 13:12:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 270 transitions. [2018-11-28 13:12:43,882 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 270 transitions. Word has length 135 [2018-11-28 13:12:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:43,882 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 270 transitions. [2018-11-28 13:12:43,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 270 transitions. [2018-11-28 13:12:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-28 13:12:43,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:43,884 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:43,884 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:43,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:43,884 INFO L82 PathProgramCache]: Analyzing trace with hash -834804230, now seen corresponding path program 1 times [2018-11-28 13:12:43,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:43,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 13:12:43,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:43,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:43,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:43,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:43,936 INFO L87 Difference]: Start difference. First operand 245 states and 270 transitions. Second operand 5 states. [2018-11-28 13:12:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:43,961 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2018-11-28 13:12:43,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:43,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-11-28 13:12:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:43,964 INFO L225 Difference]: With dead ends: 281 [2018-11-28 13:12:43,964 INFO L226 Difference]: Without dead ends: 251 [2018-11-28 13:12:43,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-28 13:12:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-11-28 13:12:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-28 13:12:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2018-11-28 13:12:43,981 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 150 [2018-11-28 13:12:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:43,982 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2018-11-28 13:12:43,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2018-11-28 13:12:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-28 13:12:43,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:43,983 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:43,983 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:43,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash -653317733, now seen corresponding path program 1 times [2018-11-28 13:12:43,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:43,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:43,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:43,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 13:12:44,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:44,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 13:12:44,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 13:12:44,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 13:12:44,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:12:44,113 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand 15 states. [2018-11-28 13:12:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:44,255 INFO L93 Difference]: Finished difference Result 315 states and 354 transitions. [2018-11-28 13:12:44,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:12:44,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2018-11-28 13:12:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:44,258 INFO L225 Difference]: With dead ends: 315 [2018-11-28 13:12:44,258 INFO L226 Difference]: Without dead ends: 280 [2018-11-28 13:12:44,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:12:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-28 13:12:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 266. [2018-11-28 13:12:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 13:12:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 295 transitions. [2018-11-28 13:12:44,284 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 295 transitions. Word has length 150 [2018-11-28 13:12:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:44,284 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 295 transitions. [2018-11-28 13:12:44,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 13:12:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 295 transitions. [2018-11-28 13:12:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-28 13:12:44,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:44,286 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] [2018-11-28 13:12:44,287 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:44,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:44,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1218236339, now seen corresponding path program 1 times [2018-11-28 13:12:44,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:44,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:44,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:44,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:12:44,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:44,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:12:44,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:12:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:12:44,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:12:44,387 INFO L87 Difference]: Start difference. First operand 266 states and 295 transitions. Second operand 9 states. [2018-11-28 13:12:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:44,536 INFO L93 Difference]: Finished difference Result 355 states and 396 transitions. [2018-11-28 13:12:44,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:12:44,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2018-11-28 13:12:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:44,539 INFO L225 Difference]: With dead ends: 355 [2018-11-28 13:12:44,539 INFO L226 Difference]: Without dead ends: 274 [2018-11-28 13:12:44,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:12:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-28 13:12:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2018-11-28 13:12:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 13:12:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 294 transitions. [2018-11-28 13:12:44,568 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 294 transitions. Word has length 151 [2018-11-28 13:12:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:44,569 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 294 transitions. [2018-11-28 13:12:44,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:12:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 294 transitions. [2018-11-28 13:12:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-28 13:12:44,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:44,570 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:44,570 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:44,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1765810406, now seen corresponding path program 1 times [2018-11-28 13:12:44,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:44,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:44,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:44,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:44,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 13:12:44,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:12:44,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:12:44,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:44,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:12:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 13:12:45,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:12:45,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-11-28 13:12:45,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 13:12:45,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 13:12:45,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:12:45,094 INFO L87 Difference]: Start difference. First operand 266 states and 294 transitions. Second operand 21 states. [2018-11-28 13:12:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:45,358 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2018-11-28 13:12:45,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:12:45,359 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2018-11-28 13:12:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:45,361 INFO L225 Difference]: With dead ends: 311 [2018-11-28 13:12:45,361 INFO L226 Difference]: Without dead ends: 270 [2018-11-28 13:12:45,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-11-28 13:12:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-28 13:12:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-11-28 13:12:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 13:12:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2018-11-28 13:12:45,402 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 153 [2018-11-28 13:12:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:45,402 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2018-11-28 13:12:45,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 13:12:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2018-11-28 13:12:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-28 13:12:45,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:45,404 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, 1] [2018-11-28 13:12:45,404 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:45,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 244162299, now seen corresponding path program 1 times [2018-11-28 13:12:45,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:45,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:45,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:45,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:45,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 13:12:45,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:12:45,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:12:45,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:45,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:12:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 13:12:45,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:12:45,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-28 13:12:45,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:12:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:12:45,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:12:45,823 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 14 states. [2018-11-28 13:12:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:46,098 INFO L93 Difference]: Finished difference Result 321 states and 350 transitions. [2018-11-28 13:12:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:12:46,100 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2018-11-28 13:12:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:46,101 INFO L225 Difference]: With dead ends: 321 [2018-11-28 13:12:46,101 INFO L226 Difference]: Without dead ends: 246 [2018-11-28 13:12:46,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:12:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-28 13:12:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 232. [2018-11-28 13:12:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-28 13:12:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-11-28 13:12:46,136 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 158 [2018-11-28 13:12:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:46,136 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-11-28 13:12:46,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:12:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-11-28 13:12:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-28 13:12:46,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:46,138 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, 1, 1, 1] [2018-11-28 13:12:46,138 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:46,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1521484890, now seen corresponding path program 1 times [2018-11-28 13:12:46,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:46,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 13:12:46,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:46,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:12:46,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:46,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:46,220 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 6 states. [2018-11-28 13:12:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:46,290 INFO L93 Difference]: Finished difference Result 322 states and 349 transitions. [2018-11-28 13:12:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:46,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-11-28 13:12:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:46,291 INFO L225 Difference]: With dead ends: 322 [2018-11-28 13:12:46,291 INFO L226 Difference]: Without dead ends: 237 [2018-11-28 13:12:46,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-28 13:12:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2018-11-28 13:12:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-28 13:12:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2018-11-28 13:12:46,324 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 160 [2018-11-28 13:12:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:46,324 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2018-11-28 13:12:46,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2018-11-28 13:12:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-28 13:12:46,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:46,325 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, 1, 1, 1] [2018-11-28 13:12:46,326 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:46,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:46,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1127797900, now seen corresponding path program 1 times [2018-11-28 13:12:46,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:46,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:46,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:46,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 13:12:46,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:12:46,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:12:46,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:12:46,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:12:46,446 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 10 states. [2018-11-28 13:12:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:47,056 INFO L93 Difference]: Finished difference Result 456 states and 493 transitions. [2018-11-28 13:12:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:12:47,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-11-28 13:12:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:47,058 INFO L225 Difference]: With dead ends: 456 [2018-11-28 13:12:47,058 INFO L226 Difference]: Without dead ends: 234 [2018-11-28 13:12:47,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-11-28 13:12:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-28 13:12:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-11-28 13:12:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-28 13:12:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 248 transitions. [2018-11-28 13:12:47,093 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 248 transitions. Word has length 161 [2018-11-28 13:12:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:47,093 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 248 transitions. [2018-11-28 13:12:47,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:12:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 248 transitions. [2018-11-28 13:12:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-28 13:12:47,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:47,099 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, 1, 1, 1] [2018-11-28 13:12:47,100 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:12:47,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash 204630474, now seen corresponding path program 1 times [2018-11-28 13:12:47,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:47,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:47,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:47,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:47,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 13:12:47,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:12:47,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:12:47,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:47,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:12:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:12:47,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:12:47,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-11-28 13:12:47,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:12:47,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:12:47,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:12:47,783 INFO L87 Difference]: Start difference. First operand 231 states and 248 transitions. Second operand 19 states. [2018-11-28 13:12:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:48,744 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2018-11-28 13:12:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 13:12:48,744 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 161 [2018-11-28 13:12:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:48,744 INFO L225 Difference]: With dead ends: 302 [2018-11-28 13:12:48,744 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:12:48,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 13:12:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:12:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:12:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:12:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:12:48,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2018-11-28 13:12:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:48,746 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:12:48,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:12:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:12:48,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:12:48,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 13:12:49,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:49,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:12:50,794 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 68 [2018-11-28 13:12:50,920 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2018-11-28 13:12:51,276 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-11-28 13:12:51,417 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 68 [2018-11-28 13:12:51,634 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 71 [2018-11-28 13:12:51,911 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 61 [2018-11-28 13:12:52,325 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 96 [2018-11-28 13:12:52,933 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 104 [2018-11-28 13:12:53,369 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-11-28 13:12:53,677 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 95 [2018-11-28 13:12:53,846 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 68 [2018-11-28 13:12:54,022 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2018-11-28 13:12:54,286 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2018-11-28 13:12:54,688 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2018-11-28 13:12:55,052 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 100 [2018-11-28 13:12:55,171 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2018-11-28 13:12:55,601 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 84 [2018-11-28 13:12:56,338 WARN L180 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 117 [2018-11-28 13:12:56,629 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2018-11-28 13:12:57,109 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 87 [2018-11-28 13:12:57,329 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2018-11-28 13:12:57,732 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 89 [2018-11-28 13:12:57,947 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2018-11-28 13:12:58,295 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 87 [2018-11-28 13:12:58,736 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2018-11-28 13:12:59,218 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2018-11-28 13:12:59,467 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 74 [2018-11-28 13:12:59,725 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2018-11-28 13:13:00,050 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 82 [2018-11-28 13:13:00,289 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 68 [2018-11-28 13:13:00,442 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63 [2018-11-28 13:13:00,591 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-11-28 13:13:00,944 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2018-11-28 13:13:01,750 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2018-11-28 13:13:02,177 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2018-11-28 13:13:02,331 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-11-28 13:13:02,861 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-11-28 13:13:03,024 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2018-11-28 13:13:03,409 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 89 [2018-11-28 13:13:03,621 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 63 [2018-11-28 13:13:04,000 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2018-11-28 13:13:04,394 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2018-11-28 13:13:04,826 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2018-11-28 13:13:04,862 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 908 929) no Hoare annotation was computed. [2018-11-28 13:13:04,862 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2018-11-28 13:13:04,863 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2018-11-28 13:13:04,863 INFO L451 ceAbstractionStarter]: At program point L918(lines 917 927) the Hoare annotation is: true [2018-11-28 13:13:04,863 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 919 926) no Hoare annotation was computed. [2018-11-28 13:13:04,863 INFO L451 ceAbstractionStarter]: At program point L916(lines 915 927) the Hoare annotation is: true [2018-11-28 13:13:04,863 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 927) no Hoare annotation was computed. [2018-11-28 13:13:04,863 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 919 926) no Hoare annotation was computed. [2018-11-28 13:13:04,863 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 66 86) no Hoare annotation was computed. [2018-11-28 13:13:04,863 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 66 86) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (< 0 ~MaximumInterfaceType~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,863 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2018-11-28 13:13:04,864 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2018-11-28 13:13:04,864 INFO L451 ceAbstractionStarter]: At program point L939(lines 938 948) the Hoare annotation is: true [2018-11-28 13:13:04,864 INFO L451 ceAbstractionStarter]: At program point L937(lines 936 948) the Hoare annotation is: true [2018-11-28 13:13:04,864 INFO L448 ceAbstractionStarter]: For program point L936(lines 936 948) no Hoare annotation was computed. [2018-11-28 13:13:04,864 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2018-11-28 13:13:04,864 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 940 947) no Hoare annotation was computed. [2018-11-28 13:13:04,864 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 930 950) no Hoare annotation was computed. [2018-11-28 13:13:04,864 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 940 947) no Hoare annotation was computed. [2018-11-28 13:13:04,864 INFO L444 ceAbstractionStarter]: At program point L225(lines 224 419) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,865 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-11-28 13:13:04,865 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 194) no Hoare annotation was computed. [2018-11-28 13:13:04,865 INFO L444 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (<= FloppyPnp_~__cil_tmp30~0 259) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 259 FloppyPnp_~__cil_tmp30~0) (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-28 13:13:04,865 INFO L448 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2018-11-28 13:13:04,865 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2018-11-28 13:13:04,865 INFO L448 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2018-11-28 13:13:04,865 INFO L444 ceAbstractionStarter]: At program point L325(line 325) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-28 13:13:04,865 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2018-11-28 13:13:04,865 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2018-11-28 13:13:04,866 INFO L444 ceAbstractionStarter]: At program point L408(line 408) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-28 13:13:04,866 INFO L448 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2018-11-28 13:13:04,866 INFO L444 ceAbstractionStarter]: At program point L243(line 243) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-28 13:13:04,866 INFO L448 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2018-11-28 13:13:04,866 INFO L444 ceAbstractionStarter]: At program point L202(line 202) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-28 13:13:04,866 INFO L448 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2018-11-28 13:13:04,866 INFO L448 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2018-11-28 13:13:04,866 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 228 418) no Hoare annotation was computed. [2018-11-28 13:13:04,866 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 228 418) no Hoare annotation was computed. [2018-11-28 13:13:04,867 INFO L444 ceAbstractionStarter]: At program point L392(lines 392 393) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-28 13:13:04,867 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2018-11-28 13:13:04,867 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2018-11-28 13:13:04,867 INFO L444 ceAbstractionStarter]: At program point L227(lines 226 419) 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) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,867 INFO L444 ceAbstractionStarter]: At program point L417(lines 228 418) the Hoare annotation is: (let ((.cse9 (= ~SKIP2~0 ~s~0)) (.cse11 (= 0 ~pended~0)) (.cse12 (= ~DC~0 ~s~0)) (.cse8 (= 0 ~compRegistered~0)) (.cse10 (= ~pended~0 1))) (let ((.cse0 (and .cse12 .cse8 .cse10)) (.cse1 (and (= ~s~0 ~NP~0) .cse8 .cse10)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and .cse8 .cse10 (= ~IPC~0 ~s~0))) (.cse4 (and (and .cse12 .cse11) (not (= 259 FloppyPnp_~ntStatus~0)))) (.cse5 (and .cse11 .cse9 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (<= ~compRegistered~0 0))) (.cse6 (and .cse8 .cse9 .cse10)) (.cse7 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-11-28 13:13:04,868 INFO L444 ceAbstractionStarter]: At program point L351(line 351) the Hoare annotation is: (let ((.cse4 (and (= 0 ~pended~0) (<= 1 ~compRegistered~0))) (.cse5 (<= ~s~0 1)) (.cse6 (<= 1 ~s~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7)) (.cse1 (and (not (= 259 FloppyPnp_~ntStatus~0)) .cse4 .cse5 .cse6 .cse7 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3)))) [2018-11-28 13:13:04,868 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2018-11-28 13:13:04,868 INFO L444 ceAbstractionStarter]: At program point L219(lines 215 422) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-28 13:13:04,868 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2018-11-28 13:13:04,868 INFO L444 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,868 INFO L448 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2018-11-28 13:13:04,868 INFO L444 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,868 INFO L448 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2018-11-28 13:13:04,869 INFO L444 ceAbstractionStarter]: At program point L261(lines 261 262) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse4 (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and .cse4 (= |old(~s~0)| ~s~0) (= ~pended~0 1))) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,869 INFO L448 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2018-11-28 13:13:04,869 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2018-11-28 13:13:04,869 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2018-11-28 13:13:04,869 INFO L444 ceAbstractionStarter]: At program point L369(line 369) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,869 INFO L448 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2018-11-28 13:13:04,869 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2018-11-28 13:13:04,869 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2018-11-28 13:13:04,869 INFO L448 ceAbstractionStarter]: For program point L427-2(lines 427 429) no Hoare annotation was computed. [2018-11-28 13:13:04,870 INFO L444 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-28 13:13:04,870 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 420) no Hoare annotation was computed. [2018-11-28 13:13:04,870 INFO L444 ceAbstractionStarter]: At program point L213(lines 209 424) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-28 13:13:04,870 INFO L444 ceAbstractionStarter]: At program point L304(line 304) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-28 13:13:04,870 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2018-11-28 13:13:04,870 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2018-11-28 13:13:04,870 INFO L444 ceAbstractionStarter]: At program point L288(line 288) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0))) (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~pended~0) .cse4 (= |old(~s~0)| ~s~0))) (.cse1 (and (= ~s~0 ~NP~0) .cse4 (= ~pended~0 1))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,871 INFO L444 ceAbstractionStarter]: At program point L255(line 255) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-28 13:13:04,871 INFO L444 ceAbstractionStarter]: At program point L222(lines 221 420) 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) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,871 INFO L448 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2018-11-28 13:13:04,871 INFO L444 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0)) (.cse5 (= ~s~0 ~SKIP1~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse4 .cse5 (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and .cse4 (= ~pended~0 1) .cse5)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3)))) [2018-11-28 13:13:04,871 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-28 13:13:04,871 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2018-11-28 13:13:04,871 INFO L448 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2018-11-28 13:13:04,871 INFO L444 ceAbstractionStarter]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-28 13:13:04,872 INFO L448 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2018-11-28 13:13:04,872 INFO L448 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2018-11-28 13:13:04,872 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-28 13:13:04,872 INFO L448 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-11-28 13:13:04,872 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 264 266) no Hoare annotation was computed. [2018-11-28 13:13:04,872 INFO L444 ceAbstractionStarter]: At program point L388(line 388) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,872 INFO L448 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2018-11-28 13:13:04,872 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2018-11-28 13:13:04,872 INFO L444 ceAbstractionStarter]: At program point L380(line 380) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-28 13:13:04,872 INFO L448 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2018-11-28 13:13:04,873 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2018-11-28 13:13:04,873 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2018-11-28 13:13:04,873 INFO L448 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2018-11-28 13:13:04,873 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 425) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (= |old(~s~0)| ~s~0)) (.cse5 (= 0 FloppyPnp_~ntStatus~0)) (.cse6 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and .cse1 .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4 .cse5) .cse6) (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4 .cse5) .cse6))) [2018-11-28 13:13:04,873 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2018-11-28 13:13:04,873 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2018-11-28 13:13:04,873 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 419) no Hoare annotation was computed. [2018-11-28 13:13:04,873 INFO L444 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,873 INFO L448 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2018-11-28 13:13:04,874 INFO L444 ceAbstractionStarter]: At program point L249(line 249) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-11-28 13:13:04,874 INFO L448 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2018-11-28 13:13:04,874 INFO L444 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-11-28 13:13:04,874 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2018-11-28 13:13:04,874 INFO L448 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2018-11-28 13:13:04,874 INFO L444 ceAbstractionStarter]: At program point L398(line 398) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-28 13:13:04,874 INFO L448 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2018-11-28 13:13:04,874 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2018-11-28 13:13:04,874 INFO L448 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2018-11-28 13:13:04,874 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 159 432) the Hoare annotation is: (let ((.cse5 (< 0 ~MaximumInterfaceType~0)) (.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (and .cse0 .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse5 (and .cse0 .cse1 (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3 .cse4) .cse6))) [2018-11-28 13:13:04,875 INFO L444 ceAbstractionStarter]: At program point L704(line 704) the Hoare annotation is: (or (and (= main_~status~1 ~lowerDriverReturn~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 main_~status~1) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 814) no Hoare annotation was computed. [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2018-11-28 13:13:04,875 INFO L444 ceAbstractionStarter]: At program point L730(lines 729 777) 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)|)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 main_~status~1)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2018-11-28 13:13:04,875 INFO L444 ceAbstractionStarter]: At program point L747(lines 746 774) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,875 INFO L448 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2018-11-28 13:13:04,876 INFO L444 ceAbstractionStarter]: At program point L706(lines 700 837) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse7 (= main_~status~1 ~lowerDriverReturn~0)) (.cse8 (= 0 ~pended~0)) (.cse12 (= 0 main_~status~1)) (.cse11 (<= ~compRegistered~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~pended~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse11) (and .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse12) (and (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse12 .cse6 .cse11) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse12 .cse11) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-28 13:13:04,876 INFO L448 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2018-11-28 13:13:04,876 INFO L448 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2018-11-28 13:13:04,876 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 748 773) no Hoare annotation was computed. [2018-11-28 13:13:04,876 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 748 773) no Hoare annotation was computed. [2018-11-28 13:13:04,876 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2018-11-28 13:13:04,876 INFO L448 ceAbstractionStarter]: For program point L715(lines 715 718) no Hoare annotation was computed. [2018-11-28 13:13:04,876 INFO L444 ceAbstractionStarter]: At program point L715-2(lines 715 718) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= ~s~0 1)) (.cse5 (<= ~MPR3~0 6)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (<= 6 ~MPR3~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= 0 main_~status~1)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (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)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-28 13:13:04,876 INFO L444 ceAbstractionStarter]: At program point L740(lines 739 775) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= 0 main_~status~1) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,876 INFO L448 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2018-11-28 13:13:04,877 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 666 838) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,877 INFO L448 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2018-11-28 13:13:04,877 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2018-11-28 13:13:04,877 INFO L448 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2018-11-28 13:13:04,877 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2018-11-28 13:13:04,877 INFO L448 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2018-11-28 13:13:04,877 INFO L444 ceAbstractionStarter]: At program point L825(line 825) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,877 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2018-11-28 13:13:04,877 INFO L448 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2018-11-28 13:13:04,877 INFO L444 ceAbstractionStarter]: At program point L801(line 801) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,877 INFO L444 ceAbstractionStarter]: At program point L735(lines 734 776) 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)|)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 main_~status~1)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,878 INFO L444 ceAbstractionStarter]: At program point L810(lines 797 830) the Hoare annotation is: (let ((.cse5 (= ~DC~0 ~s~0)) (.cse6 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse1 (and .cse5 .cse6 .cse7 .cse8))) (let ((.cse3 (or .cse1 (and (= main_~status~1 ~lowerDriverReturn~0) .cse6 .cse7 .cse8 (<= ~compRegistered~0 0))))) (let ((.cse4 (= 0 main_~status~1)) (.cse2 (not (= 259 main_~status~1))) (.cse0 (and (<= (+ ~NP~0 2) ~SKIP1~0) (and .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0))))) (or (and .cse0 (<= (+ main_~status~1 1073741536) 0)) (and .cse1 .cse2) (not (= |old(~myStatus~0)| 0)) (and .cse3 .cse4) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse5 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (and (and (and (<= 1 ~NP~0) .cse0) (<= ~MPR3~0 6)) .cse2) (not (= |old(~compRegistered~0)| 0)) (and (<= ~SKIP2~0 ~s~0) .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse6 .cse7 .cse8 (= ~pended~0 1)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)))))) [2018-11-28 13:13:04,878 INFO L448 ceAbstractionStarter]: For program point L744(lines 744 774) no Hoare annotation was computed. [2018-11-28 13:13:04,878 INFO L444 ceAbstractionStarter]: At program point L794(lines 787 833) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse7 (= ~pended~0 1)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 main_~status~1)) (.cse10 (= ~IPC~0 ~s~0)) (.cse8 (<= ~compRegistered~0 0))) (or (and (and .cse0 .cse1 .cse2 .cse3) (not (= 259 main_~status~1))) (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 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse5 .cse6 (or (and .cse1 .cse2 .cse3 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse8))) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse7 .cse10) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse9 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (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 .cse9 .cse1 .cse2 .cse3 .cse4 .cse10 .cse8) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-28 13:13:04,878 INFO L448 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2018-11-28 13:13:04,878 INFO L444 ceAbstractionStarter]: At program point L819(line 819) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-28 13:13:04,878 INFO L444 ceAbstractionStarter]: At program point L786(lines 779 834) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse7 (= main_~status~1 ~lowerDriverReturn~0)) (.cse8 (= 0 ~pended~0)) (.cse12 (= 0 main_~status~1)) (.cse11 (<= ~compRegistered~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~pended~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse8 .cse12) (and (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse12 .cse6 .cse11) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse12 .cse11) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-28 13:13:04,878 INFO L448 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2018-11-28 13:13:04,878 INFO L444 ceAbstractionStarter]: At program point L745(lines 744 774) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= ~s~0 1)) (.cse5 (<= ~MPR3~0 6)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (<= 6 ~MPR3~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= 0 main_~status~1)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (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)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-28 13:13:04,879 INFO L444 ceAbstractionStarter]: At program point L1176(line 1176) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-28 13:13:04,879 INFO L448 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2018-11-28 13:13:04,879 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2018-11-28 13:13:04,879 INFO L444 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 1167 1180) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-28 13:13:04,879 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1167 1180) no Hoare annotation was computed. [2018-11-28 13:13:04,879 INFO L444 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1))) [2018-11-28 13:13:04,879 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-28 13:13:04,879 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (= |old(~s~0)| ~s~0) (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1 (and (<= 1 ~s~0) (<= ~s~0 1))))) [2018-11-28 13:13:04,879 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-28 13:13:04,880 INFO L451 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2018-11-28 13:13:04,880 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-28 13:13:04,880 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2018-11-28 13:13:04,880 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 601 610) no Hoare annotation was computed. [2018-11-28 13:13:04,880 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2018-11-28 13:13:04,880 INFO L444 ceAbstractionStarter]: At program point L1088(lines 1087 1099) the Hoare annotation is: (let ((.cse31 (+ ~SKIP1~0 2)) (.cse29 (+ ~DC~0 5)) (.cse32 (+ ~DC~0 2)) (.cse30 (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not .cse30)) (.cse2 (< ~SKIP2~0 .cse32)) (.cse10 (< ~IPC~0 .cse29)) (.cse6 (< ~MPR1~0 .cse31)) (.cse24 (< ~compRegistered~0 1)) (.cse28 (<= 1 ~s~0))) (let ((.cse26 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse28 (<= ~s~0 ~NP~0) (<= .cse32 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0))) (.cse1 (< 6 ~MPR3~0)) (.cse16 (or .cse0 (or .cse8 .cse2 .cse10) .cse6 .cse24)) (.cse19 (< |old(~setEventCalled~0)| 1)) (.cse17 (< ~NP~0 1)) (.cse20 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse22 (< 1 |old(~setEventCalled~0)|)) (.cse27 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse5 (and .cse28 (<= ~s~0 1) .cse27)) (.cse15 (or .cse1 .cse16 .cse19 .cse17 .cse20 .cse3 .cse4 .cse21 .cse22)) (.cse7 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (= ~myStatus~0 0))) (.cse13 (< 0 (+ ~myStatus~0 1073741637))) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse25 (and .cse26 .cse27)) (.cse23 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse5 .cse14 .cse15) (or .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse20 .cse12 .cse21 .cse22) (or .cse5 .cse18 .cse14 .cse15) (or (< ~MPR3~0 (+ ~NP~0 5)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse2 .cse10) (or (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse22) .cse25 .cse18 .cse14) (or .cse13 .cse14 (or (and (= |old(~customIrp~0)| 1) .cse26 (= 0 ~customIrp~0)) .cse25) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse22))))))) [2018-11-28 13:13:04,880 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2018-11-28 13:13:04,880 INFO L444 ceAbstractionStarter]: At program point L1080(line 1080) the Hoare annotation is: (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~IPC~0 (+ ~DC~0 5))) (.cse0 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~compRegistered~0 1))) (let ((.cse5 (< 6 ~MPR3~0)) (.cse20 (or .cse4 (or .cse8 .cse2 .cse3) .cse0 .cse16)) (.cse15 (< |old(~setEventCalled~0)| 1)) (.cse21 (< ~NP~0 1)) (.cse22 (< ~MPR3~0 |old(~s~0)|)) (.cse6 (< ~MPR3~0 6)) (.cse7 (< 1 ~NP~0)) (.cse23 (< |old(~s~0)| ~MPR3~0)) (.cse17 (< 1 |old(~setEventCalled~0)|))) (let ((.cse1 (not (= ~compRegistered~0 0))) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse10 (< |old(~s~0)| 1)) (.cse18 (not (= ~myStatus~0 0))) (.cse11 (not (= |old(~customIrp~0)| 0))) (.cse12 (< 0 (+ ~myStatus~0 1073741637))) (.cse13 (< 0 ~MaximumInterfaceType~0)) (.cse19 (or .cse5 .cse20 .cse15 .cse21 .cse22 .cse6 .cse7 .cse23 .cse17))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse2 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse11) (or .cse12 .cse13 (or .cse5 .cse14 .cse2 .cse6 .cse7 .cse0 .cse15 .cse8 .cse16 .cse9 .cse3 .cse10 .cse17)) (or .cse18 .cse13 .cse19) (or (or .cse5 .cse14 .cse2 .cse6 .cse7 .cse0 .cse15 .cse8 .cse16 .cse9 .cse3 .cse10 .cse11 .cse17) .cse18 .cse13) (or .cse5 .cse20 .cse15 .cse21 .cse18 .cse22 .cse6 .cse7 .cse11 .cse23 .cse17) (or .cse12 .cse13 .cse19))))) [2018-11-28 13:13:04,881 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2018-11-28 13:13:04,881 INFO L448 ceAbstractionStarter]: For program point L1078-1(lines 1065 1084) no Hoare annotation was computed. [2018-11-28 13:13:04,881 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1091 1098) no Hoare annotation was computed. [2018-11-28 13:13:04,881 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1091 1098) no Hoare annotation was computed. [2018-11-28 13:13:04,881 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2018-11-28 13:13:04,881 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1099) no Hoare annotation was computed. [2018-11-28 13:13:04,881 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1060 1101) no Hoare annotation was computed. [2018-11-28 13:13:04,881 INFO L444 ceAbstractionStarter]: At program point L1073(lines 1065 1084) the Hoare annotation is: (let ((.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~compRegistered~0 1))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse23 (or .cse17 (or .cse7 .cse2 .cse10) .cse5 .cse8)) (.cse6 (< |old(~setEventCalled~0)| 1)) (.cse24 (< ~NP~0 1)) (.cse25 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse26 (< |old(~s~0)| ~MPR3~0)) (.cse13 (< 1 |old(~setEventCalled~0)|)) (.cse18 (= |old(~customIrp~0)| ~customIrp~0)) (.cse20 (= |old(~s~0)| ~s~0))) (let ((.cse19 (not (= ~compRegistered~0 0))) (.cse16 (and .cse18 (<= 1 ~setEventCalled~0) .cse20 (<= ~setEventCalled~0 1))) (.cse1 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1)) (.cse14 (not (= ~myStatus~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse22 (< 0 (+ ~myStatus~0 1073741637))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse21 (or .cse0 .cse23 .cse6 .cse24 .cse25 .cse3 .cse4 .cse26 .cse13))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse3 .cse4 (and (<= 1 ~s~0) (<= ~s~0 1) .cse18) .cse5 .cse19 .cse7 .cse9 .cse10 .cse11 .cse12) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse5 .cse19 .cse20 .cse2 .cse10) (or .cse14 .cse15 .cse21) (or .cse22 .cse15 .cse16 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (or .cse0 .cse23 .cse6 .cse24 .cse14 .cse25 .cse3 .cse4 .cse12 .cse26 .cse13) (or .cse22 .cse15 .cse21))))) [2018-11-28 13:13:04,881 INFO L448 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2018-11-28 13:13:04,881 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1060 1101) the Hoare annotation is: (let ((.cse22 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~compRegistered~0 1))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse24 (or .cse22 (or .cse7 .cse2 .cse10) .cse5 .cse8)) (.cse6 (< |old(~setEventCalled~0)| 1)) (.cse25 (< ~NP~0 1)) (.cse26 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse27 (< |old(~s~0)| ~MPR3~0)) (.cse13 (< 1 |old(~setEventCalled~0)|)) (.cse23 (= |old(~customIrp~0)| ~customIrp~0)) (.cse28 (<= 1 ~setEventCalled~0)) (.cse18 (= |old(~s~0)| ~s~0)) (.cse29 (<= ~setEventCalled~0 1))) (let ((.cse17 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse19 (< 0 (+ ~myStatus~0 1073741637))) (.cse16 (and .cse23 .cse28 .cse18 .cse29)) (.cse1 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1)) (.cse14 (not (= ~myStatus~0 0))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse21 (or .cse0 .cse24 .cse6 .cse25 .cse26 .cse3 .cse4 .cse27 .cse13)) (.cse20 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse23 .cse28 .cse29))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse5 .cse17 .cse2 .cse18 .cse10) (or .cse19 .cse20 .cse15 .cse21) (or .cse22 .cse0 (and (<= 1 ~s~0) (<= ~s~0 1) .cse23) .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse24 .cse25 .cse14 .cse3 .cse4 .cse20 .cse6 .cse26 .cse12 .cse27 .cse13) (or .cse19 .cse15 .cse16 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (or .cse14 .cse15 .cse21 .cse20))))) [2018-11-28 13:13:04,882 INFO L444 ceAbstractionStarter]: At program point L1090(lines 1089 1099) the Hoare annotation is: (let ((.cse31 (+ ~SKIP1~0 2)) (.cse29 (+ ~DC~0 5)) (.cse32 (+ ~DC~0 2)) (.cse30 (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not .cse30)) (.cse2 (< ~SKIP2~0 .cse32)) (.cse10 (< ~IPC~0 .cse29)) (.cse6 (< ~MPR1~0 .cse31)) (.cse24 (< ~compRegistered~0 1)) (.cse28 (<= 1 ~s~0))) (let ((.cse26 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse28 (<= ~s~0 ~NP~0) (<= .cse32 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0))) (.cse1 (< 6 ~MPR3~0)) (.cse16 (or .cse0 (or .cse8 .cse2 .cse10) .cse6 .cse24)) (.cse19 (< |old(~setEventCalled~0)| 1)) (.cse17 (< ~NP~0 1)) (.cse20 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse22 (< 1 |old(~setEventCalled~0)|)) (.cse27 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse5 (and .cse28 (<= ~s~0 1) .cse27)) (.cse15 (or .cse1 .cse16 .cse19 .cse17 .cse20 .cse3 .cse4 .cse21 .cse22)) (.cse7 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (= ~myStatus~0 0))) (.cse13 (< 0 (+ ~myStatus~0 1073741637))) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse25 (and .cse26 .cse27)) (.cse23 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse5 .cse14 .cse15) (or .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse20 .cse12 .cse21 .cse22) (or .cse5 .cse18 .cse14 .cse15) (or (< ~MPR3~0 (+ ~NP~0 5)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse2 .cse10) (or (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse22) .cse25 .cse18 .cse14) (or .cse13 .cse14 (or (and (= |old(~customIrp~0)| 1) .cse26 (= 0 ~customIrp~0)) .cse25) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse22))))))) [2018-11-28 13:13:04,882 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1038 1051) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse4) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) .cse5 (< 1 ~NP~0) (< |old(~s~0)| 1)) (= |old(~s~0)| ~s~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse1 .cse0 .cse2 .cse5 .cse4))) [2018-11-28 13:13:04,883 INFO L444 ceAbstractionStarter]: At program point L1046(line 1046) the Hoare annotation is: (let ((.cse0 (not (= 0 ~pended~0))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (= ~compRegistered~0 0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse0 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse1) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1)) (or .cse3 .cse4 .cse0) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse3 .cse4 .cse2 .cse1))) [2018-11-28 13:13:04,883 INFO L448 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2018-11-28 13:13:04,883 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2018-11-28 13:13:04,883 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2018-11-28 13:13:04,883 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 433 600) no Hoare annotation was computed. [2018-11-28 13:13:04,883 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2018-11-28 13:13:04,887 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 433 600) the Hoare annotation is: (let ((.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse5 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and .cse1 (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3 .cse4) .cse5) (or (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) .cse0 .cse5))) [2018-11-28 13:13:04,888 INFO L444 ceAbstractionStarter]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) .cse5) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and (= |old(~myStatus~0)| ~myStatus~0) .cse1 .cse2 .cse3 .cse4) .cse5))) [2018-11-28 13:13:04,888 INFO L448 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2018-11-28 13:13:04,888 INFO L444 ceAbstractionStarter]: At program point L532(line 532) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-28 13:13:04,888 INFO L448 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2018-11-28 13:13:04,888 INFO L444 ceAbstractionStarter]: At program point L557(lines 557 559) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-28 13:13:04,888 INFO L448 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2018-11-28 13:13:04,889 INFO L444 ceAbstractionStarter]: At program point L549-2(lines 549 565) the Hoare annotation is: (let ((.cse0 (and (and (and (= ~s~0 ~NP~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) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-11-28 13:13:04,889 INFO L444 ceAbstractionStarter]: At program point L566(lines 527 592) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-28 13:13:04,892 INFO L444 ceAbstractionStarter]: At program point L525(line 525) the Hoare annotation is: (let ((.cse2 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (let ((.cse4 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (.cse5 (= |old(~customIrp~0)| ~customIrp~0))) (or (and (and .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse5) (and (<= FloppyStartDevice_~__cil_tmp42~0 259) (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse4 .cse5)))) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2) .cse3) (or (and .cse2 .cse1) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse3))) [2018-11-28 13:13:04,892 INFO L444 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-28 13:13:04,892 INFO L448 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2018-11-28 13:13:04,892 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2018-11-28 13:13:04,892 INFO L448 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2018-11-28 13:13:04,892 INFO L448 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2018-11-28 13:13:04,892 INFO L444 ceAbstractionStarter]: At program point L542(lines 529 569) the Hoare annotation is: (let ((.cse0 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-28 13:13:04,892 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 537) no Hoare annotation was computed. [2018-11-28 13:13:04,892 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 543 546) no Hoare annotation was computed. [2018-11-28 13:13:04,893 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2018-11-28 13:13:04,893 INFO L448 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2018-11-28 13:13:04,893 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2018-11-28 13:13:04,899 INFO L444 ceAbstractionStarter]: At program point L585(lines 585 586) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-28 13:13:04,899 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2018-11-28 13:13:04,899 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2018-11-28 13:13:04,899 INFO L448 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2018-11-28 13:13:04,899 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-11-28 13:13:04,899 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2018-11-28 13:13:04,900 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2018-11-28 13:13:04,900 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2018-11-28 13:13:04,900 INFO L444 ceAbstractionStarter]: At program point L513(line 513) the Hoare annotation is: (let ((.cse9 (<= ~MPR3~0 ~s~0)) (.cse10 (<= ~s~0 ~MPR3~0)) (.cse8 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (= |old(~s~0)| ~s~0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse6 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse7 (<= ~setEventCalled~0 1)) (.cse11 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0))) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 (and .cse0 .cse4 .cse9 .cse10 .cse5 .cse6 .cse1 .cse2 .cse7) .cse11)) (let ((.cse12 (= 0 ~myStatus~0))) (or (and .cse4 .cse9 .cse10 .cse5 .cse12 .cse6 .cse1 .cse2 .cse7) (not (= |old(~myStatus~0)| 0)) .cse8 (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse11)))) [2018-11-28 13:13:04,900 INFO L448 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2018-11-28 13:13:04,900 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 578) no Hoare annotation was computed. [2018-11-28 13:13:04,900 INFO L444 ceAbstractionStarter]: At program point L571-2(lines 571 578) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-28 13:13:04,900 INFO L444 ceAbstractionStarter]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-11-28 13:13:04,904 INFO L448 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2018-11-28 13:13:04,905 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2018-11-28 13:13:04,905 INFO L444 ceAbstractionStarter]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-11-28 13:13:04,905 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2018-11-28 13:13:04,905 INFO L451 ceAbstractionStarter]: At program point L1134(lines 1133 1143) the Hoare annotation is: true [2018-11-28 13:13:04,905 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2018-11-28 13:13:04,905 INFO L451 ceAbstractionStarter]: At program point L1132(lines 1131 1143) the Hoare annotation is: true [2018-11-28 13:13:04,905 INFO L448 ceAbstractionStarter]: For program point L1131(lines 1131 1143) no Hoare annotation was computed. [2018-11-28 13:13:04,905 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1135 1142) no Hoare annotation was computed. [2018-11-28 13:13:04,905 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2018-11-28 13:13:04,905 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1135 1142) no Hoare annotation was computed. [2018-11-28 13:13:04,905 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1124 1145) no Hoare annotation was computed. [2018-11-28 13:13:04,906 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2018-11-28 13:13:04,906 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2018-11-28 13:13:04,906 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1102 1123) no Hoare annotation was computed. [2018-11-28 13:13:04,906 INFO L451 ceAbstractionStarter]: At program point L1112(lines 1111 1121) the Hoare annotation is: true [2018-11-28 13:13:04,906 INFO L451 ceAbstractionStarter]: At program point L1110(lines 1109 1121) the Hoare annotation is: true [2018-11-28 13:13:04,906 INFO L448 ceAbstractionStarter]: For program point L1109(lines 1109 1121) no Hoare annotation was computed. [2018-11-28 13:13:04,906 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1113 1120) no Hoare annotation was computed. [2018-11-28 13:13:04,906 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1113 1120) no Hoare annotation was computed. [2018-11-28 13:13:04,906 INFO L448 ceAbstractionStarter]: For program point L849(lines 849 861) no Hoare annotation was computed. [2018-11-28 13:13:04,913 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2018-11-28 13:13:04,913 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 839 863) no Hoare annotation was computed. [2018-11-28 13:13:04,913 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 853 860) no Hoare annotation was computed. [2018-11-28 13:13:04,913 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 839 863) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ ~s~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 ~s~0) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~s~0 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2))) [2018-11-28 13:13:04,913 INFO L451 ceAbstractionStarter]: At program point L852(lines 851 861) the Hoare annotation is: true [2018-11-28 13:13:04,913 INFO L451 ceAbstractionStarter]: At program point L850(lines 849 861) the Hoare annotation is: true [2018-11-28 13:13:04,913 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 853 860) no Hoare annotation was computed. [2018-11-28 13:13:04,913 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2018-11-28 13:13:04,913 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1052 1059) no Hoare annotation was computed. [2018-11-28 13:13:04,914 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2018-11-28 13:13:04,914 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2018-11-28 13:13:04,914 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 653 665) the Hoare annotation is: (let ((.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse1 (not (= ~myStatus~0 0)) .cse0 .cse2))) [2018-11-28 13:13:04,914 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 653 665) no Hoare annotation was computed. [2018-11-28 13:13:04,914 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2018-11-28 13:13:04,914 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2018-11-28 13:13:04,914 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 1622 1629) no Hoare annotation was computed. [2018-11-28 13:13:04,914 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2018-11-28 13:13:04,914 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1010) no Hoare annotation was computed. [2018-11-28 13:13:04,915 INFO L444 ceAbstractionStarter]: At program point L989(lines 988 1011) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse7 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse12 (not (= ~myStatus~0 0))) (.cse8 (< 0 ~MaximumInterfaceType~0)) (.cse9 (or .cse10 .cse11 .cse13))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse7 .cse13 (not (= ~customIrp~0 0))) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6) (or .cse7 .cse12 .cse8 .cse9))))) [2018-11-28 13:13:04,918 INFO L444 ceAbstractionStarter]: At program point L981(line 981) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse11 (< 6 ~MPR3~0)) (.cse12 (or (or .cse5 .cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse10) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse9 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse11 .cse12 .cse13)) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (not (= ~myStatus~0 0))) (.cse3 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 1 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse3 .cse2) (or .cse4 (not (= 1 ~pended~0)) .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse11 .cse12 .cse0 .cse13 .cse3 (not (= ~customIrp~0 0))))))) [2018-11-28 13:13:04,918 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2018-11-28 13:13:04,919 INFO L448 ceAbstractionStarter]: For program point L973-1(lines 973 985) no Hoare annotation was computed. [2018-11-28 13:13:04,919 INFO L444 ceAbstractionStarter]: At program point L994(lines 993 1010) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse10 .cse11 .cse13)) (.cse9 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse9 .cse13 (not (= ~customIrp~0 0))) (or .cse12 .cse7 .cse8 .cse9) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6))))) [2018-11-28 13:13:04,924 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 965 1037) the Hoare annotation is: (let ((.cse18 (+ ~DC~0 2)) (.cse16 (+ ~DC~0 5)) (.cse17 (= 0 ~pended~0)) (.cse19 (+ ~SKIP1~0 2))) (let ((.cse4 (< ~MPR1~0 .cse19)) (.cse6 (not .cse17)) (.cse7 (< ~IPC~0 .cse16)) (.cse3 (< ~SKIP2~0 .cse18))) (let ((.cse0 (+ ~NP~0 2)) (.cse15 (+ ~NP~0 5)) (.cse8 (< 6 ~MPR3~0)) (.cse9 (or (or .cse4 .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse3 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse11 (< ~MPR3~0 6))) (let ((.cse10 (not (= ~myStatus~0 0))) (.cse13 (< 0 ~MaximumInterfaceType~0)) (.cse14 (or .cse8 .cse9 .cse11)) (.cse12 (and (<= ~s~0 1) (and (<= .cse0 ~SKIP1~0) (<= .cse16 ~IPC~0) (<= .cse15 ~MPR3~0) .cse17 (= ~s~0 ~NP~0) (<= .cse18 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0))) (.cse1 (< ~MPR3~0 .cse15)) (.cse5 (not (= ~compRegistered~0 0))) (.cse2 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 .cse0) .cse1 .cse2 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 (< |old(~s~0)| ~SKIP1~0) .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 (not (= ~customIrp~0 0)) .cse12) (or .cse10 .cse12 .cse13 .cse14) (or (< 0 (+ ~myStatus~0 1073741637)) .cse13 .cse14 .cse12) (or .cse1 (not (= 1 ~pended~0)) .cse4 .cse5 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3 .cse7)))))) [2018-11-28 13:13:04,924 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 965 1037) no Hoare annotation was computed. [2018-11-28 13:13:04,924 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2018-11-28 13:13:04,924 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2018-11-28 13:13:04,924 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2018-11-28 13:13:04,925 INFO L444 ceAbstractionStarter]: At program point L1008(lines 972 1036) the Hoare annotation is: (let ((.cse31 (+ ~DC~0 2)) (.cse29 (+ ~DC~0 5)) (.cse30 (= 0 ~pended~0)) (.cse28 (+ ~SKIP1~0 2)) (.cse32 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse3 (= ~MPR1~0 ~s~0)) (.cse4 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse32) 3221225494))) (.cse5 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse6 (<= (+ .cse32 1) 0)) (.cse12 (+ ~NP~0 2)) (.cse8 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse16 (< ~MPR1~0 .cse28)) (.cse18 (not .cse30)) (.cse19 (< ~IPC~0 .cse29)) (.cse15 (< ~SKIP2~0 .cse31))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse1 (or (or .cse16 .cse18 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse19) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse15 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse11 (< ~MPR3~0 6)) (.cse10 (and (let ((.cse23 (<= .cse12 ~SKIP1~0)) (.cse24 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~SKIP2~0))) (.cse25 (<= .cse28 ~MPR1~0)) (.cse26 (<= 1 ~compRegistered~0)) (.cse27 (= ~NP~0 |old(~s~0)|))) (or (and .cse23 .cse3 .cse24 .cse4 (= 0 IofCallDriver_~returnVal2~0) .cse25 .cse26 .cse5 .cse6 .cse27) (and .cse23 .cse3 .cse24 .cse4 .cse25 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse26 .cse5 .cse6 .cse27))) .cse8 .cse9))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse7 (= IofCallDriver_~returnVal2~0 259)) (.cse21 (< 0 ~MaximumInterfaceType~0)) (.cse20 (and .cse10 (<= ~MaximumInterfaceType~0 0))) (.cse22 (or .cse0 .cse1 .cse11)) (.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= ~compRegistered~0 0))) (.cse14 (= ~s~0 ~SKIP1~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 .cse12) .cse13 .cse14 .cse15 (< ~SKIP1~0 |old(~s~0)|) .cse16 (< |old(~s~0)| ~SKIP1~0) .cse17 .cse18 .cse19) (or .cse20 (and (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) .cse7) (< 0 (+ ~myStatus~0 1073741637)) .cse21 .cse22) (or .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9) .cse21 .cse20 .cse22) (or .cse13 (not (= 1 ~pended~0)) .cse16 .cse17 .cse14 (not (= ~SKIP1~0 |old(~s~0)|)) .cse15 .cse19)))))) [2018-11-28 13:13:04,931 INFO L444 ceAbstractionStarter]: At program point L975(line 975) the Hoare annotation is: (let ((.cse18 (+ ~DC~0 2)) (.cse16 (+ ~DC~0 5)) (.cse17 (= 0 ~pended~0)) (.cse19 (+ ~SKIP1~0 2))) (let ((.cse9 (< ~MPR1~0 .cse19)) (.cse12 (not .cse17)) (.cse14 (< ~IPC~0 .cse16)) (.cse13 (< ~SKIP2~0 .cse18))) (let ((.cse7 (+ ~NP~0 2)) (.cse15 (+ ~NP~0 5)) (.cse0 (< 6 ~MPR3~0)) (.cse1 (or (or .cse9 .cse12 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse14) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse13 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse3 (< ~MPR3~0 6))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse5 (< 0 ~MaximumInterfaceType~0)) (.cse6 (or .cse0 .cse1 .cse3)) (.cse4 (and (<= ~s~0 1) (and (<= .cse7 ~SKIP1~0) (<= .cse16 ~IPC~0) (<= .cse15 ~MPR3~0) .cse17 (= ~s~0 ~NP~0) (<= .cse18 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0))) (.cse8 (< ~MPR3~0 .cse15)) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~customIrp~0 0)) .cse4) (or .cse2 .cse4 .cse5 .cse6) (or (< ~SKIP1~0 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (< 0 (+ ~myStatus~0 1073741637)) .cse5 .cse6 .cse4) (or .cse8 (not (= 1 ~pended~0)) .cse9 .cse10 .cse11 .cse13 .cse14)))))) [2018-11-28 13:13:04,931 INFO L448 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2018-11-28 13:13:04,931 INFO L444 ceAbstractionStarter]: At program point L996(lines 995 1010) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse10 .cse11 .cse13)) (.cse9 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse9 .cse13 (not (= ~customIrp~0 0))) (or .cse12 .cse7 .cse8 .cse9) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6))))) [2018-11-28 13:13:04,935 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 997 1009) no Hoare annotation was computed. [2018-11-28 13:13:04,935 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 997 1009) no Hoare annotation was computed. [2018-11-28 13:13:04,935 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2018-11-28 13:13:04,935 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1011) no Hoare annotation was computed. [2018-11-28 13:13:04,935 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1023) no Hoare annotation was computed. [2018-11-28 13:13:04,936 INFO L444 ceAbstractionStarter]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse9 (< 6 ~MPR3~0)) (.cse10 (or (or .cse1 .cse4 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse5 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse12 (< ~MPR3~0 6))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse11 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse9 .cse10 .cse12))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0))) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse5 .cse6) (or .cse11 .cse7 .cse8))))) [2018-11-28 13:13:04,936 INFO L448 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2018-11-28 13:13:04,936 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2018-11-28 13:13:04,936 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-11-28 13:13:04,936 INFO L444 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-11-28 13:13:04,936 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 122) no Hoare annotation was computed. [2018-11-28 13:13:04,936 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2018-11-28 13:13:04,936 INFO L444 ceAbstractionStarter]: At program point L120-2(lines 120 122) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-11-28 13:13:04,940 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2018-11-28 13:13:04,940 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2018-11-28 13:13:04,940 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2018-11-28 13:13:04,940 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 133) no Hoare annotation was computed. [2018-11-28 13:13:04,940 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 96 158) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-11-28 13:13:04,940 INFO L448 ceAbstractionStarter]: For program point L131-2(lines 131 133) no Hoare annotation was computed. [2018-11-28 13:13:04,940 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2018-11-28 13:13:04,940 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2018-11-28 13:13:04,940 INFO L448 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2018-11-28 13:13:04,941 INFO L444 ceAbstractionStarter]: At program point L140(line 140) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and .cse0 (<= (+ FlQueueIrpToThread_~status~0 1073741823) 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (and .cse0 (= FlQueueIrpToThread_~status~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1))) [2018-11-28 13:13:04,941 INFO L448 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2018-11-28 13:13:04,941 INFO L444 ceAbstractionStarter]: At program point L138(lines 138 139) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-11-28 13:13:04,941 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2018-11-28 13:13:04,941 INFO L444 ceAbstractionStarter]: At program point L1307(line 1307) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,941 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2018-11-28 13:13:04,941 INFO L448 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2018-11-28 13:13:04,941 INFO L448 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2018-11-28 13:13:04,941 INFO L448 ceAbstractionStarter]: For program point $Ultimate##38(lines 1400 1526) no Hoare annotation was computed. [2018-11-28 13:13:04,941 INFO L448 ceAbstractionStarter]: For program point $Ultimate##37(lines 1400 1526) no Hoare annotation was computed. [2018-11-28 13:13:04,943 INFO L444 ceAbstractionStarter]: At program point L1514(line 1514) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,943 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2018-11-28 13:13:04,943 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2018-11-28 13:13:04,943 INFO L444 ceAbstractionStarter]: At program point L1316(lines 1315 1549) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,944 INFO L444 ceAbstractionStarter]: At program point L1399(lines 1389 1529) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,944 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1427) no Hoare annotation was computed. [2018-11-28 13:13:04,944 INFO L444 ceAbstractionStarter]: At program point L1292(line 1292) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,944 INFO L448 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2018-11-28 13:13:04,944 INFO L444 ceAbstractionStarter]: At program point L1449(line 1449) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,944 INFO L448 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2018-11-28 13:13:04,944 INFO L444 ceAbstractionStarter]: At program point L1383(lines 1375 1533) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,944 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2018-11-28 13:13:04,944 INFO L448 ceAbstractionStarter]: For program point L1433(lines 1433 1437) no Hoare annotation was computed. [2018-11-28 13:13:04,945 INFO L444 ceAbstractionStarter]: At program point L1301(line 1301) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,945 INFO L444 ceAbstractionStarter]: At program point L1557(line 1557) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse2 (+ ~DC~0 2))) (let ((.cse0 (and (= 0 ~pended~0) .cse1 (<= .cse2 ~SKIP2~0)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= FloppyDeviceControl_~__cil_tmp91~0 FloppyDeviceControl_~ntStatus~3) .cse0) (and .cse1 (= ~pended~0 1)) (< ~SKIP2~0 .cse2) (< 1 ~NP~0) (and (<= (+ FloppyDeviceControl_~ntStatus~3 1073741811) 0) .cse0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)))) [2018-11-28 13:13:04,950 INFO L448 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2018-11-28 13:13:04,950 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2018-11-28 13:13:04,950 INFO L444 ceAbstractionStarter]: At program point L1483(lines 1347 1541) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,950 INFO L448 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2018-11-28 13:13:04,950 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2018-11-28 13:13:04,950 INFO L448 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2018-11-28 13:13:04,950 INFO L444 ceAbstractionStarter]: At program point L1525(lines 1400 1526) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and .cse0 (= ~pended~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= 0 ~pended~0) .cse0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1))) [2018-11-28 13:13:04,950 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2018-11-28 13:13:04,950 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2018-11-28 13:13:04,951 INFO L448 ceAbstractionStarter]: For program point L1410(lines 1410 1414) no Hoare annotation was computed. [2018-11-28 13:13:04,951 INFO L444 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 1182 1563) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,951 INFO L448 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2018-11-28 13:13:04,951 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1547) no Hoare annotation was computed. [2018-11-28 13:13:04,951 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2018-11-28 13:13:04,951 INFO L448 ceAbstractionStarter]: For program point L1502(lines 1502 1504) no Hoare annotation was computed. [2018-11-28 13:13:04,951 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1497) no Hoare annotation was computed. [2018-11-28 13:13:04,951 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2018-11-28 13:13:04,951 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2018-11-28 13:13:04,952 INFO L448 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L444 ceAbstractionStarter]: At program point L1321(lines 1320 1547) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1396(lines 1396 1527) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L444 ceAbstractionStarter]: At program point L1520(lines 1520 1521) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L444 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2018-11-28 13:13:04,953 INFO L448 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2018-11-28 13:13:04,954 INFO L444 ceAbstractionStarter]: At program point L1339(lines 1329 1545) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-28 13:13:04,954 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-11-28 13:13:04,954 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1529) no Hoare annotation was computed. [2018-11-28 13:13:04,954 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2018-11-28 13:13:04,954 INFO L448 ceAbstractionStarter]: For program point L1315(lines 1315 1549) no Hoare annotation was computed. [2018-11-28 13:13:04,954 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 1564 1580) no Hoare annotation was computed. [2018-11-28 13:13:04,954 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2018-11-28 13:13:04,957 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2018-11-28 13:13:04,957 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2018-11-28 13:13:04,957 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2018-11-28 13:13:04,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:13:04,957 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-28 13:13:04,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:13:04,957 INFO L444 ceAbstractionStarter]: At program point L1598(line 1598) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-28 13:13:04,957 INFO L448 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2018-11-28 13:13:04,957 INFO L448 ceAbstractionStarter]: For program point L1590(lines 1590 1592) no Hoare annotation was computed. [2018-11-28 13:13:04,957 INFO L448 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2018-11-28 13:13:04,958 INFO L444 ceAbstractionStarter]: At program point L1613(line 1613) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-28 13:13:04,958 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2018-11-28 13:13:04,958 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2018-11-28 13:13:04,958 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2018-11-28 13:13:04,958 INFO L444 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 1581 1620) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-28 13:13:04,958 INFO L448 ceAbstractionStarter]: For program point L1601(lines 1601 1603) no Hoare annotation was computed. [2018-11-28 13:13:04,958 INFO L448 ceAbstractionStarter]: For program point L1601-2(lines 1601 1603) no Hoare annotation was computed. [2018-11-28 13:13:04,958 INFO L448 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2018-11-28 13:13:04,958 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 1581 1620) no Hoare annotation was computed. [2018-11-28 13:13:04,958 INFO L444 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (let ((.cse3 (<= 1 ~setEventCalled~0)) (.cse4 (= 259 FlFdcDeviceIo_~__cil_tmp11~0)) (.cse5 (<= ~setEventCalled~0 1))) (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse3 .cse4 .cse5))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) (and (<= 1 ~s~0) (<= ~s~0 1) .cse3 .cse4 .cse5) .cse1 .cse2)))) [2018-11-28 13:13:04,959 INFO L448 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2018-11-28 13:13:04,959 INFO L448 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2018-11-28 13:13:04,960 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 611 645) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2)))) [2018-11-28 13:13:04,960 INFO L448 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2018-11-28 13:13:04,960 INFO L444 ceAbstractionStarter]: At program point L632(line 632) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (<= ~s~0 1) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse1)))) [2018-11-28 13:13:04,960 INFO L448 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2018-11-28 13:13:04,960 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2018-11-28 13:13:04,960 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2018-11-28 13:13:04,960 INFO L444 ceAbstractionStarter]: At program point L623(lines 623 624) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2)))) [2018-11-28 13:13:04,964 INFO L448 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2018-11-28 13:13:04,964 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2018-11-28 13:13:04,964 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 89 95) no Hoare annotation was computed. [2018-11-28 13:13:04,964 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2018-11-28 13:13:04,965 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2018-11-28 13:13:04,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:13:04,965 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (<= ~MaximumInterfaceType~0 0)) [2018-11-28 13:13:04,965 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:13:04,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:13:04,965 INFO L451 ceAbstractionStarter]: At program point L896(lines 895 905) the Hoare annotation is: true [2018-11-28 13:13:04,965 INFO L451 ceAbstractionStarter]: At program point L894(lines 893 905) the Hoare annotation is: true [2018-11-28 13:13:04,965 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 905) no Hoare annotation was computed. [2018-11-28 13:13:04,965 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2018-11-28 13:13:04,965 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 897 904) no Hoare annotation was computed. [2018-11-28 13:13:04,965 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2018-11-28 13:13:04,965 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 885 907) no Hoare annotation was computed. [2018-11-28 13:13:04,966 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 897 904) no Hoare annotation was computed. [2018-11-28 13:13:04,966 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2018-11-28 13:13:04,966 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2018-11-28 13:13:04,966 INFO L451 ceAbstractionStarter]: At program point L873(lines 872 882) the Hoare annotation is: true [2018-11-28 13:13:04,966 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 864 884) no Hoare annotation was computed. [2018-11-28 13:13:04,971 INFO L451 ceAbstractionStarter]: At program point L871(lines 870 882) the Hoare annotation is: true [2018-11-28 13:13:04,971 INFO L448 ceAbstractionStarter]: For program point L870(lines 870 882) no Hoare annotation was computed. [2018-11-28 13:13:04,971 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 874 881) no Hoare annotation was computed. [2018-11-28 13:13:04,971 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 874 881) no Hoare annotation was computed. [2018-11-28 13:13:04,971 INFO L451 ceAbstractionStarter]: At program point L1153(lines 1152 1164) the Hoare annotation is: true [2018-11-28 13:13:04,972 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1164) no Hoare annotation was computed. [2018-11-28 13:13:04,972 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2018-11-28 13:13:04,972 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1146 1166) no Hoare annotation was computed. [2018-11-28 13:13:04,972 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1156 1163) no Hoare annotation was computed. [2018-11-28 13:13:04,972 INFO L451 ceAbstractionStarter]: At program point L1155(lines 1154 1164) the Hoare annotation is: true [2018-11-28 13:13:04,972 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2018-11-28 13:13:04,972 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1156 1163) no Hoare annotation was computed. [2018-11-28 13:13:05,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:13:05 BoogieIcfgContainer [2018-11-28 13:13:05,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:13:05,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:13:05,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:13:05,050 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:13:05,050 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:12:31" (3/4) ... [2018-11-28 13:13:05,053 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:13:05,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-28 13:13:05,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-28 13:13:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-28 13:13:05,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-28 13:13:05,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-28 13:13:05,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-28 13:13:05,080 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 81 nodes and edges [2018-11-28 13:13:05,082 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2018-11-28 13:13:05,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 13:13:05,084 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 13:13:05,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((SKIP2 == s && SKIP1 + 2 <= MPR1) && (((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0) || (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0)))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\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))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && status + 1073741536 <= 0) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(myStatus) == 0)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || (((1 <= NP && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || !(\old(compRegistered) == 0)) || (SKIP2 <= s && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,112 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((DC == s && 0 == compRegistered) && pended == 1) || 0 < \old(myStatus) + 1073741637) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((((((DC == s && 0 == compRegistered) && pended == 1) || !(\old(myStatus) == 0)) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,113 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 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(myStatus == 0)) || 0 < MaximumInterfaceType)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-28 13:13:05,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(myStatus == 0)) || 0 < MaximumInterfaceType)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-28 13:13:05,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) [2018-11-28 13:13:05,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 1 < NP) || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-28 13:13:05,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0)) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5)) && (((((((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) && returnVal2 == 259)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && ((((!(myStatus == 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && returnVal2 == 259) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-28 13:13:05,114 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 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || \old(s) == s) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled)) [2018-11-28 13:13:05,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-28 13:13:05,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-28 13:13:05,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || (((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\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))) || \old(MPR3) < \old(s)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,117 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-28 13:13:05,117 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,118 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,118 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,118 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,119 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) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,119 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,119 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) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-11-28 13:13:05,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-28 13:13:05,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-28 13:13:05,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-28 13:13:05,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-28 13:13:05,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-28 13:13:05,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && \old(s) == s)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-28 13:13:05,235 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_98717026-d6cf-4ae9-9214-2641187f2e75/bin-2019/uautomizer/witness.graphml [2018-11-28 13:13:05,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:13:05,236 INFO L168 Benchmark]: Toolchain (without parser) took 34963.90 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 939.0 MB). Free memory was 951.7 MB in the beginning and 1.9 GB in the end (delta: -937.1 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,236 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:13:05,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.39 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-11-28 13:13:05,237 INFO L168 Benchmark]: Boogie Preprocessor took 45.70 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,237 INFO L168 Benchmark]: RCFGBuilder took 833.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.0 MB in the end (delta: 113.1 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,237 INFO L168 Benchmark]: TraceAbstraction took 33432.69 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 805.3 MB). Free memory was 998.0 MB in the beginning and 1.9 GB in the end (delta: -912.3 MB). Peak memory consumption was 977.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,237 INFO L168 Benchmark]: Witness Printer took 185.73 ms. Allocated memory is still 2.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,239 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 436.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.39 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. * Boogie Preprocessor took 45.70 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 833.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.0 MB in the end (delta: 113.1 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33432.69 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 805.3 MB). Free memory was 998.0 MB in the beginning and 1.9 GB in the end (delta: -912.3 MB). Peak memory consumption was 977.9 MB. Max. memory is 11.5 GB. * Witness Printer took 185.73 ms. Allocated memory is still 2.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: 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: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\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))) || \old(MPR3) < \old(s)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1320]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || (((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 729]: 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 == pended && s == NP) && 0 == compRegistered) && 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: 938]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 797]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && status + 1073741536 <= 0) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(myStatus) == 0)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || (((1 <= NP && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || !(\old(compRegistered) == 0)) || (SKIP2 <= s && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(myStatus == 0)) || 0 < MaximumInterfaceType)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1347]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1389]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && \old(s) == s)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || \old(s) == s) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) - InvariantResult [Line: 746]: 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: 221]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0)) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5)) && (((((((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) && returnVal2 == 259)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && ((((!(myStatus == 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && returnVal2 == 259) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 1152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 787]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((SKIP2 == s && SKIP1 + 2 <= MPR1) && (((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0) || (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0)))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\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))) || ((((((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: 915]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 936]: 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 == pended && s == NP) && 0 == compRegistered) && 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: 895]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1400]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 1 < NP) || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 849]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(myStatus == 0)) || 0 < MaximumInterfaceType)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1329]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((DC == s && 0 == compRegistered) && pended == 1) || 0 < \old(myStatus) + 1073741637) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((((((DC == s && 0 == compRegistered) && pended == 1) || !(\old(myStatus) == 0)) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1375]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 415 locations, 1 error locations. SAFE Result, 33.3s OverallTime, 65 OverallIterations, 2 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 16.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 25811 SDtfs, 11360 SDslu, 82257 SDs, 0 SdLazy, 10961 SolverSat, 2048 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 624 SyntacticMatches, 17 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=966occurred in iteration=19, 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.8s AutomataMinimizationTime, 65 MinimizatonAttempts, 2002 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 142 LocationsWithAnnotation, 2114 PreInvPairs, 2425 NumberOfFragments, 19233 HoareAnnotationTreeSize, 2114 FomulaSimplifications, 221365 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 142 FomulaSimplificationsInter, 441516 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 5218 NumberOfCodeBlocks, 5218 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 5150 ConstructedInterpolants, 0 QuantifiedInterpolants, 832876 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3755 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 68 InterpolantComputations, 65 PerfectInterpolantSequences, 349/358 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...