./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d647228c0dc0174eb229424fd194f0e34ba347e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:58:40,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:58:40,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:58:40,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:58:40,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:58:40,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:58:40,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:58:40,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:58:40,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:58:40,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:58:40,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:58:40,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:58:40,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:58:40,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:58:40,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:58:40,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:58:40,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:58:40,621 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:58:40,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:58:40,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:58:40,624 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:58:40,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:58:40,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:58:40,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:58:40,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:58:40,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:58:40,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:58:40,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:58:40,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:58:40,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:58:40,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:58:40,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:58:40,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:58:40,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:58:40,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:58:40,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:58:40,632 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:58:40,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:58:40,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:58:40,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:58:40,639 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:58:40,639 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:58:40,639 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:58:40,640 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:58:40,640 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:58:40,640 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:58:40,640 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:58:40,640 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:58:40,640 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:58:40,640 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:58:40,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:58:40,640 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:58:40,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:58:40,641 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:58:40,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:58:40,642 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan 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 -> Taipan 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 -> d647228c0dc0174eb229424fd194f0e34ba347e1 [2018-12-03 02:58:40,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:58:40,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:58:40,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:58:40,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:58:40,671 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:58:40,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-03 02:58:40,707 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/data/5ecd97c99/86c3edf423d6461ea9e5f8bcbe797936/FLAGa2652440a [2018-12-03 02:58:41,090 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:58:41,091 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-03 02:58:41,100 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/data/5ecd97c99/86c3edf423d6461ea9e5f8bcbe797936/FLAGa2652440a [2018-12-03 02:58:41,108 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/data/5ecd97c99/86c3edf423d6461ea9e5f8bcbe797936 [2018-12-03 02:58:41,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:58:41,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:58:41,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:58:41,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:58:41,113 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:58:41,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fe3112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41, skipping insertion in model container [2018-12-03 02:58:41,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:58:41,154 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:58:41,339 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:58:41,342 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:58:41,438 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:58:41,451 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:58:41,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41 WrapperNode [2018-12-03 02:58:41,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:58:41,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:58:41,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:58:41,452 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:58:41,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:58:41,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:58:41,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:58:41,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:58:41,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... [2018-12-03 02:58:41,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:58:41,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:58:41,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:58:41,514 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:58:41,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:58:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-12-03 02:58:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-12-03 02:58:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-03 02:58:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-03 02:58:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-12-03 02:58:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-12-03 02:58:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-12-03 02:58:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-12-03 02:58:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:58:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:58:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-03 02:58:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-03 02:58:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-03 02:58:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-03 02:58:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-12-03 02:58:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-12-03 02:58:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-03 02:58:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-03 02:58:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-12-03 02:58:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-12-03 02:58:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-03 02:58:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-03 02:58:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-12-03 02:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-12-03 02:58:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-12-03 02:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-12-03 02:58:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-12-03 02:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-12-03 02:58:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-03 02:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-03 02:58:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-03 02:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-03 02:58:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-12-03 02:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-12-03 02:58:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-12-03 02:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-12-03 02:58:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-03 02:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-03 02:58:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-12-03 02:58:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-12-03 02:58:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-03 02:58:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-03 02:58:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-12-03 02:58:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-12-03 02:58:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:58:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:58:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-12-03 02:58:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-12-03 02:58:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-12-03 02:58:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-12-03 02:58:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:58:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:58:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-12-03 02:58:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-12-03 02:58:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-12-03 02:58:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-12-03 02:58:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-12-03 02:58:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-12-03 02:58:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-03 02:58:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-03 02:58:41,786 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:41,787 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:41,837 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:41,837 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:41,870 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:41,871 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:41,912 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:41,912 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:41,939 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:41,939 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:42,019 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:42,019 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:42,052 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:42,052 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:42,068 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:42,068 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:42,198 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:58:42,198 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:58:42,209 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:58:42,209 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 02:58:42,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:58:42 BoogieIcfgContainer [2018-12-03 02:58:42,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:58:42,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:58:42,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:58:42,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:58:42,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:58:41" (1/3) ... [2018-12-03 02:58:42,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a7375f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:58:42, skipping insertion in model container [2018-12-03 02:58:42,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:58:41" (2/3) ... [2018-12-03 02:58:42,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a7375f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:58:42, skipping insertion in model container [2018-12-03 02:58:42,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:58:42" (3/3) ... [2018-12-03 02:58:42,214 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-03 02:58:42,221 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:58:42,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 02:58:42,236 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 02:58:42,258 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:58:42,259 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:58:42,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:58:42,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:58:42,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:58:42,259 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:58:42,259 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:58:42,259 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:58:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2018-12-03 02:58:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 02:58:42,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:42,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:42,283 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:42,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2018-12-03 02:58:42,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:42,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:42,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:42,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:42,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:42,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:42,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:42,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:42,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:42,427 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2018-12-03 02:58:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:42,530 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2018-12-03 02:58:42,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:42,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 02:58:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:42,540 INFO L225 Difference]: With dead ends: 887 [2018-12-03 02:58:42,540 INFO L226 Difference]: Without dead ends: 507 [2018-12-03 02:58:42,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-12-03 02:58:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-12-03 02:58:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-12-03 02:58:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2018-12-03 02:58:42,593 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2018-12-03 02:58:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:42,593 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2018-12-03 02:58:42,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2018-12-03 02:58:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 02:58:42,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:42,594 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-12-03 02:58:42,594 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:42,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2018-12-03 02:58:42,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:42,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:42,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:42,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:42,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:42,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:42,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:42,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:42,681 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2018-12-03 02:58:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:42,841 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2018-12-03 02:58:42,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:42,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-03 02:58:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:42,846 INFO L225 Difference]: With dead ends: 789 [2018-12-03 02:58:42,846 INFO L226 Difference]: Without dead ends: 670 [2018-12-03 02:58:42,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-03 02:58:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2018-12-03 02:58:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-03 02:58:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2018-12-03 02:58:42,881 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2018-12-03 02:58:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:42,881 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2018-12-03 02:58:42,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2018-12-03 02:58:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 02:58:42,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:42,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:42,882 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:42,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1491411356, now seen corresponding path program 1 times [2018-12-03 02:58:42,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:42,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:42,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:42,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:42,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:42,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:42,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:42,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:42,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:42,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:42,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:42,923 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2018-12-03 02:58:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:42,954 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2018-12-03 02:58:42,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:42,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 02:58:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:42,958 INFO L225 Difference]: With dead ends: 995 [2018-12-03 02:58:42,958 INFO L226 Difference]: Without dead ends: 819 [2018-12-03 02:58:42,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-03 02:58:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2018-12-03 02:58:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-12-03 02:58:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2018-12-03 02:58:42,980 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2018-12-03 02:58:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:42,980 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2018-12-03 02:58:42,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2018-12-03 02:58:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 02:58:42,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:42,981 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-12-03 02:58:42,981 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:42,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1315443348, now seen corresponding path program 1 times [2018-12-03 02:58:42,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:42,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:42,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:43,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:43,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:43,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:43,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:43,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:43,008 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2018-12-03 02:58:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:43,130 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2018-12-03 02:58:43,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:43,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 02:58:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:43,134 INFO L225 Difference]: With dead ends: 1424 [2018-12-03 02:58:43,134 INFO L226 Difference]: Without dead ends: 1160 [2018-12-03 02:58:43,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-12-03 02:58:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2018-12-03 02:58:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-12-03 02:58:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2018-12-03 02:58:43,164 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2018-12-03 02:58:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:43,165 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2018-12-03 02:58:43,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2018-12-03 02:58:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 02:58:43,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:43,166 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] [2018-12-03 02:58:43,166 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:43,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1932537431, now seen corresponding path program 1 times [2018-12-03 02:58:43,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:43,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:43,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:43,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:43,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:43,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:43,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:43,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:43,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:43,217 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2018-12-03 02:58:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:43,729 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2018-12-03 02:58:43,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:58:43,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-03 02:58:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:43,732 INFO L225 Difference]: With dead ends: 1562 [2018-12-03 02:58:43,732 INFO L226 Difference]: Without dead ends: 984 [2018-12-03 02:58:43,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-12-03 02:58:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2018-12-03 02:58:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-03 02:58:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2018-12-03 02:58:43,795 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2018-12-03 02:58:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:43,796 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2018-12-03 02:58:43,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2018-12-03 02:58:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 02:58:43,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:43,798 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] [2018-12-03 02:58:43,798 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:43,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash -487494679, now seen corresponding path program 1 times [2018-12-03 02:58:43,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:43,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:43,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:43,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:43,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:43,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:43,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:43,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:43,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:43,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:43,842 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2018-12-03 02:58:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:43,910 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2018-12-03 02:58:43,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:43,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 02:58:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:43,915 INFO L225 Difference]: With dead ends: 890 [2018-12-03 02:58:43,915 INFO L226 Difference]: Without dead ends: 886 [2018-12-03 02:58:43,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-12-03 02:58:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-12-03 02:58:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-12-03 02:58:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2018-12-03 02:58:43,952 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2018-12-03 02:58:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:43,953 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2018-12-03 02:58:43,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2018-12-03 02:58:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 02:58:43,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:43,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] [2018-12-03 02:58:43,954 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:43,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:43,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1261036943, now seen corresponding path program 1 times [2018-12-03 02:58:43,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:43,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:43,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:43,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:43,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:43,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:43,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:43,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:43,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:43,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:43,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:43,982 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2018-12-03 02:58:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:44,025 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2018-12-03 02:58:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:44,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 02:58:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:44,028 INFO L225 Difference]: With dead ends: 1274 [2018-12-03 02:58:44,028 INFO L226 Difference]: Without dead ends: 1015 [2018-12-03 02:58:44,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-03 02:58:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2018-12-03 02:58:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-03 02:58:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2018-12-03 02:58:44,055 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2018-12-03 02:58:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:44,055 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2018-12-03 02:58:44,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2018-12-03 02:58:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 02:58:44,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:44,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:44,057 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:44,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2018-12-03 02:58:44,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:44,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:44,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:44,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:44,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:44,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:44,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:44,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:44,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,087 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2018-12-03 02:58:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:44,131 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2018-12-03 02:58:44,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:44,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-03 02:58:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:44,133 INFO L225 Difference]: With dead ends: 972 [2018-12-03 02:58:44,133 INFO L226 Difference]: Without dead ends: 954 [2018-12-03 02:58:44,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-03 02:58:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2018-12-03 02:58:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-03 02:58:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2018-12-03 02:58:44,161 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2018-12-03 02:58:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:44,161 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2018-12-03 02:58:44,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2018-12-03 02:58:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 02:58:44,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:44,162 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-12-03 02:58:44,162 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:44,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1159920127, now seen corresponding path program 1 times [2018-12-03 02:58:44,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:44,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:44,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:44,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:44,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:44,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:44,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:44,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:44,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,185 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2018-12-03 02:58:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:44,223 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2018-12-03 02:58:44,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:44,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-03 02:58:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:44,226 INFO L225 Difference]: With dead ends: 1167 [2018-12-03 02:58:44,226 INFO L226 Difference]: Without dead ends: 925 [2018-12-03 02:58:44,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-03 02:58:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2018-12-03 02:58:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-03 02:58:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2018-12-03 02:58:44,252 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2018-12-03 02:58:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:44,253 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2018-12-03 02:58:44,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2018-12-03 02:58:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 02:58:44,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:44,254 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-12-03 02:58:44,254 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:44,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -256141125, now seen corresponding path program 1 times [2018-12-03 02:58:44,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:44,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:44,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:44,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:44,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:58:44,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:44,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:58:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:58:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:58:44,284 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2018-12-03 02:58:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:44,503 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2018-12-03 02:58:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:58:44,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-03 02:58:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:44,506 INFO L225 Difference]: With dead ends: 1014 [2018-12-03 02:58:44,506 INFO L226 Difference]: Without dead ends: 785 [2018-12-03 02:58:44,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:58:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-12-03 02:58:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2018-12-03 02:58:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-12-03 02:58:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2018-12-03 02:58:44,531 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2018-12-03 02:58:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:44,532 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2018-12-03 02:58:44,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:58:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2018-12-03 02:58:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 02:58:44,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:44,533 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-12-03 02:58:44,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:44,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:44,533 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2018-12-03 02:58:44,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:44,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:44,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:44,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:44,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:44,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:44,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:44,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:44,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,565 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2018-12-03 02:58:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:44,593 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2018-12-03 02:58:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:44,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-03 02:58:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:44,596 INFO L225 Difference]: With dead ends: 871 [2018-12-03 02:58:44,596 INFO L226 Difference]: Without dead ends: 775 [2018-12-03 02:58:44,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-12-03 02:58:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2018-12-03 02:58:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-12-03 02:58:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2018-12-03 02:58:44,642 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2018-12-03 02:58:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:44,642 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2018-12-03 02:58:44,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2018-12-03 02:58:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:58:44,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:44,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:44,644 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:44,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2018-12-03 02:58:44,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:44,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:44,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:44,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:44,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,663 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2018-12-03 02:58:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:44,747 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2018-12-03 02:58:44,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:44,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-03 02:58:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:44,750 INFO L225 Difference]: With dead ends: 938 [2018-12-03 02:58:44,751 INFO L226 Difference]: Without dead ends: 928 [2018-12-03 02:58:44,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-12-03 02:58:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2018-12-03 02:58:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-03 02:58:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2018-12-03 02:58:44,790 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2018-12-03 02:58:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:44,790 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2018-12-03 02:58:44,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2018-12-03 02:58:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 02:58:44,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:44,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:44,792 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:44,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2018-12-03 02:58:44,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:44,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:44,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:58:44,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:44,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:58:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:58:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:58:44,842 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2018-12-03 02:58:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:44,952 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2018-12-03 02:58:44,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:58:44,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-03 02:58:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:44,955 INFO L225 Difference]: With dead ends: 851 [2018-12-03 02:58:44,955 INFO L226 Difference]: Without dead ends: 847 [2018-12-03 02:58:44,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:58:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-12-03 02:58:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2018-12-03 02:58:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-03 02:58:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2018-12-03 02:58:44,981 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2018-12-03 02:58:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:44,981 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2018-12-03 02:58:44,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:58:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2018-12-03 02:58:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 02:58:44,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:44,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:44,983 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:44,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:44,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2018-12-03 02:58:44,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:44,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:44,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:44,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:45,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:45,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:58:45,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:45,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:58:45,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:58:45,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:58:45,022 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2018-12-03 02:58:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:45,107 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2018-12-03 02:58:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:58:45,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-03 02:58:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:45,111 INFO L225 Difference]: With dead ends: 886 [2018-12-03 02:58:45,111 INFO L226 Difference]: Without dead ends: 865 [2018-12-03 02:58:45,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:58:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-12-03 02:58:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2018-12-03 02:58:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-12-03 02:58:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2018-12-03 02:58:45,146 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2018-12-03 02:58:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:45,146 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2018-12-03 02:58:45,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:58:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2018-12-03 02:58:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 02:58:45,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:45,147 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-12-03 02:58:45,148 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:45,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2018-12-03 02:58:45,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:45,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:45,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:45,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:45,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:45,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:45,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:45,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:45,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:45,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:45,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:45,167 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2018-12-03 02:58:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:45,256 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2018-12-03 02:58:45,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:45,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 02:58:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:45,259 INFO L225 Difference]: With dead ends: 1081 [2018-12-03 02:58:45,259 INFO L226 Difference]: Without dead ends: 1049 [2018-12-03 02:58:45,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-12-03 02:58:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2018-12-03 02:58:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-03 02:58:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2018-12-03 02:58:45,296 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2018-12-03 02:58:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:45,297 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2018-12-03 02:58:45,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2018-12-03 02:58:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 02:58:45,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:45,298 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-12-03 02:58:45,298 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:45,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2018-12-03 02:58:45,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:45,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:45,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:45,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:45,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:45,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:45,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:58:45,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:45,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:58:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:58:45,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:58:45,321 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2018-12-03 02:58:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:45,363 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2018-12-03 02:58:45,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:58:45,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-03 02:58:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:45,366 INFO L225 Difference]: With dead ends: 966 [2018-12-03 02:58:45,366 INFO L226 Difference]: Without dead ends: 944 [2018-12-03 02:58:45,367 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-12-03 02:58:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-12-03 02:58:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2018-12-03 02:58:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-03 02:58:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2018-12-03 02:58:45,417 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2018-12-03 02:58:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:45,418 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2018-12-03 02:58:45,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:58:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2018-12-03 02:58:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 02:58:45,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:45,419 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-12-03 02:58:45,419 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:45,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2018-12-03 02:58:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:45,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:45,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:45,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:45,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:58:45,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:45,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:58:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:58:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:45,455 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2018-12-03 02:58:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:46,057 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2018-12-03 02:58:46,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:58:46,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-03 02:58:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:46,061 INFO L225 Difference]: With dead ends: 1110 [2018-12-03 02:58:46,061 INFO L226 Difference]: Without dead ends: 1016 [2018-12-03 02:58:46,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:58:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-12-03 02:58:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2018-12-03 02:58:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-03 02:58:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2018-12-03 02:58:46,105 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2018-12-03 02:58:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:46,106 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2018-12-03 02:58:46,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:58:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2018-12-03 02:58:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 02:58:46,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:46,107 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-12-03 02:58:46,108 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:46,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2018-12-03 02:58:46,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:46,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:46,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:46,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 02:58:46,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:46,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:58:46,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:58:46,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:58:46,171 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 9 states. [2018-12-03 02:58:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:47,304 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2018-12-03 02:58:47,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 02:58:47,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-03 02:58:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:47,307 INFO L225 Difference]: With dead ends: 1188 [2018-12-03 02:58:47,307 INFO L226 Difference]: Without dead ends: 1119 [2018-12-03 02:58:47,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-12-03 02:58:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-03 02:58:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 887. [2018-12-03 02:58:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-03 02:58:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1205 transitions. [2018-12-03 02:58:47,339 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1205 transitions. Word has length 50 [2018-12-03 02:58:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:47,340 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1205 transitions. [2018-12-03 02:58:47,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:58:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1205 transitions. [2018-12-03 02:58:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 02:58:47,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:47,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:47,341 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:47,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2018-12-03 02:58:47,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:47,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:47,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:47,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:47,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:47,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:47,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:47,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:47,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:47,362 INFO L87 Difference]: Start difference. First operand 887 states and 1205 transitions. Second operand 3 states. [2018-12-03 02:58:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:47,436 INFO L93 Difference]: Finished difference Result 912 states and 1233 transitions. [2018-12-03 02:58:47,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:47,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 02:58:47,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:47,438 INFO L225 Difference]: With dead ends: 912 [2018-12-03 02:58:47,438 INFO L226 Difference]: Without dead ends: 907 [2018-12-03 02:58:47,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-12-03 02:58:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 903. [2018-12-03 02:58:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-12-03 02:58:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2018-12-03 02:58:47,469 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 52 [2018-12-03 02:58:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:47,469 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2018-12-03 02:58:47,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2018-12-03 02:58:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 02:58:47,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:47,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:47,471 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:47,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2018-12-03 02:58:47,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:47,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:47,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:47,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:47,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:47,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:47,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:47,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:47,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:47,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:47,489 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand 3 states. [2018-12-03 02:58:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:47,546 INFO L93 Difference]: Finished difference Result 1116 states and 1511 transitions. [2018-12-03 02:58:47,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:47,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 02:58:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:47,549 INFO L225 Difference]: With dead ends: 1116 [2018-12-03 02:58:47,549 INFO L226 Difference]: Without dead ends: 875 [2018-12-03 02:58:47,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-12-03 02:58:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2018-12-03 02:58:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-03 02:58:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1187 transitions. [2018-12-03 02:58:47,581 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1187 transitions. Word has length 54 [2018-12-03 02:58:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:47,581 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1187 transitions. [2018-12-03 02:58:47,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1187 transitions. [2018-12-03 02:58:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 02:58:47,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:47,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:47,582 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:47,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:47,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2018-12-03 02:58:47,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:47,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:47,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:47,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:47,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:47,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:47,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:47,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:47,610 INFO L87 Difference]: Start difference. First operand 875 states and 1187 transitions. Second operand 5 states. [2018-12-03 02:58:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:47,949 INFO L93 Difference]: Finished difference Result 885 states and 1195 transitions. [2018-12-03 02:58:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:47,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-03 02:58:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:47,952 INFO L225 Difference]: With dead ends: 885 [2018-12-03 02:58:47,952 INFO L226 Difference]: Without dead ends: 879 [2018-12-03 02:58:47,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-03 02:58:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 875. [2018-12-03 02:58:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-03 02:58:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1186 transitions. [2018-12-03 02:58:48,020 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1186 transitions. Word has length 53 [2018-12-03 02:58:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:48,020 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1186 transitions. [2018-12-03 02:58:48,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1186 transitions. [2018-12-03 02:58:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 02:58:48,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:48,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:48,023 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:48,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2018-12-03 02:58:48,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:48,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:48,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:48,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:48,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:48,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:48,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:48,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:48,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:48,064 INFO L87 Difference]: Start difference. First operand 875 states and 1186 transitions. Second operand 5 states. [2018-12-03 02:58:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:48,358 INFO L93 Difference]: Finished difference Result 887 states and 1197 transitions. [2018-12-03 02:58:48,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:48,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 02:58:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:48,360 INFO L225 Difference]: With dead ends: 887 [2018-12-03 02:58:48,360 INFO L226 Difference]: Without dead ends: 851 [2018-12-03 02:58:48,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-03 02:58:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 847. [2018-12-03 02:58:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-03 02:58:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1154 transitions. [2018-12-03 02:58:48,391 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1154 transitions. Word has length 52 [2018-12-03 02:58:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:48,391 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1154 transitions. [2018-12-03 02:58:48,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1154 transitions. [2018-12-03 02:58:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 02:58:48,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:48,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:48,393 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:48,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2018-12-03 02:58:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:48,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:48,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:48,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:48,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:48,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:48,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:48,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:48,431 INFO L87 Difference]: Start difference. First operand 847 states and 1154 transitions. Second operand 5 states. [2018-12-03 02:58:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:48,753 INFO L93 Difference]: Finished difference Result 855 states and 1160 transitions. [2018-12-03 02:58:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:48,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-03 02:58:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:48,755 INFO L225 Difference]: With dead ends: 855 [2018-12-03 02:58:48,755 INFO L226 Difference]: Without dead ends: 849 [2018-12-03 02:58:48,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-12-03 02:58:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2018-12-03 02:58:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-03 02:58:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2018-12-03 02:58:48,789 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2018-12-03 02:58:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:48,789 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2018-12-03 02:58:48,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2018-12-03 02:58:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:58:48,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:48,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] [2018-12-03 02:58:48,791 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:48,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2018-12-03 02:58:48,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:48,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:48,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:48,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:58:48,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:48,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:58:48,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:58:48,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:58:48,846 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 4 states. [2018-12-03 02:58:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:48,998 INFO L93 Difference]: Finished difference Result 886 states and 1194 transitions. [2018-12-03 02:58:48,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:58:48,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 02:58:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:49,000 INFO L225 Difference]: With dead ends: 886 [2018-12-03 02:58:49,001 INFO L226 Difference]: Without dead ends: 854 [2018-12-03 02:58:49,001 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-12-03 02:58:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-12-03 02:58:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 849. [2018-12-03 02:58:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-12-03 02:58:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1155 transitions. [2018-12-03 02:58:49,037 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1155 transitions. Word has length 55 [2018-12-03 02:58:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:49,037 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1155 transitions. [2018-12-03 02:58:49,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:58:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1155 transitions. [2018-12-03 02:58:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:58:49,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:49,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:49,039 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:49,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1261798154, now seen corresponding path program 1 times [2018-12-03 02:58:49,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:49,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:49,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:49,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:49,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 02:58:49,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:49,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:58:49,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:58:49,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:58:49,088 INFO L87 Difference]: Start difference. First operand 849 states and 1155 transitions. Second operand 9 states. [2018-12-03 02:58:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:49,221 INFO L93 Difference]: Finished difference Result 876 states and 1185 transitions. [2018-12-03 02:58:49,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:58:49,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-03 02:58:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:49,224 INFO L225 Difference]: With dead ends: 876 [2018-12-03 02:58:49,224 INFO L226 Difference]: Without dead ends: 838 [2018-12-03 02:58:49,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-12-03 02:58:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-12-03 02:58:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-12-03 02:58:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2018-12-03 02:58:49,262 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2018-12-03 02:58:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:49,262 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2018-12-03 02:58:49,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:58:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2018-12-03 02:58:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:58:49,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:49,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:49,264 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:49,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash -405944758, now seen corresponding path program 1 times [2018-12-03 02:58:49,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:49,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:49,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:49,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:49,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:58:49,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:49,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:58:49,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:58:49,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:58:49,367 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2018-12-03 02:58:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:49,543 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2018-12-03 02:58:49,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:58:49,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-03 02:58:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:49,545 INFO L225 Difference]: With dead ends: 854 [2018-12-03 02:58:49,545 INFO L226 Difference]: Without dead ends: 836 [2018-12-03 02:58:49,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-12-03 02:58:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2018-12-03 02:58:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-12-03 02:58:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2018-12-03 02:58:49,605 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 56 [2018-12-03 02:58:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:49,605 INFO L480 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2018-12-03 02:58:49,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:58:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2018-12-03 02:58:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:58:49,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:49,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:49,607 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:49,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash 64942578, now seen corresponding path program 1 times [2018-12-03 02:58:49,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:49,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:49,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-12-03 02:58:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:49,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:58:49,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:49,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:58:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:58:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:58:49,683 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2018-12-03 02:58:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:49,825 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2018-12-03 02:58:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:58:49,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-03 02:58:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:49,827 INFO L225 Difference]: With dead ends: 849 [2018-12-03 02:58:49,827 INFO L226 Difference]: Without dead ends: 831 [2018-12-03 02:58:49,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-03 02:58:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-12-03 02:58:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-03 02:58:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2018-12-03 02:58:49,857 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 55 [2018-12-03 02:58:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:49,857 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2018-12-03 02:58:49,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:58:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2018-12-03 02:58:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 02:58:49,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:49,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:49,858 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:49,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash 804739700, now seen corresponding path program 1 times [2018-12-03 02:58:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:49,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:49,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:49,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-12-03 02:58:49,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:49,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:49,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:49,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:49,890 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 5 states. [2018-12-03 02:58:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:50,400 INFO L93 Difference]: Finished difference Result 1378 states and 1925 transitions. [2018-12-03 02:58:50,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:58:50,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-03 02:58:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:50,403 INFO L225 Difference]: With dead ends: 1378 [2018-12-03 02:58:50,403 INFO L226 Difference]: Without dead ends: 1214 [2018-12-03 02:58:50,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-12-03 02:58:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 869. [2018-12-03 02:58:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-12-03 02:58:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1173 transitions. [2018-12-03 02:58:50,439 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1173 transitions. Word has length 61 [2018-12-03 02:58:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:50,439 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1173 transitions. [2018-12-03 02:58:50,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1173 transitions. [2018-12-03 02:58:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 02:58:50,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:50,441 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-12-03 02:58:50,441 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:50,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2018-12-03 02:58:50,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:50,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:50,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:50,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:50,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:50,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:50,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:50,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:50,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:50,531 INFO L87 Difference]: Start difference. First operand 869 states and 1173 transitions. Second operand 11 states. [2018-12-03 02:58:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:50,696 INFO L93 Difference]: Finished difference Result 886 states and 1191 transitions. [2018-12-03 02:58:50,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:50,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-12-03 02:58:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:50,698 INFO L225 Difference]: With dead ends: 886 [2018-12-03 02:58:50,698 INFO L226 Difference]: Without dead ends: 866 [2018-12-03 02:58:50,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-12-03 02:58:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2018-12-03 02:58:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-12-03 02:58:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1168 transitions. [2018-12-03 02:58:50,732 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1168 transitions. Word has length 58 [2018-12-03 02:58:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:50,732 INFO L480 AbstractCegarLoop]: Abstraction has 866 states and 1168 transitions. [2018-12-03 02:58:50,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1168 transitions. [2018-12-03 02:58:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 02:58:50,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:50,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:50,734 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:50,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1661318765, now seen corresponding path program 1 times [2018-12-03 02:58:50,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:50,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:50,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:50,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:50,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:50,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-12-03 02:58:50,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:50,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:50,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:50,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:50,780 INFO L87 Difference]: Start difference. First operand 866 states and 1168 transitions. Second operand 5 states. [2018-12-03 02:58:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:50,925 INFO L93 Difference]: Finished difference Result 901 states and 1210 transitions. [2018-12-03 02:58:50,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:50,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-03 02:58:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:50,927 INFO L225 Difference]: With dead ends: 901 [2018-12-03 02:58:50,927 INFO L226 Difference]: Without dead ends: 873 [2018-12-03 02:58:50,927 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-12-03 02:58:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-12-03 02:58:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 871. [2018-12-03 02:58:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-12-03 02:58:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1177 transitions. [2018-12-03 02:58:50,971 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1177 transitions. Word has length 62 [2018-12-03 02:58:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:50,971 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1177 transitions. [2018-12-03 02:58:50,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1177 transitions. [2018-12-03 02:58:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:58:50,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:50,972 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] [2018-12-03 02:58:50,972 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:50,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash -894292447, now seen corresponding path program 1 times [2018-12-03 02:58:50,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:50,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:50,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:50,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:50,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:51,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:51,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:58:51,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:51,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:58:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:58:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:58:51,057 INFO L87 Difference]: Start difference. First operand 871 states and 1177 transitions. Second operand 12 states. [2018-12-03 02:58:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:51,252 INFO L93 Difference]: Finished difference Result 897 states and 1206 transitions. [2018-12-03 02:58:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:58:51,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-12-03 02:58:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:51,254 INFO L225 Difference]: With dead ends: 897 [2018-12-03 02:58:51,254 INFO L226 Difference]: Without dead ends: 872 [2018-12-03 02:58:51,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:58:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-12-03 02:58:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-12-03 02:58:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-12-03 02:58:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1166 transitions. [2018-12-03 02:58:51,287 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1166 transitions. Word has length 59 [2018-12-03 02:58:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:51,288 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1166 transitions. [2018-12-03 02:58:51,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:58:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1166 transitions. [2018-12-03 02:58:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:58:51,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:51,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] [2018-12-03 02:58:51,289 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:51,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2018-12-03 02:58:51,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:51,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:51,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:51,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:51,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:51,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:51,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:51,324 INFO L87 Difference]: Start difference. First operand 870 states and 1166 transitions. Second operand 3 states. [2018-12-03 02:58:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:51,354 INFO L93 Difference]: Finished difference Result 904 states and 1200 transitions. [2018-12-03 02:58:51,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:51,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 02:58:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:51,356 INFO L225 Difference]: With dead ends: 904 [2018-12-03 02:58:51,356 INFO L226 Difference]: Without dead ends: 872 [2018-12-03 02:58:51,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-12-03 02:58:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-12-03 02:58:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-12-03 02:58:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1165 transitions. [2018-12-03 02:58:51,389 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1165 transitions. Word has length 59 [2018-12-03 02:58:51,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:51,389 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1165 transitions. [2018-12-03 02:58:51,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1165 transitions. [2018-12-03 02:58:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:58:51,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:51,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:51,391 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:51,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:51,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1685241316, now seen corresponding path program 1 times [2018-12-03 02:58:51,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:51,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:51,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-12-03 02:58:51,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:51,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 02:58:51,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:51,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:58:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:58:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:58:51,436 INFO L87 Difference]: Start difference. First operand 870 states and 1165 transitions. Second operand 9 states. [2018-12-03 02:58:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:51,565 INFO L93 Difference]: Finished difference Result 892 states and 1188 transitions. [2018-12-03 02:58:51,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:58:51,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-12-03 02:58:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:51,567 INFO L225 Difference]: With dead ends: 892 [2018-12-03 02:58:51,567 INFO L226 Difference]: Without dead ends: 858 [2018-12-03 02:58:51,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-12-03 02:58:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2018-12-03 02:58:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-12-03 02:58:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1145 transitions. [2018-12-03 02:58:51,599 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1145 transitions. Word has length 59 [2018-12-03 02:58:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:51,599 INFO L480 AbstractCegarLoop]: Abstraction has 858 states and 1145 transitions. [2018-12-03 02:58:51,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:58:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1145 transitions. [2018-12-03 02:58:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 02:58:51,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:51,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:51,601 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:51,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2018-12-03 02:58:51,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:51,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:51,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:51,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:51,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:58:51,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:51,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:58:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:58:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:58:51,618 INFO L87 Difference]: Start difference. First operand 858 states and 1145 transitions. Second operand 4 states. [2018-12-03 02:58:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:51,737 INFO L93 Difference]: Finished difference Result 1019 states and 1374 transitions. [2018-12-03 02:58:51,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:58:51,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-03 02:58:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:51,740 INFO L225 Difference]: With dead ends: 1019 [2018-12-03 02:58:51,740 INFO L226 Difference]: Without dead ends: 903 [2018-12-03 02:58:51,740 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-12-03 02:58:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-12-03 02:58:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 865. [2018-12-03 02:58:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-03 02:58:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1161 transitions. [2018-12-03 02:58:51,773 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1161 transitions. Word has length 60 [2018-12-03 02:58:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:51,773 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1161 transitions. [2018-12-03 02:58:51,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:58:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1161 transitions. [2018-12-03 02:58:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 02:58:51,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:51,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:51,774 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:51,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2018-12-03 02:58:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:51,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:51,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:51,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:51,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:51,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:51,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:51,837 INFO L87 Difference]: Start difference. First operand 865 states and 1161 transitions. Second operand 11 states. [2018-12-03 02:58:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:51,938 INFO L93 Difference]: Finished difference Result 934 states and 1254 transitions. [2018-12-03 02:58:51,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:51,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-03 02:58:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:51,940 INFO L225 Difference]: With dead ends: 934 [2018-12-03 02:58:51,940 INFO L226 Difference]: Without dead ends: 879 [2018-12-03 02:58:51,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-03 02:58:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 869. [2018-12-03 02:58:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-12-03 02:58:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1179 transitions. [2018-12-03 02:58:51,973 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1179 transitions. Word has length 60 [2018-12-03 02:58:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:51,973 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1179 transitions. [2018-12-03 02:58:51,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1179 transitions. [2018-12-03 02:58:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 02:58:51,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:51,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:51,975 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:51,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:51,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2018-12-03 02:58:51,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:51,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:51,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:51,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:52,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:52,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 02:58:52,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:52,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:58:52,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:58:52,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:58:52,030 INFO L87 Difference]: Start difference. First operand 869 states and 1179 transitions. Second operand 9 states. [2018-12-03 02:58:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:52,169 INFO L93 Difference]: Finished difference Result 900 states and 1216 transitions. [2018-12-03 02:58:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:58:52,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-03 02:58:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:52,172 INFO L225 Difference]: With dead ends: 900 [2018-12-03 02:58:52,172 INFO L226 Difference]: Without dead ends: 861 [2018-12-03 02:58:52,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-12-03 02:58:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2018-12-03 02:58:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-03 02:58:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1163 transitions. [2018-12-03 02:58:52,206 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1163 transitions. Word has length 60 [2018-12-03 02:58:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:52,206 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1163 transitions. [2018-12-03 02:58:52,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:58:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1163 transitions. [2018-12-03 02:58:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 02:58:52,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:52,207 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-12-03 02:58:52,207 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:52,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2018-12-03 02:58:52,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:52,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:52,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:52,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:52,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 02:58:52,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:52,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:58:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:58:52,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:52,295 INFO L87 Difference]: Start difference. First operand 861 states and 1163 transitions. Second operand 13 states. [2018-12-03 02:58:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:52,483 INFO L93 Difference]: Finished difference Result 878 states and 1181 transitions. [2018-12-03 02:58:52,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:58:52,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-03 02:58:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:52,486 INFO L225 Difference]: With dead ends: 878 [2018-12-03 02:58:52,486 INFO L226 Difference]: Without dead ends: 856 [2018-12-03 02:58:52,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:58:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-12-03 02:58:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-12-03 02:58:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-03 02:58:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1156 transitions. [2018-12-03 02:58:52,528 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1156 transitions. Word has length 63 [2018-12-03 02:58:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:52,528 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1156 transitions. [2018-12-03 02:58:52,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:58:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1156 transitions. [2018-12-03 02:58:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 02:58:52,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:52,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:52,531 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:52,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2018-12-03 02:58:52,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:52,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:52,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:52,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:52,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:52,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:52,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 02:58:52,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:52,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:58:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:58:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:52,638 INFO L87 Difference]: Start difference. First operand 856 states and 1156 transitions. Second operand 13 states. [2018-12-03 02:58:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:52,804 INFO L93 Difference]: Finished difference Result 873 states and 1174 transitions. [2018-12-03 02:58:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:58:52,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-03 02:58:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:52,807 INFO L225 Difference]: With dead ends: 873 [2018-12-03 02:58:52,807 INFO L226 Difference]: Without dead ends: 851 [2018-12-03 02:58:52,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:58:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-03 02:58:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2018-12-03 02:58:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-03 02:58:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1149 transitions. [2018-12-03 02:58:52,845 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1149 transitions. Word has length 62 [2018-12-03 02:58:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:52,845 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1149 transitions. [2018-12-03 02:58:52,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:58:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1149 transitions. [2018-12-03 02:58:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 02:58:52,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:52,846 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] [2018-12-03 02:58:52,846 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:52,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:52,846 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2018-12-03 02:58:52,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:52,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:52,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:52,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:52,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:52,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:52,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:52,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:52,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:52,867 INFO L87 Difference]: Start difference. First operand 851 states and 1149 transitions. Second operand 3 states. [2018-12-03 02:58:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:52,901 INFO L93 Difference]: Finished difference Result 1129 states and 1526 transitions. [2018-12-03 02:58:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:52,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-03 02:58:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:52,903 INFO L225 Difference]: With dead ends: 1129 [2018-12-03 02:58:52,903 INFO L226 Difference]: Without dead ends: 790 [2018-12-03 02:58:52,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-03 02:58:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 741. [2018-12-03 02:58:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 02:58:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 966 transitions. [2018-12-03 02:58:52,933 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 966 transitions. Word has length 62 [2018-12-03 02:58:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:52,933 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 966 transitions. [2018-12-03 02:58:52,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 966 transitions. [2018-12-03 02:58:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 02:58:52,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:52,934 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-12-03 02:58:52,934 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:52,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash -930632011, now seen corresponding path program 1 times [2018-12-03 02:58:52,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:52,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:52,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:52,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:52,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:53,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:53,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:58:53,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:53,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:58:53,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:58:53,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:58:53,007 INFO L87 Difference]: Start difference. First operand 741 states and 966 transitions. Second operand 12 states. [2018-12-03 02:58:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:53,145 INFO L93 Difference]: Finished difference Result 763 states and 989 transitions. [2018-12-03 02:58:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:58:53,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-12-03 02:58:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:53,147 INFO L225 Difference]: With dead ends: 763 [2018-12-03 02:58:53,147 INFO L226 Difference]: Without dead ends: 739 [2018-12-03 02:58:53,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:58:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-12-03 02:58:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2018-12-03 02:58:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-03 02:58:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 961 transitions. [2018-12-03 02:58:53,175 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 961 transitions. Word has length 63 [2018-12-03 02:58:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:53,176 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 961 transitions. [2018-12-03 02:58:53,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:58:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 961 transitions. [2018-12-03 02:58:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 02:58:53,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:53,177 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:53,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:53,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1253285750, now seen corresponding path program 1 times [2018-12-03 02:58:53,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:53,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:53,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:53,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:58:53,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:53,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:58:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:58:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:58:53,255 INFO L87 Difference]: Start difference. First operand 739 states and 961 transitions. Second operand 12 states. [2018-12-03 02:58:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:53,382 INFO L93 Difference]: Finished difference Result 763 states and 986 transitions. [2018-12-03 02:58:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:58:53,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-03 02:58:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:53,384 INFO L225 Difference]: With dead ends: 763 [2018-12-03 02:58:53,384 INFO L226 Difference]: Without dead ends: 739 [2018-12-03 02:58:53,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:58:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-12-03 02:58:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2018-12-03 02:58:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-03 02:58:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 957 transitions. [2018-12-03 02:58:53,411 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 957 transitions. Word has length 66 [2018-12-03 02:58:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:53,411 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 957 transitions. [2018-12-03 02:58:53,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:58:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 957 transitions. [2018-12-03 02:58:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 02:58:53,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:53,413 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] [2018-12-03 02:58:53,413 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:53,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1932048657, now seen corresponding path program 1 times [2018-12-03 02:58:53,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:53,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:53,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:53,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:58:53,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:53,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:58:53,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:58:53,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:58:53,476 INFO L87 Difference]: Start difference. First operand 737 states and 957 transitions. Second operand 12 states. [2018-12-03 02:58:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:53,604 INFO L93 Difference]: Finished difference Result 761 states and 982 transitions. [2018-12-03 02:58:53,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:58:53,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-12-03 02:58:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:53,607 INFO L225 Difference]: With dead ends: 761 [2018-12-03 02:58:53,607 INFO L226 Difference]: Without dead ends: 737 [2018-12-03 02:58:53,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:58:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-12-03 02:58:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 735. [2018-12-03 02:58:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-12-03 02:58:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 953 transitions. [2018-12-03 02:58:53,636 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 953 transitions. Word has length 62 [2018-12-03 02:58:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:53,636 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 953 transitions. [2018-12-03 02:58:53,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:58:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 953 transitions. [2018-12-03 02:58:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 02:58:53,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:53,638 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] [2018-12-03 02:58:53,638 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:53,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:53,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1755012540, now seen corresponding path program 1 times [2018-12-03 02:58:53,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:53,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-12-03 02:58:53,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:53,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:53,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:53,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:53,660 INFO L87 Difference]: Start difference. First operand 735 states and 953 transitions. Second operand 3 states. [2018-12-03 02:58:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:53,691 INFO L93 Difference]: Finished difference Result 865 states and 1126 transitions. [2018-12-03 02:58:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:53,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 02:58:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:53,693 INFO L225 Difference]: With dead ends: 865 [2018-12-03 02:58:53,693 INFO L226 Difference]: Without dead ends: 735 [2018-12-03 02:58:53,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-03 02:58:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2018-12-03 02:58:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-12-03 02:58:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 950 transitions. [2018-12-03 02:58:53,723 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 950 transitions. Word has length 66 [2018-12-03 02:58:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:53,723 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 950 transitions. [2018-12-03 02:58:53,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 950 transitions. [2018-12-03 02:58:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 02:58:53,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:53,724 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 02:58:53,724 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:53,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:53,725 INFO L82 PathProgramCache]: Analyzing trace with hash 500473129, now seen corresponding path program 1 times [2018-12-03 02:58:53,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:58:53,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:53,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:58:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:58:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:53,746 INFO L87 Difference]: Start difference. First operand 735 states and 950 transitions. Second operand 3 states. [2018-12-03 02:58:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:53,780 INFO L93 Difference]: Finished difference Result 944 states and 1218 transitions. [2018-12-03 02:58:53,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:58:53,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-03 02:58:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:53,782 INFO L225 Difference]: With dead ends: 944 [2018-12-03 02:58:53,782 INFO L226 Difference]: Without dead ends: 807 [2018-12-03 02:58:53,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:58:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-12-03 02:58:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 776. [2018-12-03 02:58:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-03 02:58:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1001 transitions. [2018-12-03 02:58:53,813 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1001 transitions. Word has length 80 [2018-12-03 02:58:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:53,813 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1001 transitions. [2018-12-03 02:58:53,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:58:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1001 transitions. [2018-12-03 02:58:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 02:58:53,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:53,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:53,814 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:53,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2018-12-03 02:58:53,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:53,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:53,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:53,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:53,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:53,841 INFO L87 Difference]: Start difference. First operand 776 states and 1001 transitions. Second operand 5 states. [2018-12-03 02:58:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:53,908 INFO L93 Difference]: Finished difference Result 830 states and 1060 transitions. [2018-12-03 02:58:53,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:53,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-03 02:58:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:53,909 INFO L225 Difference]: With dead ends: 830 [2018-12-03 02:58:53,909 INFO L226 Difference]: Without dead ends: 778 [2018-12-03 02:58:53,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-12-03 02:58:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-12-03 02:58:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-03 02:58:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1000 transitions. [2018-12-03 02:58:53,939 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1000 transitions. Word has length 65 [2018-12-03 02:58:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:53,939 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1000 transitions. [2018-12-03 02:58:53,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1000 transitions. [2018-12-03 02:58:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 02:58:53,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:53,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:53,941 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:53,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash 21902732, now seen corresponding path program 1 times [2018-12-03 02:58:53,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:53,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:53,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:53,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:53,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:53,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:53,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:53,974 INFO L87 Difference]: Start difference. First operand 776 states and 1000 transitions. Second operand 5 states. [2018-12-03 02:58:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:54,081 INFO L93 Difference]: Finished difference Result 840 states and 1075 transitions. [2018-12-03 02:58:54,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:58:54,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-03 02:58:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:54,083 INFO L225 Difference]: With dead ends: 840 [2018-12-03 02:58:54,083 INFO L226 Difference]: Without dead ends: 807 [2018-12-03 02:58:54,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-12-03 02:58:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 782. [2018-12-03 02:58:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-12-03 02:58:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1007 transitions. [2018-12-03 02:58:54,117 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1007 transitions. Word has length 65 [2018-12-03 02:58:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:54,117 INFO L480 AbstractCegarLoop]: Abstraction has 782 states and 1007 transitions. [2018-12-03 02:58:54,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1007 transitions. [2018-12-03 02:58:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 02:58:54,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:54,119 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] [2018-12-03 02:58:54,119 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:54,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash 544587914, now seen corresponding path program 1 times [2018-12-03 02:58:54,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:54,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:54,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:54,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:54,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:54,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:54,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:54,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:54,174 INFO L87 Difference]: Start difference. First operand 782 states and 1007 transitions. Second operand 11 states. [2018-12-03 02:58:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:54,267 INFO L93 Difference]: Finished difference Result 804 states and 1030 transitions. [2018-12-03 02:58:54,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:54,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-12-03 02:58:54,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:54,268 INFO L225 Difference]: With dead ends: 804 [2018-12-03 02:58:54,268 INFO L226 Difference]: Without dead ends: 778 [2018-12-03 02:58:54,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-12-03 02:58:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 772. [2018-12-03 02:58:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-03 02:58:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 993 transitions. [2018-12-03 02:58:54,298 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 993 transitions. Word has length 66 [2018-12-03 02:58:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:54,298 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 993 transitions. [2018-12-03 02:58:54,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 993 transitions. [2018-12-03 02:58:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 02:58:54,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:54,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:54,299 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:54,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash -900473525, now seen corresponding path program 1 times [2018-12-03 02:58:54,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:54,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:54,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:54,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:54,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:58:54,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:54,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:58:54,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:58:54,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:58:54,405 INFO L87 Difference]: Start difference. First operand 772 states and 993 transitions. Second operand 12 states. [2018-12-03 02:58:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:54,533 INFO L93 Difference]: Finished difference Result 795 states and 1017 transitions. [2018-12-03 02:58:54,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:58:54,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-03 02:58:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:54,535 INFO L225 Difference]: With dead ends: 795 [2018-12-03 02:58:54,535 INFO L226 Difference]: Without dead ends: 772 [2018-12-03 02:58:54,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:58:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-12-03 02:58:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2018-12-03 02:58:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-03 02:58:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 992 transitions. [2018-12-03 02:58:54,566 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 992 transitions. Word has length 70 [2018-12-03 02:58:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:54,566 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 992 transitions. [2018-12-03 02:58:54,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:58:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 992 transitions. [2018-12-03 02:58:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 02:58:54,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:54,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:54,567 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:54,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash 813191735, now seen corresponding path program 1 times [2018-12-03 02:58:54,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:54,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:54,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:58:54,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:54,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:58:54,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:58:54,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:58:54,623 INFO L87 Difference]: Start difference. First operand 772 states and 992 transitions. Second operand 12 states. [2018-12-03 02:58:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:54,740 INFO L93 Difference]: Finished difference Result 794 states and 1015 transitions. [2018-12-03 02:58:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:58:54,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-03 02:58:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:54,742 INFO L225 Difference]: With dead ends: 794 [2018-12-03 02:58:54,742 INFO L226 Difference]: Without dead ends: 770 [2018-12-03 02:58:54,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:58:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-12-03 02:58:54,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2018-12-03 02:58:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-12-03 02:58:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 988 transitions. [2018-12-03 02:58:54,771 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 988 transitions. Word has length 67 [2018-12-03 02:58:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:54,771 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 988 transitions. [2018-12-03 02:58:54,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:58:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 988 transitions. [2018-12-03 02:58:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 02:58:54,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:54,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:54,773 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:54,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2018-12-03 02:58:54,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:54,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:54,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:54,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:54,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:54,797 INFO L87 Difference]: Start difference. First operand 770 states and 988 transitions. Second operand 5 states. [2018-12-03 02:58:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:54,848 INFO L93 Difference]: Finished difference Result 811 states and 1032 transitions. [2018-12-03 02:58:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:54,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 02:58:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:54,849 INFO L225 Difference]: With dead ends: 811 [2018-12-03 02:58:54,849 INFO L226 Difference]: Without dead ends: 777 [2018-12-03 02:58:54,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-12-03 02:58:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 770. [2018-12-03 02:58:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-12-03 02:58:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 987 transitions. [2018-12-03 02:58:54,879 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 987 transitions. Word has length 67 [2018-12-03 02:58:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:54,879 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 987 transitions. [2018-12-03 02:58:54,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 987 transitions. [2018-12-03 02:58:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:58:54,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:54,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:54,880 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:54,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:54,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1319946579, now seen corresponding path program 1 times [2018-12-03 02:58:54,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:54,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:58:54,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:54,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:58:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:58:54,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:54,935 INFO L87 Difference]: Start difference. First operand 770 states and 987 transitions. Second operand 6 states. [2018-12-03 02:58:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:54,997 INFO L93 Difference]: Finished difference Result 809 states and 1028 transitions. [2018-12-03 02:58:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:58:54,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-03 02:58:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:54,998 INFO L225 Difference]: With dead ends: 809 [2018-12-03 02:58:54,999 INFO L226 Difference]: Without dead ends: 777 [2018-12-03 02:58:54,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-12-03 02:58:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 772. [2018-12-03 02:58:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-03 02:58:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 989 transitions. [2018-12-03 02:58:55,028 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 989 transitions. Word has length 68 [2018-12-03 02:58:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:55,028 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 989 transitions. [2018-12-03 02:58:55,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:58:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 989 transitions. [2018-12-03 02:58:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:58:55,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:55,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:55,029 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:55,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash 810473489, now seen corresponding path program 1 times [2018-12-03 02:58:55,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:55,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:55,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:55,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:55,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:55,074 INFO L87 Difference]: Start difference. First operand 772 states and 989 transitions. Second operand 11 states. [2018-12-03 02:58:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:55,162 INFO L93 Difference]: Finished difference Result 797 states and 1016 transitions. [2018-12-03 02:58:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:55,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-12-03 02:58:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:55,164 INFO L225 Difference]: With dead ends: 797 [2018-12-03 02:58:55,164 INFO L226 Difference]: Without dead ends: 764 [2018-12-03 02:58:55,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-12-03 02:58:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2018-12-03 02:58:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-12-03 02:58:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 979 transitions. [2018-12-03 02:58:55,200 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 979 transitions. Word has length 68 [2018-12-03 02:58:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:55,200 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 979 transitions. [2018-12-03 02:58:55,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 979 transitions. [2018-12-03 02:58:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:58:55,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:55,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:55,202 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:55,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2018-12-03 02:58:55,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:55,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:55,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:58:55,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:55,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:58:55,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:58:55,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:55,256 INFO L87 Difference]: Start difference. First operand 764 states and 979 transitions. Second operand 6 states. [2018-12-03 02:58:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:55,319 INFO L93 Difference]: Finished difference Result 811 states and 1027 transitions. [2018-12-03 02:58:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:58:55,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-03 02:58:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:55,321 INFO L225 Difference]: With dead ends: 811 [2018-12-03 02:58:55,321 INFO L226 Difference]: Without dead ends: 759 [2018-12-03 02:58:55,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-12-03 02:58:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2018-12-03 02:58:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-12-03 02:58:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 966 transitions. [2018-12-03 02:58:55,366 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 966 transitions. Word has length 68 [2018-12-03 02:58:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:55,366 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 966 transitions. [2018-12-03 02:58:55,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:58:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 966 transitions. [2018-12-03 02:58:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:58:55,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:55,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:55,368 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:55,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:55,368 INFO L82 PathProgramCache]: Analyzing trace with hash 631462302, now seen corresponding path program 1 times [2018-12-03 02:58:55,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:55,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:55,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:55,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:55,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:55,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:55,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:55,417 INFO L87 Difference]: Start difference. First operand 757 states and 966 transitions. Second operand 11 states. [2018-12-03 02:58:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:55,502 INFO L93 Difference]: Finished difference Result 779 states and 989 transitions. [2018-12-03 02:58:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:55,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-12-03 02:58:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:55,503 INFO L225 Difference]: With dead ends: 779 [2018-12-03 02:58:55,503 INFO L226 Difference]: Without dead ends: 747 [2018-12-03 02:58:55,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-12-03 02:58:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2018-12-03 02:58:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-12-03 02:58:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 952 transitions. [2018-12-03 02:58:55,532 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 952 transitions. Word has length 68 [2018-12-03 02:58:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 952 transitions. [2018-12-03 02:58:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 952 transitions. [2018-12-03 02:58:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:58:55,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:55,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:55,533 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:55,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -715584647, now seen corresponding path program 1 times [2018-12-03 02:58:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:55,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:55,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:55,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:55,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:55,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:55,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:55,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:55,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:55,552 INFO L87 Difference]: Start difference. First operand 747 states and 952 transitions. Second operand 5 states. [2018-12-03 02:58:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:55,771 INFO L93 Difference]: Finished difference Result 808 states and 1031 transitions. [2018-12-03 02:58:55,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:55,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-03 02:58:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:55,773 INFO L225 Difference]: With dead ends: 808 [2018-12-03 02:58:55,773 INFO L226 Difference]: Without dead ends: 802 [2018-12-03 02:58:55,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-12-03 02:58:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 747. [2018-12-03 02:58:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-12-03 02:58:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 951 transitions. [2018-12-03 02:58:55,803 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 951 transitions. Word has length 68 [2018-12-03 02:58:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:55,803 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 951 transitions. [2018-12-03 02:58:55,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 951 transitions. [2018-12-03 02:58:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:58:55,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:55,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:55,804 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:55,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2018-12-03 02:58:55,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:55,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:55,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:55,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:55,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:55,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:55,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:55,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:55,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:55,826 INFO L87 Difference]: Start difference. First operand 747 states and 951 transitions. Second operand 5 states. [2018-12-03 02:58:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:55,872 INFO L93 Difference]: Finished difference Result 788 states and 995 transitions. [2018-12-03 02:58:55,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:55,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-03 02:58:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:55,873 INFO L225 Difference]: With dead ends: 788 [2018-12-03 02:58:55,874 INFO L226 Difference]: Without dead ends: 754 [2018-12-03 02:58:55,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-12-03 02:58:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 747. [2018-12-03 02:58:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-12-03 02:58:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 950 transitions. [2018-12-03 02:58:55,903 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 950 transitions. Word has length 69 [2018-12-03 02:58:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:55,903 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 950 transitions. [2018-12-03 02:58:55,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 950 transitions. [2018-12-03 02:58:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:58:55,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:55,904 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] [2018-12-03 02:58:55,904 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:55,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:55,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1543083174, now seen corresponding path program 1 times [2018-12-03 02:58:55,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:55,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:55,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:55,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:58:55,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:55,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:58:55,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:58:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:55,943 INFO L87 Difference]: Start difference. First operand 747 states and 950 transitions. Second operand 6 states. [2018-12-03 02:58:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:56,002 INFO L93 Difference]: Finished difference Result 786 states and 991 transitions. [2018-12-03 02:58:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:58:56,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-03 02:58:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:56,003 INFO L225 Difference]: With dead ends: 786 [2018-12-03 02:58:56,004 INFO L226 Difference]: Without dead ends: 754 [2018-12-03 02:58:56,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-12-03 02:58:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 749. [2018-12-03 02:58:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-12-03 02:58:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 952 transitions. [2018-12-03 02:58:56,033 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 952 transitions. Word has length 69 [2018-12-03 02:58:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:56,033 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 952 transitions. [2018-12-03 02:58:56,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:58:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 952 transitions. [2018-12-03 02:58:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:58:56,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:56,034 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] [2018-12-03 02:58:56,034 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:56,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:56,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2052556264, now seen corresponding path program 1 times [2018-12-03 02:58:56,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:56,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:56,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:56,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:56,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:56,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:56,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:56,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:56,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:56,083 INFO L87 Difference]: Start difference. First operand 749 states and 952 transitions. Second operand 11 states. [2018-12-03 02:58:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:56,166 INFO L93 Difference]: Finished difference Result 774 states and 979 transitions. [2018-12-03 02:58:56,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:56,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-03 02:58:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:56,168 INFO L225 Difference]: With dead ends: 774 [2018-12-03 02:58:56,168 INFO L226 Difference]: Without dead ends: 742 [2018-12-03 02:58:56,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-03 02:58:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2018-12-03 02:58:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-03 02:58:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 943 transitions. [2018-12-03 02:58:56,199 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 943 transitions. Word has length 69 [2018-12-03 02:58:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:56,199 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 943 transitions. [2018-12-03 02:58:56,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 943 transitions. [2018-12-03 02:58:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:58:56,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:56,201 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] [2018-12-03 02:58:56,201 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:56,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2018-12-03 02:58:56,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:56,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:56,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:58:56,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:56,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:58:56,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:58:56,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:56,240 INFO L87 Difference]: Start difference. First operand 742 states and 943 transitions. Second operand 6 states. [2018-12-03 02:58:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:56,300 INFO L93 Difference]: Finished difference Result 781 states and 984 transitions. [2018-12-03 02:58:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:58:56,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-03 02:58:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:56,301 INFO L225 Difference]: With dead ends: 781 [2018-12-03 02:58:56,301 INFO L226 Difference]: Without dead ends: 749 [2018-12-03 02:58:56,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-12-03 02:58:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 744. [2018-12-03 02:58:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-03 02:58:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 945 transitions. [2018-12-03 02:58:56,330 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 945 transitions. Word has length 69 [2018-12-03 02:58:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:56,331 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 945 transitions. [2018-12-03 02:58:56,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:58:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 945 transitions. [2018-12-03 02:58:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:58:56,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:56,331 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] [2018-12-03 02:58:56,332 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:56,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1860763099, now seen corresponding path program 1 times [2018-12-03 02:58:56,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:56,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:56,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:56,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:56,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:56,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:56,393 INFO L87 Difference]: Start difference. First operand 744 states and 945 transitions. Second operand 11 states. [2018-12-03 02:58:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:56,491 INFO L93 Difference]: Finished difference Result 769 states and 972 transitions. [2018-12-03 02:58:56,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:56,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-03 02:58:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:56,492 INFO L225 Difference]: With dead ends: 769 [2018-12-03 02:58:56,492 INFO L226 Difference]: Without dead ends: 739 [2018-12-03 02:58:56,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:56,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-12-03 02:58:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2018-12-03 02:58:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-03 02:58:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 938 transitions. [2018-12-03 02:58:56,521 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 938 transitions. Word has length 69 [2018-12-03 02:58:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:56,522 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 938 transitions. [2018-12-03 02:58:56,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 938 transitions. [2018-12-03 02:58:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:58:56,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:56,522 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] [2018-12-03 02:58:56,523 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:56,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2018-12-03 02:58:56,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:56,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:56,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:56,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:56,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:56,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:56,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:56,581 INFO L87 Difference]: Start difference. First operand 739 states and 938 transitions. Second operand 11 states. [2018-12-03 02:58:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:56,697 INFO L93 Difference]: Finished difference Result 749 states and 947 transitions. [2018-12-03 02:58:56,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:56,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-03 02:58:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:56,699 INFO L225 Difference]: With dead ends: 749 [2018-12-03 02:58:56,699 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 02:58:56,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 02:58:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2018-12-03 02:58:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-03 02:58:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 934 transitions. [2018-12-03 02:58:56,728 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 934 transitions. Word has length 69 [2018-12-03 02:58:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:56,728 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 934 transitions. [2018-12-03 02:58:56,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 934 transitions. [2018-12-03 02:58:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:58:56,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:56,729 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] [2018-12-03 02:58:56,729 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:56,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1348884900, now seen corresponding path program 1 times [2018-12-03 02:58:56,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:56,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:56,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:56,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:56,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:56,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:56,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:56,759 INFO L87 Difference]: Start difference. First operand 737 states and 934 transitions. Second operand 5 states. [2018-12-03 02:58:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:56,967 INFO L93 Difference]: Finished difference Result 794 states and 1009 transitions. [2018-12-03 02:58:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:56,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-03 02:58:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:56,968 INFO L225 Difference]: With dead ends: 794 [2018-12-03 02:58:56,968 INFO L226 Difference]: Without dead ends: 732 [2018-12-03 02:58:56,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-12-03 02:58:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 681. [2018-12-03 02:58:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-12-03 02:58:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 863 transitions. [2018-12-03 02:58:56,996 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 863 transitions. Word has length 69 [2018-12-03 02:58:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:56,996 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 863 transitions. [2018-12-03 02:58:56,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 863 transitions. [2018-12-03 02:58:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 02:58:56,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:56,997 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] [2018-12-03 02:58:56,997 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:56,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash 459038371, now seen corresponding path program 1 times [2018-12-03 02:58:56,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:56,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:57,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:57,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:58:57,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:57,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:58:57,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:58:57,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:57,052 INFO L87 Difference]: Start difference. First operand 681 states and 863 transitions. Second operand 7 states. [2018-12-03 02:58:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:57,119 INFO L93 Difference]: Finished difference Result 727 states and 910 transitions. [2018-12-03 02:58:57,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:58:57,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-03 02:58:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:57,120 INFO L225 Difference]: With dead ends: 727 [2018-12-03 02:58:57,120 INFO L226 Difference]: Without dead ends: 682 [2018-12-03 02:58:57,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:58:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-03 02:58:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-12-03 02:58:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-12-03 02:58:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 859 transitions. [2018-12-03 02:58:57,148 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 859 transitions. Word has length 74 [2018-12-03 02:58:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:57,148 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 859 transitions. [2018-12-03 02:58:57,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:58:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 859 transitions. [2018-12-03 02:58:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 02:58:57,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:57,149 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] [2018-12-03 02:58:57,149 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:57,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1160638245, now seen corresponding path program 1 times [2018-12-03 02:58:57,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:57,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:57,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:57,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:57,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 02:58:57,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:57,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:58:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:58:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:58:57,216 INFO L87 Difference]: Start difference. First operand 680 states and 859 transitions. Second operand 14 states. [2018-12-03 02:58:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:57,349 INFO L93 Difference]: Finished difference Result 702 states and 882 transitions. [2018-12-03 02:58:57,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:58:57,350 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-12-03 02:58:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:57,351 INFO L225 Difference]: With dead ends: 702 [2018-12-03 02:58:57,351 INFO L226 Difference]: Without dead ends: 670 [2018-12-03 02:58:57,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:58:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-03 02:58:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-12-03 02:58:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-12-03 02:58:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 844 transitions. [2018-12-03 02:58:57,379 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 844 transitions. Word has length 74 [2018-12-03 02:58:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:57,379 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 844 transitions. [2018-12-03 02:58:57,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:58:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 844 transitions. [2018-12-03 02:58:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 02:58:57,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:57,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:57,380 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:57,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:57,380 INFO L82 PathProgramCache]: Analyzing trace with hash -198873651, now seen corresponding path program 1 times [2018-12-03 02:58:57,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:57,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:57,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:57,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:57,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:57,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:57,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 02:58:57,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:57,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:58:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:58:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:58:57,447 INFO L87 Difference]: Start difference. First operand 670 states and 844 transitions. Second operand 14 states. [2018-12-03 02:58:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:57,569 INFO L93 Difference]: Finished difference Result 694 states and 870 transitions. [2018-12-03 02:58:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:58:57,569 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-03 02:58:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:57,570 INFO L225 Difference]: With dead ends: 694 [2018-12-03 02:58:57,570 INFO L226 Difference]: Without dead ends: 667 [2018-12-03 02:58:57,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:58:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-12-03 02:58:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-12-03 02:58:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-12-03 02:58:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 839 transitions. [2018-12-03 02:58:57,597 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 839 transitions. Word has length 70 [2018-12-03 02:58:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:57,597 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 839 transitions. [2018-12-03 02:58:57,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:58:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 839 transitions. [2018-12-03 02:58:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 02:58:57,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:57,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:57,598 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:57,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2018-12-03 02:58:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:57,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:57,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:57,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:57,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:57,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:57,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 02:58:57,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:57,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:58:57,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:58:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:57,691 INFO L87 Difference]: Start difference. First operand 667 states and 839 transitions. Second operand 13 states. [2018-12-03 02:58:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:57,840 INFO L93 Difference]: Finished difference Result 687 states and 860 transitions. [2018-12-03 02:58:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:58:57,840 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-12-03 02:58:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:57,841 INFO L225 Difference]: With dead ends: 687 [2018-12-03 02:58:57,841 INFO L226 Difference]: Without dead ends: 662 [2018-12-03 02:58:57,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:58:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-12-03 02:58:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2018-12-03 02:58:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-12-03 02:58:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 831 transitions. [2018-12-03 02:58:57,868 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 831 transitions. Word has length 79 [2018-12-03 02:58:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:57,868 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 831 transitions. [2018-12-03 02:58:57,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:58:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 831 transitions. [2018-12-03 02:58:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 02:58:57,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:57,869 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] [2018-12-03 02:58:57,869 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:57,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2018-12-03 02:58:57,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:57,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:57,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:57,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:57,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 02:58:57,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:57,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:58:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:58:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:57,951 INFO L87 Difference]: Start difference. First operand 662 states and 831 transitions. Second operand 13 states. [2018-12-03 02:58:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:58,105 INFO L93 Difference]: Finished difference Result 679 states and 849 transitions. [2018-12-03 02:58:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:58:58,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-03 02:58:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:58,106 INFO L225 Difference]: With dead ends: 679 [2018-12-03 02:58:58,106 INFO L226 Difference]: Without dead ends: 652 [2018-12-03 02:58:58,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:58:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-12-03 02:58:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2018-12-03 02:58:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-03 02:58:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 819 transitions. [2018-12-03 02:58:58,133 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 819 transitions. Word has length 72 [2018-12-03 02:58:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:58,133 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 819 transitions. [2018-12-03 02:58:58,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:58:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 819 transitions. [2018-12-03 02:58:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 02:58:58,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:58,134 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] [2018-12-03 02:58:58,134 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:58,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2018-12-03 02:58:58,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:58,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:58,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:58,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:58,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 02:58:58,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:58,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:58:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:58:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:58,223 INFO L87 Difference]: Start difference. First operand 652 states and 819 transitions. Second operand 13 states. [2018-12-03 02:58:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:58,357 INFO L93 Difference]: Finished difference Result 654 states and 820 transitions. [2018-12-03 02:58:58,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:58:58,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-12-03 02:58:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:58,358 INFO L225 Difference]: With dead ends: 654 [2018-12-03 02:58:58,358 INFO L226 Difference]: Without dead ends: 601 [2018-12-03 02:58:58,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:58:58,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-12-03 02:58:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-12-03 02:58:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-12-03 02:58:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 761 transitions. [2018-12-03 02:58:58,383 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 761 transitions. Word has length 69 [2018-12-03 02:58:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:58,383 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 761 transitions. [2018-12-03 02:58:58,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:58:58,383 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 761 transitions. [2018-12-03 02:58:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 02:58:58,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:58,384 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-12-03 02:58:58,384 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:58,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:58,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1712334254, now seen corresponding path program 1 times [2018-12-03 02:58:58,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:58,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:58,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:58,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:58,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:58:58,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:58,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:58:58,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:58:58,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:58,404 INFO L87 Difference]: Start difference. First operand 601 states and 761 transitions. Second operand 5 states. [2018-12-03 02:58:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:58,440 INFO L93 Difference]: Finished difference Result 648 states and 810 transitions. [2018-12-03 02:58:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:58:58,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-03 02:58:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:58,441 INFO L225 Difference]: With dead ends: 648 [2018-12-03 02:58:58,441 INFO L226 Difference]: Without dead ends: 605 [2018-12-03 02:58:58,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:58:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-12-03 02:58:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 601. [2018-12-03 02:58:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-12-03 02:58:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 760 transitions. [2018-12-03 02:58:58,473 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 760 transitions. Word has length 71 [2018-12-03 02:58:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:58,473 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 760 transitions. [2018-12-03 02:58:58,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:58:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 760 transitions. [2018-12-03 02:58:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 02:58:58,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:58,474 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-12-03 02:58:58,474 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:58,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash -531649044, now seen corresponding path program 1 times [2018-12-03 02:58:58,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:58,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:58,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 02:58:58,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:58,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:58:58,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:58:58,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:58:58,553 INFO L87 Difference]: Start difference. First operand 601 states and 760 transitions. Second operand 14 states. [2018-12-03 02:58:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:58,678 INFO L93 Difference]: Finished difference Result 625 states and 786 transitions. [2018-12-03 02:58:58,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:58:58,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-03 02:58:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:58,679 INFO L225 Difference]: With dead ends: 625 [2018-12-03 02:58:58,679 INFO L226 Difference]: Without dead ends: 594 [2018-12-03 02:58:58,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:58:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-12-03 02:58:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2018-12-03 02:58:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-12-03 02:58:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 750 transitions. [2018-12-03 02:58:58,703 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 750 transitions. Word has length 71 [2018-12-03 02:58:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:58,704 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 750 transitions. [2018-12-03 02:58:58,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:58:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 750 transitions. [2018-12-03 02:58:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 02:58:58,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:58,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:58:58,704 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:58,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906513, now seen corresponding path program 1 times [2018-12-03 02:58:58,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:58,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:58,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:58,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:58,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 02:58:58,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:58,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:58:58,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:58:58,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:58:58,791 INFO L87 Difference]: Start difference. First operand 594 states and 750 transitions. Second operand 14 states. [2018-12-03 02:58:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:58,902 INFO L93 Difference]: Finished difference Result 658 states and 818 transitions. [2018-12-03 02:58:58,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:58:58,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-03 02:58:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:58,904 INFO L225 Difference]: With dead ends: 658 [2018-12-03 02:58:58,904 INFO L226 Difference]: Without dead ends: 588 [2018-12-03 02:58:58,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:58:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-12-03 02:58:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2018-12-03 02:58:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-12-03 02:58:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 741 transitions. [2018-12-03 02:58:58,929 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 741 transitions. Word has length 71 [2018-12-03 02:58:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:58,929 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 741 transitions. [2018-12-03 02:58:58,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:58:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 741 transitions. [2018-12-03 02:58:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 02:58:58,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:58,931 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] [2018-12-03 02:58:58,931 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:58,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:58,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2018-12-03 02:58:58,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:58,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:58,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:58,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:58,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:58,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:58,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:58,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:58,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:58,990 INFO L87 Difference]: Start difference. First operand 588 states and 741 transitions. Second operand 11 states. [2018-12-03 02:58:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:59,083 INFO L93 Difference]: Finished difference Result 615 states and 771 transitions. [2018-12-03 02:58:59,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:59,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-12-03 02:58:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:59,085 INFO L225 Difference]: With dead ends: 615 [2018-12-03 02:58:59,085 INFO L226 Difference]: Without dead ends: 570 [2018-12-03 02:58:59,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-12-03 02:58:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2018-12-03 02:58:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 02:58:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 713 transitions. [2018-12-03 02:58:59,109 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 713 transitions. Word has length 72 [2018-12-03 02:58:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:59,109 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 713 transitions. [2018-12-03 02:58:59,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 713 transitions. [2018-12-03 02:58:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 02:58:59,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:59,110 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-12-03 02:58:59,110 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:59,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2018-12-03 02:58:59,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:59,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:59,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:59,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:59,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:58:59,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:59,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:58:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:58:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:58:59,157 INFO L87 Difference]: Start difference. First operand 570 states and 713 transitions. Second operand 6 states. [2018-12-03 02:58:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:59,207 INFO L93 Difference]: Finished difference Result 611 states and 757 transitions. [2018-12-03 02:58:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:58:59,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-12-03 02:58:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:59,209 INFO L225 Difference]: With dead ends: 611 [2018-12-03 02:58:59,209 INFO L226 Difference]: Without dead ends: 575 [2018-12-03 02:58:59,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-12-03 02:58:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 570. [2018-12-03 02:58:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 02:58:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 711 transitions. [2018-12-03 02:58:59,233 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 711 transitions. Word has length 71 [2018-12-03 02:58:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:59,233 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 711 transitions. [2018-12-03 02:58:59,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:58:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 711 transitions. [2018-12-03 02:58:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 02:58:59,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:59,234 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-12-03 02:58:59,234 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:59,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash 792976728, now seen corresponding path program 1 times [2018-12-03 02:58:59,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:59,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:59,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:59,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:59,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:58:59,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:59,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:58:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:58:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:58:59,284 INFO L87 Difference]: Start difference. First operand 570 states and 711 transitions. Second operand 11 states. [2018-12-03 02:58:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:59,362 INFO L93 Difference]: Finished difference Result 595 states and 738 transitions. [2018-12-03 02:58:59,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:58:59,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-12-03 02:58:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:59,363 INFO L225 Difference]: With dead ends: 595 [2018-12-03 02:58:59,363 INFO L226 Difference]: Without dead ends: 558 [2018-12-03 02:58:59,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:58:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-12-03 02:58:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2018-12-03 02:58:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-12-03 02:58:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 696 transitions. [2018-12-03 02:58:59,386 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 696 transitions. Word has length 71 [2018-12-03 02:58:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:59,386 INFO L480 AbstractCegarLoop]: Abstraction has 558 states and 696 transitions. [2018-12-03 02:58:59,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:58:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 696 transitions. [2018-12-03 02:58:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 02:58:59,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:59,387 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] [2018-12-03 02:58:59,387 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:59,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1953714458, now seen corresponding path program 1 times [2018-12-03 02:58:59,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:59,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:59,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:59,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:59,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:58:59,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:59,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:58:59,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:58:59,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:58:59,431 INFO L87 Difference]: Start difference. First operand 558 states and 696 transitions. Second operand 7 states. [2018-12-03 02:58:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:59,495 INFO L93 Difference]: Finished difference Result 612 states and 757 transitions. [2018-12-03 02:58:59,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:58:59,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-03 02:58:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:59,496 INFO L225 Difference]: With dead ends: 612 [2018-12-03 02:58:59,496 INFO L226 Difference]: Without dead ends: 556 [2018-12-03 02:58:59,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:58:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-12-03 02:58:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 552. [2018-12-03 02:58:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-03 02:58:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 686 transitions. [2018-12-03 02:58:59,519 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 686 transitions. Word has length 77 [2018-12-03 02:58:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:59,519 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 686 transitions. [2018-12-03 02:58:59,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:58:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 686 transitions. [2018-12-03 02:58:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 02:58:59,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:59,520 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] [2018-12-03 02:58:59,520 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:59,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1353976224, now seen corresponding path program 1 times [2018-12-03 02:58:59,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:59,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:59,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 02:58:59,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:59,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:58:59,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:58:59,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:58:59,591 INFO L87 Difference]: Start difference. First operand 552 states and 686 transitions. Second operand 14 states. [2018-12-03 02:58:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:58:59,711 INFO L93 Difference]: Finished difference Result 611 states and 748 transitions. [2018-12-03 02:58:59,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:58:59,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-12-03 02:58:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:58:59,712 INFO L225 Difference]: With dead ends: 611 [2018-12-03 02:58:59,713 INFO L226 Difference]: Without dead ends: 540 [2018-12-03 02:58:59,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:58:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-12-03 02:58:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-12-03 02:58:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-12-03 02:58:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 667 transitions. [2018-12-03 02:58:59,735 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 667 transitions. Word has length 72 [2018-12-03 02:58:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:58:59,736 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 667 transitions. [2018-12-03 02:58:59,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:58:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 667 transitions. [2018-12-03 02:58:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 02:58:59,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:58:59,736 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] [2018-12-03 02:58:59,736 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:58:59,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:58:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2018-12-03 02:58:59,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:58:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:58:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:58:59,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:58:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:58:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:58:59,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:58:59,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:58:59,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:58:59,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:58:59,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:58:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:58:59,789 INFO L87 Difference]: Start difference. First operand 540 states and 667 transitions. Second operand 10 states. [2018-12-03 02:59:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:00,521 INFO L93 Difference]: Finished difference Result 1064 states and 1317 transitions. [2018-12-03 02:59:00,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 02:59:00,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-03 02:59:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:00,523 INFO L225 Difference]: With dead ends: 1064 [2018-12-03 02:59:00,523 INFO L226 Difference]: Without dead ends: 919 [2018-12-03 02:59:00,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-03 02:59:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-03 02:59:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 848. [2018-12-03 02:59:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-12-03 02:59:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1071 transitions. [2018-12-03 02:59:00,562 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1071 transitions. Word has length 73 [2018-12-03 02:59:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:00,562 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1071 transitions. [2018-12-03 02:59:00,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:59:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1071 transitions. [2018-12-03 02:59:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 02:59:00,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:00,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:00,563 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:00,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1980389399, now seen corresponding path program 1 times [2018-12-03 02:59:00,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:00,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:00,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:00,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:59:00,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:00,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:59:00,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:59:00,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:59:00,600 INFO L87 Difference]: Start difference. First operand 848 states and 1071 transitions. Second operand 6 states. [2018-12-03 02:59:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:00,941 INFO L93 Difference]: Finished difference Result 1067 states and 1315 transitions. [2018-12-03 02:59:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:59:00,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-03 02:59:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:00,942 INFO L225 Difference]: With dead ends: 1067 [2018-12-03 02:59:00,942 INFO L226 Difference]: Without dead ends: 962 [2018-12-03 02:59:00,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:59:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-12-03 02:59:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 918. [2018-12-03 02:59:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-12-03 02:59:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1151 transitions. [2018-12-03 02:59:00,986 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1151 transitions. Word has length 73 [2018-12-03 02:59:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:00,986 INFO L480 AbstractCegarLoop]: Abstraction has 918 states and 1151 transitions. [2018-12-03 02:59:00,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:59:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1151 transitions. [2018-12-03 02:59:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 02:59:00,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:00,987 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] [2018-12-03 02:59:00,987 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:00,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1694643791, now seen corresponding path program 1 times [2018-12-03 02:59:00,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:00,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:00,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:00,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:00,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:01,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:01,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:59:01,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:01,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:59:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:59:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:59:01,039 INFO L87 Difference]: Start difference. First operand 918 states and 1151 transitions. Second operand 6 states. [2018-12-03 02:59:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:01,106 INFO L93 Difference]: Finished difference Result 1192 states and 1507 transitions. [2018-12-03 02:59:01,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:59:01,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-03 02:59:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:01,108 INFO L225 Difference]: With dead ends: 1192 [2018-12-03 02:59:01,108 INFO L226 Difference]: Without dead ends: 904 [2018-12-03 02:59:01,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:59:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-03 02:59:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-03 02:59:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-03 02:59:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1129 transitions. [2018-12-03 02:59:01,160 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1129 transitions. Word has length 77 [2018-12-03 02:59:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:01,160 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1129 transitions. [2018-12-03 02:59:01,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:59:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1129 transitions. [2018-12-03 02:59:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 02:59:01,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:01,161 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 02:59:01,161 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:01,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash -532137541, now seen corresponding path program 1 times [2018-12-03 02:59:01,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:01,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:01,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 02:59:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:59:01,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:01,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:59:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:59:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:59:01,197 INFO L87 Difference]: Start difference. First operand 904 states and 1129 transitions. Second operand 5 states. [2018-12-03 02:59:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:01,255 INFO L93 Difference]: Finished difference Result 949 states and 1177 transitions. [2018-12-03 02:59:01,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:59:01,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-03 02:59:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:01,257 INFO L225 Difference]: With dead ends: 949 [2018-12-03 02:59:01,257 INFO L226 Difference]: Without dead ends: 904 [2018-12-03 02:59:01,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:59:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-03 02:59:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-03 02:59:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-03 02:59:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1127 transitions. [2018-12-03 02:59:01,300 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1127 transitions. Word has length 75 [2018-12-03 02:59:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:01,300 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1127 transitions. [2018-12-03 02:59:01,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:59:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1127 transitions. [2018-12-03 02:59:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 02:59:01,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:01,301 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 02:59:01,301 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:01,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:01,301 INFO L82 PathProgramCache]: Analyzing trace with hash -509505287, now seen corresponding path program 1 times [2018-12-03 02:59:01,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:01,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:01,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 02:59:01,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:01,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:59:01,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:01,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:59:01,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:59:01,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:59:01,344 INFO L87 Difference]: Start difference. First operand 904 states and 1127 transitions. Second operand 6 states. [2018-12-03 02:59:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:01,402 INFO L93 Difference]: Finished difference Result 945 states and 1169 transitions. [2018-12-03 02:59:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:59:01,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-03 02:59:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:01,403 INFO L225 Difference]: With dead ends: 945 [2018-12-03 02:59:01,403 INFO L226 Difference]: Without dead ends: 904 [2018-12-03 02:59:01,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:59:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-03 02:59:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-03 02:59:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-03 02:59:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1125 transitions. [2018-12-03 02:59:01,445 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1125 transitions. Word has length 75 [2018-12-03 02:59:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:01,446 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1125 transitions. [2018-12-03 02:59:01,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:59:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1125 transitions. [2018-12-03 02:59:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 02:59:01,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:01,446 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 02:59:01,447 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:01,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1018978377, now seen corresponding path program 1 times [2018-12-03 02:59:01,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 02:59:01,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:01,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:59:01,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:01,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:59:01,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:59:01,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:59:01,495 INFO L87 Difference]: Start difference. First operand 904 states and 1125 transitions. Second operand 11 states. [2018-12-03 02:59:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:01,582 INFO L93 Difference]: Finished difference Result 926 states and 1148 transitions. [2018-12-03 02:59:01,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:59:01,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-12-03 02:59:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:01,584 INFO L225 Difference]: With dead ends: 926 [2018-12-03 02:59:01,584 INFO L226 Difference]: Without dead ends: 857 [2018-12-03 02:59:01,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:59:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-12-03 02:59:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 851. [2018-12-03 02:59:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-03 02:59:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1062 transitions. [2018-12-03 02:59:01,624 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1062 transitions. Word has length 75 [2018-12-03 02:59:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:01,624 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1062 transitions. [2018-12-03 02:59:01,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:59:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1062 transitions. [2018-12-03 02:59:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 02:59:01,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:01,625 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] [2018-12-03 02:59:01,625 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:01,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1252114584, now seen corresponding path program 1 times [2018-12-03 02:59:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:01,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:01,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 02:59:01,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:01,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:59:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:59:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:59:01,726 INFO L87 Difference]: Start difference. First operand 851 states and 1062 transitions. Second operand 14 states. [2018-12-03 02:59:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:01,842 INFO L93 Difference]: Finished difference Result 879 states and 1091 transitions. [2018-12-03 02:59:01,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:59:01,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-12-03 02:59:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:01,843 INFO L225 Difference]: With dead ends: 879 [2018-12-03 02:59:01,843 INFO L226 Difference]: Without dead ends: 847 [2018-12-03 02:59:01,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:59:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-12-03 02:59:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2018-12-03 02:59:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-03 02:59:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1054 transitions. [2018-12-03 02:59:01,882 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1054 transitions. Word has length 77 [2018-12-03 02:59:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:01,882 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1054 transitions. [2018-12-03 02:59:01,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:59:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1054 transitions. [2018-12-03 02:59:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 02:59:01,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:01,883 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-12-03 02:59:01,883 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:01,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:01,883 INFO L82 PathProgramCache]: Analyzing trace with hash -235814922, now seen corresponding path program 1 times [2018-12-03 02:59:01,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:01,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:01,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:01,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:59:01,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:01,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:59:01,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:59:01,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:59:01,904 INFO L87 Difference]: Start difference. First operand 847 states and 1054 transitions. Second operand 5 states. [2018-12-03 02:59:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:02,034 INFO L93 Difference]: Finished difference Result 1089 states and 1372 transitions. [2018-12-03 02:59:02,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:59:02,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-03 02:59:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:02,036 INFO L225 Difference]: With dead ends: 1089 [2018-12-03 02:59:02,036 INFO L226 Difference]: Without dead ends: 815 [2018-12-03 02:59:02,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:59:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-12-03 02:59:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2018-12-03 02:59:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-12-03 02:59:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1014 transitions. [2018-12-03 02:59:02,075 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1014 transitions. Word has length 81 [2018-12-03 02:59:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:02,075 INFO L480 AbstractCegarLoop]: Abstraction has 815 states and 1014 transitions. [2018-12-03 02:59:02,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:59:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1014 transitions. [2018-12-03 02:59:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 02:59:02,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:02,076 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:02,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:02,077 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2018-12-03 02:59:02,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:02,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:02,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:02,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:02,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:59:02,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:02,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:59:02,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:59:02,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:59:02,124 INFO L87 Difference]: Start difference. First operand 815 states and 1014 transitions. Second operand 10 states. [2018-12-03 02:59:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:02,910 INFO L93 Difference]: Finished difference Result 865 states and 1063 transitions. [2018-12-03 02:59:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:59:02,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-03 02:59:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:02,911 INFO L225 Difference]: With dead ends: 865 [2018-12-03 02:59:02,911 INFO L226 Difference]: Without dead ends: 731 [2018-12-03 02:59:02,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:59:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-03 02:59:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 367. [2018-12-03 02:59:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-03 02:59:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 457 transitions. [2018-12-03 02:59:02,935 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 457 transitions. Word has length 78 [2018-12-03 02:59:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:02,935 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 457 transitions. [2018-12-03 02:59:02,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:59:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 457 transitions. [2018-12-03 02:59:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 02:59:02,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:02,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:02,936 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:02,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922871, now seen corresponding path program 1 times [2018-12-03 02:59:02,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:02,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:02,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:02,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:02,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:02,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:02,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:59:02,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:02,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:59:02,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:59:02,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:59:02,953 INFO L87 Difference]: Start difference. First operand 367 states and 457 transitions. Second operand 3 states. [2018-12-03 02:59:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:02,979 INFO L93 Difference]: Finished difference Result 410 states and 502 transitions. [2018-12-03 02:59:02,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:59:02,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-03 02:59:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:02,979 INFO L225 Difference]: With dead ends: 410 [2018-12-03 02:59:02,980 INFO L226 Difference]: Without dead ends: 372 [2018-12-03 02:59:02,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:59:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-03 02:59:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2018-12-03 02:59:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-03 02:59:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 458 transitions. [2018-12-03 02:59:03,002 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 458 transitions. Word has length 80 [2018-12-03 02:59:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:03,002 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 458 transitions. [2018-12-03 02:59:03,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:59:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 458 transitions. [2018-12-03 02:59:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 02:59:03,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:03,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:03,003 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:03,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:03,003 INFO L82 PathProgramCache]: Analyzing trace with hash 327061127, now seen corresponding path program 1 times [2018-12-03 02:59:03,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:03,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:03,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:03,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 02:59:03,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:03,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:59:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:59:03,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:59:03,085 INFO L87 Difference]: Start difference. First operand 368 states and 458 transitions. Second operand 14 states. [2018-12-03 02:59:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:03,172 INFO L93 Difference]: Finished difference Result 383 states and 474 transitions. [2018-12-03 02:59:03,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:59:03,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-12-03 02:59:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:03,173 INFO L225 Difference]: With dead ends: 383 [2018-12-03 02:59:03,173 INFO L226 Difference]: Without dead ends: 310 [2018-12-03 02:59:03,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:59:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-03 02:59:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-12-03 02:59:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-03 02:59:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2018-12-03 02:59:03,193 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 80 [2018-12-03 02:59:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:03,193 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2018-12-03 02:59:03,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:59:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2018-12-03 02:59:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 02:59:03,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:03,193 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-12-03 02:59:03,193 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:03,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash 121497713, now seen corresponding path program 1 times [2018-12-03 02:59:03,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:03,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:03,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:03,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:03,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:59:03,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:03,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:59:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:59:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:59:03,222 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2018-12-03 02:59:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:03,350 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2018-12-03 02:59:03,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:59:03,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-03 02:59:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:03,351 INFO L225 Difference]: With dead ends: 445 [2018-12-03 02:59:03,351 INFO L226 Difference]: Without dead ends: 303 [2018-12-03 02:59:03,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:59:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-03 02:59:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2018-12-03 02:59:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-03 02:59:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2018-12-03 02:59:03,367 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2018-12-03 02:59:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:03,367 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2018-12-03 02:59:03,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:59:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2018-12-03 02:59:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 02:59:03,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:03,367 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-12-03 02:59:03,367 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:03,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1235629862, now seen corresponding path program 1 times [2018-12-03 02:59:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:03,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:03,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:03,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:03,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 02:59:03,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:03,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:59:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:59:03,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:59:03,448 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 13 states. [2018-12-03 02:59:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:04,002 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-12-03 02:59:04,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:59:04,002 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-12-03 02:59:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:04,003 INFO L225 Difference]: With dead ends: 289 [2018-12-03 02:59:04,003 INFO L226 Difference]: Without dead ends: 266 [2018-12-03 02:59:04,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-03 02:59:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-03 02:59:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2018-12-03 02:59:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-03 02:59:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2018-12-03 02:59:04,034 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2018-12-03 02:59:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:04,034 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2018-12-03 02:59:04,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:59:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2018-12-03 02:59:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 02:59:04,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:04,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:04,035 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:04,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash -642637310, now seen corresponding path program 1 times [2018-12-03 02:59:04,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:04,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:04,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:04,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:59:04,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:04,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:59:04,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:59:04,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:59:04,097 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 10 states. [2018-12-03 02:59:04,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:04,673 INFO L93 Difference]: Finished difference Result 551 states and 641 transitions. [2018-12-03 02:59:04,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 02:59:04,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-12-03 02:59:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:04,674 INFO L225 Difference]: With dead ends: 551 [2018-12-03 02:59:04,674 INFO L226 Difference]: Without dead ends: 492 [2018-12-03 02:59:04,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-12-03 02:59:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-12-03 02:59:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 448. [2018-12-03 02:59:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-03 02:59:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 522 transitions. [2018-12-03 02:59:04,700 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 522 transitions. Word has length 101 [2018-12-03 02:59:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:04,700 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 522 transitions. [2018-12-03 02:59:04,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:59:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 522 transitions. [2018-12-03 02:59:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 02:59:04,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:04,701 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:04,701 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:04,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2001585538, now seen corresponding path program 1 times [2018-12-03 02:59:04,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:04,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:04,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:04,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:04,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 02:59:04,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:59:04,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:59:04,722 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-12-03 02:59:04,723 INFO L205 CegarAbsIntRunner]: [21], [22], [95], [99], [104], [110], [115], [118], [132], [145], [160], [172], [176], [179], [182], [185], [191], [201], [204], [207], [234], [239], [349], [352], [355], [360], [364], [374], [377], [382], [385], [410], [413], [418], [462], [463], [464], [465], [466], [471], [474], [488], [490], [500], [504], [509], [532], [535], [540], [542], [548], [549], [551], [552], [553], [793], [796], [803], [806], [808], [812], [815], [825], [852], [855], [858], [871], [872], [885], [886], [1314], [1320], [1326], [1328], [1330], [1333], [1335], [1339], [1340], [1363], [1364], [1365], [1366], [1369], [1370], [1377], [1419], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1429], [1430], [1467], [1468], [1469], [1470], [1495], [1496], [1497], [1553], [1554], [1555], [1556] [2018-12-03 02:59:04,746 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:59:04,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:59:04,865 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 02:59:04,866 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Performed 552 root evaluator evaluations with a maximum evaluation depth of 3. Performed 552 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 71 variables. [2018-12-03 02:59:04,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:04,878 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 02:59:04,962 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 74.99% of their original sizes. [2018-12-03 02:59:04,963 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 02:59:05,007 INFO L418 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-12-03 02:59:05,007 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 02:59:05,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:59:05,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-03 02:59:05,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:05,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:59:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:59:05,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:59:05,011 INFO L87 Difference]: Start difference. First operand 448 states and 522 transitions. Second operand 10 states. [2018-12-03 02:59:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:06,322 INFO L93 Difference]: Finished difference Result 625 states and 728 transitions. [2018-12-03 02:59:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:59:06,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-12-03 02:59:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:06,323 INFO L225 Difference]: With dead ends: 625 [2018-12-03 02:59:06,323 INFO L226 Difference]: Without dead ends: 458 [2018-12-03 02:59:06,323 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:59:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-12-03 02:59:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 437. [2018-12-03 02:59:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-12-03 02:59:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 505 transitions. [2018-12-03 02:59:06,353 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 505 transitions. Word has length 114 [2018-12-03 02:59:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:06,353 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 505 transitions. [2018-12-03 02:59:06,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:59:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 505 transitions. [2018-12-03 02:59:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 02:59:06,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:06,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:06,354 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:06,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:06,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1234425920, now seen corresponding path program 1 times [2018-12-03 02:59:06,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:06,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:06,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:06,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:06,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:59:06,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:06,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:59:06,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:06,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:59:06,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:59:06,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:59:06,403 INFO L87 Difference]: Start difference. First operand 437 states and 505 transitions. Second operand 8 states. [2018-12-03 02:59:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:06,480 INFO L93 Difference]: Finished difference Result 455 states and 524 transitions. [2018-12-03 02:59:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:59:06,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-12-03 02:59:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:06,481 INFO L225 Difference]: With dead ends: 455 [2018-12-03 02:59:06,481 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 02:59:06,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:59:06,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 02:59:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-12-03 02:59:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 02:59:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 381 transitions. [2018-12-03 02:59:06,504 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 381 transitions. Word has length 101 [2018-12-03 02:59:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:06,504 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 381 transitions. [2018-12-03 02:59:06,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:59:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 381 transitions. [2018-12-03 02:59:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 02:59:06,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:06,505 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:06,505 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:06,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash 31808508, now seen corresponding path program 1 times [2018-12-03 02:59:06,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:06,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:06,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 02:59:06,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:59:06,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:59:06,535 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-12-03 02:59:06,535 INFO L205 CegarAbsIntRunner]: [21], [22], [95], [99], [102], [110], [115], [118], [132], [145], [160], [172], [176], [179], [182], [185], [191], [201], [204], [207], [234], [239], [349], [352], [355], [360], [364], [374], [377], [382], [385], [410], [413], [418], [462], [463], [464], [465], [466], [471], [474], [488], [490], [500], [504], [509], [532], [535], [540], [542], [548], [549], [551], [552], [553], [793], [796], [803], [806], [808], [812], [815], [825], [852], [855], [858], [871], [872], [885], [886], [1314], [1320], [1326], [1328], [1330], [1333], [1335], [1339], [1340], [1363], [1364], [1365], [1366], [1369], [1370], [1377], [1419], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1429], [1430], [1467], [1468], [1469], [1470], [1495], [1496], [1497], [1553], [1554], [1555], [1556] [2018-12-03 02:59:06,537 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:59:06,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:59:06,564 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 02:59:06,564 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Performed 556 root evaluator evaluations with a maximum evaluation depth of 3. Performed 556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 71 variables. [2018-12-03 02:59:06,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:06,565 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 02:59:06,617 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 75.08% of their original sizes. [2018-12-03 02:59:06,618 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 02:59:06,649 INFO L418 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-12-03 02:59:06,649 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 02:59:06,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:59:06,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-03 02:59:06,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:06,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:59:06,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:59:06,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:59:06,649 INFO L87 Difference]: Start difference. First operand 335 states and 381 transitions. Second operand 10 states. [2018-12-03 02:59:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:07,314 INFO L93 Difference]: Finished difference Result 425 states and 483 transitions. [2018-12-03 02:59:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:59:07,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-12-03 02:59:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:07,315 INFO L225 Difference]: With dead ends: 425 [2018-12-03 02:59:07,315 INFO L226 Difference]: Without dead ends: 296 [2018-12-03 02:59:07,315 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:59:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-03 02:59:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 147. [2018-12-03 02:59:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 02:59:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-12-03 02:59:07,329 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 114 [2018-12-03 02:59:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:07,329 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-12-03 02:59:07,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:59:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-12-03 02:59:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 02:59:07,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:07,330 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 02:59:07,330 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:07,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash -906281704, now seen corresponding path program 1 times [2018-12-03 02:59:07,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:07,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:07,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:59:07,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:07,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:59:07,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:07,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:59:07,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:59:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:59:07,387 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 11 states. [2018-12-03 02:59:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:07,666 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-12-03 02:59:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:59:07,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-12-03 02:59:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:07,667 INFO L225 Difference]: With dead ends: 169 [2018-12-03 02:59:07,667 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 02:59:07,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-03 02:59:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 02:59:07,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 02:59:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 02:59:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-12-03 02:59:07,680 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-12-03 02:59:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:07,680 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-12-03 02:59:07,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:59:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-12-03 02:59:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 02:59:07,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:07,681 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:07,681 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:07,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1647320713, now seen corresponding path program 1 times [2018-12-03 02:59:07,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:07,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:07,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:59:07,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:07,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 02:59:07,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:07,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:59:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:59:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:59:07,730 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-12-03 02:59:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:08,009 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-12-03 02:59:08,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 02:59:08,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-12-03 02:59:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:08,010 INFO L225 Difference]: With dead ends: 280 [2018-12-03 02:59:08,010 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 02:59:08,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-03 02:59:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 02:59:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 02:59:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 02:59:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-12-03 02:59:08,025 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-12-03 02:59:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:08,025 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-12-03 02:59:08,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:59:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-12-03 02:59:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 02:59:08,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:08,026 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:08,026 INFO L423 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:08,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:08,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1528879239, now seen corresponding path program 1 times [2018-12-03 02:59:08,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:08,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:08,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:08,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:08,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:59:08,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:08,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:59:08,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:08,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:59:08,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:59:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:59:08,050 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-12-03 02:59:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:08,072 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-12-03 02:59:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:59:08,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-03 02:59:08,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:08,073 INFO L225 Difference]: With dead ends: 192 [2018-12-03 02:59:08,073 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 02:59:08,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:59:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 02:59:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-12-03 02:59:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 02:59:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-12-03 02:59:08,087 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-12-03 02:59:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:08,087 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-12-03 02:59:08,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:59:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-12-03 02:59:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 02:59:08,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:59:08,088 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:59:08,088 INFO L423 AbstractCegarLoop]: === Iteration 97 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:59:08,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:59:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash -142675845, now seen corresponding path program 1 times [2018-12-03 02:59:08,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:59:08,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:08,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:59:08,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:59:08,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:59:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:59:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:59:08,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:59:08,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:59:08,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:59:08,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:59:08,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:59:08,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:59:08,160 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 11 states. [2018-12-03 02:59:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:59:08,432 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-12-03 02:59:08,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:59:08,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-12-03 02:59:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:59:08,432 INFO L225 Difference]: With dead ends: 152 [2018-12-03 02:59:08,432 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 02:59:08,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-03 02:59:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 02:59:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 02:59:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 02:59:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 02:59:08,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-12-03 02:59:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:59:08,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 02:59:08,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:59:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 02:59:08,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 02:59:08,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 02:59:08,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:08,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:09,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:59:10,540 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 1 [2018-12-03 02:59:10,858 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 65 [2018-12-03 02:59:11,407 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 95 [2018-12-03 02:59:11,807 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 95 [2018-12-03 02:59:12,129 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-12-03 02:59:12,643 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 94 [2018-12-03 02:59:12,774 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-03 02:59:12,921 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-12-03 02:59:14,069 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 184 DAG size of output: 127 [2018-12-03 02:59:14,881 WARN L180 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 120 [2018-12-03 02:59:15,963 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 193 DAG size of output: 59 [2018-12-03 02:59:16,214 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-12-03 02:59:16,694 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 83 [2018-12-03 02:59:17,169 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-12-03 02:59:18,728 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 150 DAG size of output: 94 [2018-12-03 02:59:18,971 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 97 [2018-12-03 02:59:20,270 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 239 DAG size of output: 136 [2018-12-03 02:59:20,528 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-12-03 02:59:20,924 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-12-03 02:59:21,133 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-03 02:59:21,343 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2018-12-03 02:59:21,994 WARN L180 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 93 [2018-12-03 02:59:22,152 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2018-12-03 02:59:22,769 WARN L180 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2018-12-03 02:59:25,161 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 184 DAG size of output: 127 [2018-12-03 02:59:26,172 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 249 DAG size of output: 141 [2018-12-03 02:59:26,577 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 90 [2018-12-03 02:59:26,728 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-12-03 02:59:28,937 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 169 DAG size of output: 125 [2018-12-03 02:59:29,621 WARN L180 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 61 [2018-12-03 02:59:29,936 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 96 [2018-12-03 02:59:30,251 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 97 [2018-12-03 02:59:30,695 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 68 [2018-12-03 02:59:31,073 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-12-03 02:59:31,468 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-03 02:59:31,671 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 1 [2018-12-03 02:59:31,980 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-03 02:59:32,520 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 93 [2018-12-03 02:59:34,341 WARN L180 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 184 DAG size of output: 127 [2018-12-03 02:59:35,884 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 155 DAG size of output: 98 [2018-12-03 02:59:36,389 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-03 02:59:36,820 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-12-03 02:59:36,990 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-12-03 02:59:37,436 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-03 02:59:38,878 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 158 DAG size of output: 97 [2018-12-03 02:59:39,041 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 94 [2018-12-03 02:59:39,686 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-12-03 02:59:39,905 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2018-12-03 02:59:40,012 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-12-03 02:59:40,141 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2018-12-03 02:59:40,431 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-12-03 02:59:40,575 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-12-03 02:59:40,811 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-12-03 02:59:41,019 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2018-12-03 02:59:41,267 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2018-12-03 02:59:41,483 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2018-12-03 02:59:41,671 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2018-12-03 02:59:42,092 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-12-03 02:59:42,869 WARN L180 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2018-12-03 02:59:43,649 WARN L180 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 97 [2018-12-03 02:59:45,536 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 177 DAG size of output: 108 [2018-12-03 02:59:46,593 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 180 DAG size of output: 1 [2018-12-03 02:59:47,520 WARN L180 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 103 [2018-12-03 02:59:47,813 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 1 [2018-12-03 02:59:48,044 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-12-03 02:59:49,041 WARN L180 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 94 [2018-12-03 02:59:49,247 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2018-12-03 02:59:50,170 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 127 [2018-12-03 02:59:50,296 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-12-03 02:59:51,184 WARN L180 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 141 [2018-12-03 02:59:51,488 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-03 02:59:51,835 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 97 [2018-12-03 02:59:51,961 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-12-03 02:59:52,201 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 56 [2018-12-03 02:59:52,636 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 99 [2018-12-03 02:59:52,787 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 93 [2018-12-03 02:59:53,446 WARN L180 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 72 [2018-12-03 02:59:53,750 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2018-12-03 02:59:54,118 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2018-12-03 02:59:54,285 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2018-12-03 02:59:55,096 WARN L180 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 95 [2018-12-03 02:59:55,426 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-03 02:59:55,749 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 86 [2018-12-03 02:59:56,140 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 111 [2018-12-03 02:59:56,411 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 89 [2018-12-03 02:59:58,204 WARN L180 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 223 DAG size of output: 137 [2018-12-03 02:59:58,912 WARN L180 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 101 [2018-12-03 02:59:59,989 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 220 DAG size of output: 86 [2018-12-03 03:00:00,556 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 89 [2018-12-03 03:00:00,916 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2018-12-03 03:00:01,205 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 80 [2018-12-03 03:00:01,407 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-12-03 03:00:01,543 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2018-12-03 03:00:01,686 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-03 03:00:02,237 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2018-12-03 03:00:03,034 WARN L180 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 93 [2018-12-03 03:00:03,627 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-12-03 03:00:03,819 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-12-03 03:00:04,180 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2018-12-03 03:00:04,339 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-03 03:00:04,445 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2018-12-03 03:00:04,702 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 62 [2018-12-03 03:00:04,890 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-12-03 03:00:05,626 WARN L180 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 97 [2018-12-03 03:00:05,881 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 1 [2018-12-03 03:00:07,323 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 195 DAG size of output: 87 [2018-12-03 03:00:07,466 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-12-03 03:00:07,906 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2018-12-03 03:00:08,919 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 164 DAG size of output: 109 [2018-12-03 03:00:09,197 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-12-03 03:00:09,197 INFO L444 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5 .cse6) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))))) [2018-12-03 03:00:09,197 INFO L448 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-12-03 03:00:09,197 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-12-03 03:00:09,197 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-12-03 03:00:09,198 INFO L444 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (and (= ~customIrp~0 0) (= ~s~0 1)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5 .cse6) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (or (= |old(~s~0)| ~s~0) (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5)))))) [2018-12-03 03:00:09,198 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-12-03 03:00:09,198 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-12-03 03:00:09,198 INFO L448 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-12-03 03:00:09,198 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-12-03 03:00:09,198 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 62 83) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= ~myStatus~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= ~Executive~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= ~KernelMode~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-03 03:00:09,198 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-12-03 03:00:09,198 INFO L448 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-12-03 03:00:09,198 INFO L444 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or .cse0 (= |old(~s~0)| ~s~0)) (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)))))) [2018-12-03 03:00:09,198 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-12-03 03:00:09,198 INFO L444 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse3 (+ (div AG_SetStatusAndReturn_~__cil_tmp4~0 4294967296) 1))) (let ((.cse0 (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) (<= .cse3 0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (let ((.cse1 (or (< 0 .cse3) (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)))) (or (and .cse0 .cse1) .cse2 (and (<= 2147483670 |AG_SetStatusAndReturn_#in~status|) .cse1 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|)))) (or .cse2 (< ~IPC~0 (+ ~SKIP2~0 3)) .cse0) (or .cse2 (and (= |old(~s~0)| ~s~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)))))) [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L444 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11 .cse12) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))))) (and (or .cse0 .cse1) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (and (= ~customIrp~0 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (not (= 1 ~NP~0)) .cse0 (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))))))) [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L444 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (let ((.cse12 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 0 .cse12))) (let ((.cse3 (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (not (= 0 |old(~routine~0)|))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse14 (not (= 0 |old(~pended~0)|))) (.cse15 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse12 0) .cse13 .cse14 .cse15) (or .cse5 .cse6 (not (= ~myStatus~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15)))) (.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~routine~0 0))) (and (or (and (and .cse0 .cse1 .cse2) (= ~s~0 |old(~s~0)|)) .cse3 .cse4) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) .cse3 (and (= ~customIrp~0 0) .cse0 .cse1 .cse2 (= |old(~s~0)| ~s~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (< ~myStatus~0 0) (not (= |old(~customIrp~0)| 0))))))) [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-12-03 03:00:09,199 INFO L444 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11 .cse12) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))))) (and (or .cse0 .cse1) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) .cse0 (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (and (= ~customIrp~0 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (not (= |old(~customIrp~0)| 0))))))) [2018-12-03 03:00:09,200 INFO L444 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (let ((.cse12 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 0 .cse12))) (let ((.cse3 (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (not (= 0 |old(~routine~0)|))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse14 (not (= 0 |old(~pended~0)|))) (.cse15 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse12 0) .cse13 .cse14 .cse15) (or .cse5 .cse6 (not (= ~myStatus~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15)))) (.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~routine~0 0))) (and (or (and (and .cse0 .cse1 .cse2) (= ~s~0 |old(~s~0)|)) .cse3 .cse4) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) .cse3 (and (= ~customIrp~0 0) .cse0 .cse1 .cse2 (= |old(~s~0)| ~s~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (< ~myStatus~0 0) (not (= |old(~customIrp~0)| 0))))))) [2018-12-03 03:00:09,200 INFO L448 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-12-03 03:00:09,200 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-12-03 03:00:09,200 INFO L444 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11 .cse12) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))))) (and (or .cse0 .cse1) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (and (= ~customIrp~0 0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) .cse0 (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))))))) [2018-12-03 03:00:09,200 INFO L444 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11 .cse12) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))))) (and (or .cse0 .cse1) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (and (= ~customIrp~0 0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) .cse0 (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))))))) [2018-12-03 03:00:09,200 INFO L444 ceAbstractionStarter]: At program point L1786(lines 1785 1816) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~customIrp~0 0) (= ~UNLOADED~0 0) (= ~MPR1~0 5) (= ~IPC~0 7) (= ~Executive~0 0) (= ~DC~0 2) (= ~NP~0 1) (= ~DeviceUsageTypePaging~0 1) (= ~KernelMode~0 0) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 (<= .cse6 0) .cse10)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (= 0 ~myStatus~0) .cse10)))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-03 03:00:09,200 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-12-03 03:00:09,200 INFO L448 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-12-03 03:00:09,200 INFO L444 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and (= 0 ~pended~0) .cse13))) (let ((.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (= ~IPC~0 ~s~0)) (.cse8 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (and .cse0 .cse3 .cse7)) (.cse12 (= 0 main_~status~9)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse10) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse12 .cse4 .cse5 .cse7) (and .cse0 (= ~routine~0 0) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 ~compRegistered~0) .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (and .cse8 .cse9 .cse2 .cse6 .cse10) (not (= 259 main_~status~9))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse12 .cse11 .cse4 .cse7))))) [2018-12-03 03:00:09,200 INFO L444 ceAbstractionStarter]: At program point L1754(line 1754) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~Executive~0 0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~DeviceUsageTypePaging~0 1) (= ~KernelMode~0 0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-03 03:00:09,201 INFO L448 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-12-03 03:00:09,201 INFO L448 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-12-03 03:00:09,201 INFO L444 ceAbstractionStarter]: At program point L1846(line 1846) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-03 03:00:09,201 INFO L444 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and (= 0 ~pended~0) .cse13))) (let ((.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (= ~IPC~0 ~s~0)) (.cse8 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (and .cse0 .cse3 .cse7)) (.cse12 (= 0 main_~status~9)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse10) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse12 .cse4 .cse5 .cse7) (and .cse0 (= ~routine~0 0) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 ~compRegistered~0) .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (and .cse8 .cse9 .cse2 .cse6 .cse10) (not (= 259 main_~status~9))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse12 .cse11 .cse4 .cse7))))) [2018-12-03 03:00:09,201 INFO L448 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-12-03 03:00:09,201 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-12-03 03:00:09,201 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-12-03 03:00:09,201 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-12-03 03:00:09,201 INFO L448 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-12-03 03:00:09,201 INFO L444 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse4 (= ~lowerDriverReturn~0 main_~status~9)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse1 (<= ~s~0 ~DC~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (and (let ((.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse5 .cse6 (and .cse3 .cse4)) (and (and .cse5 .cse6 .cse3) (= ~DC~0 ~s~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (and .cse1 .cse2 .cse0 (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~9))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~9) .cse3 .cse4) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse0 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-12-03 03:00:09,201 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 1716 1878) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 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) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-03 03:00:09,201 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-12-03 03:00:09,201 INFO L444 ceAbstractionStarter]: At program point L1781(lines 1780 1817) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 (<= .cse6 0) .cse10)) (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (= 0 ~myStatus~0) .cse10) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)))) [2018-12-03 03:00:09,202 INFO L444 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (= 0 main_~status~9)) (.cse4 (= ~DC~0 ~s~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (and .cse10 .cse11 .cse2)) (.cse3 (= ~IPC~0 ~s~0)) (.cse8 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse4 (not (= 259 main_~status~9)) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse5 .cse6 (<= (+ main_~status~9 1073741789) 0) .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse10 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 .cse11 .cse1 .cse2 .cse3 .cse8) (and .cse10 .cse6 .cse9 .cse11 .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L444 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (and .cse13 (= 0 ~pended~0))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse2 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse9 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (= ~DC~0 ~s~0)) (.cse11 (and .cse4 .cse1 .cse7)) (.cse12 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (= 0 main_~status~9)) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse8 (= ~IPC~0 ~s~0))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse6 .cse7 .cse3 .cse8 .cse9) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse1 .cse6 .cse2 .cse7 .cse3) (and .cse10 (not (= 259 main_~status~9)) .cse11 .cse12 .cse6 .cse9) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse4 .cse13 (= ~routine~0 0) .cse5 .cse6 .cse7 .cse3 (<= 1 ~compRegistered~0) .cse8 .cse9) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse10 .cse11 .cse12 .cse6 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse3 .cse8) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)))))) [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse8 (<= .cse16 0))) (let ((.cse0 (= ~UNLOADED~0 0)) (.cse1 (= ~MPR1~0 5)) (.cse2 (= ~IPC~0 7)) (.cse3 (= ~Executive~0 0)) (.cse4 (= ~DC~0 2)) (.cse5 (= ~NP~0 1)) (.cse6 (= ~DeviceUsageTypePaging~0 1)) (.cse7 (= ~KernelMode~0 0)) (.cse9 (let ((.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (= 0 ~pended~0)) (.cse12 (= ~s~0 ~NP~0)) (.cse13 (= 0 ~compRegistered~0)) (.cse14 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse17 (= ~routine~0 0)) (.cse18 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse20 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 .cse16) .cse17 .cse18 .cse19 .cse8 .cse20) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |old(~myStatus~0)| ~myStatus~0) .cse17 .cse18 .cse19 (= 0 ~myStatus~0) .cse20))))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and (= ~customIrp~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)))))) [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L444 ceAbstractionStarter]: At program point L1791(lines 1790 1815) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L444 ceAbstractionStarter]: At program point L1866(line 1866) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-12-03 03:00:09,202 INFO L448 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L451 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L444 ceAbstractionStarter]: At program point L1860(line 1860) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-03 03:00:09,203 INFO L444 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0) .cse3)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0) .cse3)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (= ~s~0 |old(~s~0)|)) [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L444 ceAbstractionStarter]: At program point L2075(lines 2074 2097) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0))) [2018-12-03 03:00:09,203 INFO L444 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-12-03 03:00:09,203 INFO L444 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-03 03:00:09,203 INFO L448 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L444 ceAbstractionStarter]: At program point L2080(lines 2079 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-12-03 03:00:09,204 INFO L444 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L444 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-03 03:00:09,205 INFO L444 ceAbstractionStarter]: At program point L2082(lines 2081 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L444 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L444 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-12-03 03:00:09,205 INFO L448 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-12-03 03:00:09,206 INFO L444 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse32 (+ ~myStatus~0 1073741637))) (let ((.cse6 (< 0 .cse32)) (.cse7 (< .cse32 0)) (.cse9 (not (= ~myStatus~0 0))) (.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 ~pended~0))) (.cse25 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse26 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse11 (< ~compRegistered~0 1)) (.cse12 (not (= 1 ~routine~0))) (.cse14 (not (= ~SKIP2~0 4))) (.cse16 (not (= 6 ~MPR3~0))) (.cse29 (= ~customIrp~0 0)) (.cse22 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse1 (not (= 2 ~DC~0))) (.cse23 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse2 (not (= ~UNLOADED~0 0))) (.cse13 (not (= 7 ~IPC~0))) (.cse15 (not (= ~DeviceUsageTypePaging~0 1))) (.cse27 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse17 (not (= ~Executive~0 0))) (.cse28 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse18 (not (= 1 ~NP~0))) (.cse0 (let ((.cse30 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse31 (or .cse4 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse5 .cse10 .cse25 .cse26 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse30 .cse6 .cse7 .cse31) (or .cse30 .cse9 .cse31)))) (.cse19 (not (= 5 ~MPR1~0))) (.cse20 (not (= ~KernelMode~0 0))) (.cse21 (not (= |old(~customIrp~0)| 0)))) (and (or (= |old(~s~0)| ~s~0) .cse0) (or .cse1 .cse2 (let ((.cse8 (or .cse10 .cse11 .cse12))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse3 .cse4 .cse5 .cse9 .cse8))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= |old(~s~0)| ~MPR3~0)) .cse21) (or .cse22 .cse1 .cse23 .cse2 .cse13 (let ((.cse24 (or .cse5 .cse10 .cse25 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse11 .cse26 .cse12))) (and (or .cse3 .cse6 .cse7 .cse24) (or .cse3 .cse9 .cse24))) .cse14 .cse15 .cse16 .cse27 .cse17 .cse28 (not (= 1 |old(~s~0)|)) .cse18 (and .cse29 (= 1 ~setEventCalled~0) (= ~s~0 1)) .cse19 .cse20 .cse21) (or .cse29 (or .cse22 .cse1 .cse23 .cse2 .cse13 .cse15 .cse27 .cse17 .cse28 .cse18 .cse0 .cse19 .cse20 .cse21)))))) [2018-12-03 03:00:09,206 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-12-03 03:00:09,206 INFO L448 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-12-03 03:00:09,206 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-12-03 03:00:09,206 INFO L444 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse32 (+ ~myStatus~0 1073741637))) (let ((.cse5 (< 0 .cse32)) (.cse6 (< .cse32 0)) (.cse8 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (not (= 0 ~pended~0))) (.cse25 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse26 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (< ~compRegistered~0 1)) (.cse11 (not (= 1 ~routine~0))) (.cse13 (not (= ~SKIP2~0 4))) (.cse15 (not (= 6 ~MPR3~0))) (.cse20 (= ~customIrp~0 0)) (.cse22 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse0 (not (= 2 ~DC~0))) (.cse23 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse12 (not (= 7 ~IPC~0))) (.cse14 (not (= ~DeviceUsageTypePaging~0 1))) (.cse27 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse16 (not (= ~Executive~0 0))) (.cse28 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse17 (not (= 1 ~NP~0))) (.cse29 (let ((.cse30 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse31 (or .cse3 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse4 .cse9 .cse25 .cse26 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse30 .cse5 .cse6 .cse31) (or .cse30 .cse8 .cse31)))) (.cse18 (not (= 5 ~MPR1~0))) (.cse19 (not (= ~KernelMode~0 0))) (.cse21 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 (let ((.cse7 (or .cse9 .cse10 .cse11))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse2 .cse3 .cse4 .cse8 .cse7))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (= |old(~s~0)| ~MPR3~0)) (and .cse20 (= ~s~0 1)) .cse21) (or (or .cse22 .cse0 .cse23 .cse1 .cse12 (let ((.cse24 (or .cse4 .cse9 .cse25 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse10 .cse26 .cse11))) (and (or .cse2 .cse5 .cse6 .cse24) (or .cse2 .cse8 .cse24))) .cse13 .cse14 .cse15 .cse27 .cse16 .cse28 (not (= 1 |old(~s~0)|)) .cse17 .cse18 .cse19 .cse21) (and .cse20 (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)))) (or .cse29 (= ~s~0 ~NP~0)) (or .cse20 (or .cse22 .cse0 .cse23 .cse1 .cse12 .cse14 .cse27 .cse16 .cse28 .cse17 .cse29 .cse18 .cse19 .cse21)))))) [2018-12-03 03:00:09,206 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-12-03 03:00:09,206 INFO L444 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse32 (+ ~myStatus~0 1073741637))) (let ((.cse5 (< 0 .cse32)) (.cse6 (< .cse32 0)) (.cse8 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (not (= 0 ~pended~0))) (.cse25 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse26 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (< ~compRegistered~0 1)) (.cse11 (not (= 1 ~routine~0))) (.cse13 (not (= ~SKIP2~0 4))) (.cse15 (not (= 6 ~MPR3~0))) (.cse20 (= ~customIrp~0 0)) (.cse22 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse0 (not (= 2 ~DC~0))) (.cse23 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse12 (not (= 7 ~IPC~0))) (.cse14 (not (= ~DeviceUsageTypePaging~0 1))) (.cse27 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse16 (not (= ~Executive~0 0))) (.cse28 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse17 (not (= 1 ~NP~0))) (.cse29 (let ((.cse30 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse31 (or .cse3 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse4 .cse9 .cse25 .cse26 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse30 .cse5 .cse6 .cse31) (or .cse30 .cse8 .cse31)))) (.cse18 (not (= 5 ~MPR1~0))) (.cse19 (not (= ~KernelMode~0 0))) (.cse21 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 (let ((.cse7 (or .cse9 .cse10 .cse11))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse2 .cse3 .cse4 .cse8 .cse7))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (= |old(~s~0)| ~MPR3~0)) (and .cse20 (= ~s~0 1)) .cse21) (or (or .cse22 .cse0 .cse23 .cse1 .cse12 (let ((.cse24 (or .cse4 .cse9 .cse25 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse10 .cse26 .cse11))) (and (or .cse2 .cse5 .cse6 .cse24) (or .cse2 .cse8 .cse24))) .cse13 .cse14 .cse15 .cse27 .cse16 .cse28 (not (= 1 |old(~s~0)|)) .cse17 .cse18 .cse19 .cse21) (and .cse20 (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)))) (or .cse29 (= ~s~0 ~NP~0)) (or .cse20 (or .cse22 .cse0 .cse23 .cse1 .cse12 .cse14 .cse27 .cse16 .cse28 .cse17 .cse29 .cse18 .cse19 .cse21)))))) [2018-12-03 03:00:09,207 INFO L444 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse26 (+ ~myStatus~0 1073741637)) (.cse6 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse24 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse25 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse2 (or .cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse7 .cse11 .cse24 .cse25 (< ~IPC~0 (+ ~DC~0 5)))) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (= ~UNLOADED~0 0))) (.cse14 (not (= 7 ~IPC~0))) (.cse8 (< 0 .cse26)) (.cse9 (< .cse26 0)) (.cse5 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~myStatus~0 0))) (.cse12 (< ~compRegistered~0 1)) (.cse13 (not (= 1 ~routine~0))) (.cse15 (not (= ~SKIP2~0 4))) (.cse16 (not (= ~DeviceUsageTypePaging~0 1))) (.cse17 (not (= 6 ~MPR3~0))) (.cse18 (not (= ~Executive~0 0))) (.cse19 (not (= 1 ~NP~0))) (.cse20 (not (= 5 ~MPR1~0))) (.cse21 (not (= ~KernelMode~0 0))) (.cse22 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 (let ((.cse10 (or .cse11 .cse12 .cse13))) (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse5 .cse6 .cse7 .cse1 .cse10))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= |old(~s~0)| ~MPR3~0)) .cse22) (or .cse0 .cse8 .cse9 .cse2) (or (not (= |KeWaitForSingleObject_#in~WaitMode| 0)) .cse3 (not (= |KeWaitForSingleObject_#in~WaitReason| 0)) .cse4 .cse14 (let ((.cse23 (or .cse7 .cse11 .cse24 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse12 .cse25 .cse13))) (and (or .cse5 .cse8 .cse9 .cse23) (or .cse5 .cse1 .cse23))) .cse15 .cse16 .cse17 (not (= |KeWaitForSingleObject_#in~Timeout| 0)) .cse18 (not (= |KeWaitForSingleObject_#in~Alertable| 0)) (not (= 1 |old(~s~0)|)) .cse19 .cse20 .cse21 .cse22)))) [2018-12-03 03:00:09,207 INFO L448 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-12-03 03:00:09,207 INFO L448 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-12-03 03:00:09,207 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-12-03 03:00:09,207 INFO L448 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-12-03 03:00:09,207 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-12-03 03:00:09,207 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse34 (+ ~myStatus~0 1073741637))) (let ((.cse7 (< 0 .cse34)) (.cse8 (< .cse34 0)) (.cse10 (not (= ~myStatus~0 0))) (.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse27 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse28 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse31 (= ~customIrp~0 0)) (.cse0 (= |old(~s~0)| ~s~0))) (let ((.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse12 (< ~compRegistered~0 1)) (.cse13 (not (= 1 ~routine~0))) (.cse15 (not (= ~SKIP2~0 4))) (.cse17 (not (= 6 ~MPR3~0))) (.cse20 (and .cse31 (= 1 ~setEventCalled~0) .cse0)) (.cse24 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse2 (not (= 2 ~DC~0))) (.cse25 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse14 (not (= 7 ~IPC~0))) (.cse16 (not (= ~DeviceUsageTypePaging~0 1))) (.cse29 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse18 (not (= ~Executive~0 0))) (.cse30 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse19 (not (= 1 ~NP~0))) (.cse1 (let ((.cse32 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse33 (or .cse5 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse11 .cse27 .cse28 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse32 .cse7 .cse8 .cse33) (or .cse32 .cse10 .cse33)))) (.cse21 (not (= 5 ~MPR1~0))) (.cse22 (not (= ~KernelMode~0 0))) (.cse23 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or .cse2 .cse3 (let ((.cse9 (or .cse11 .cse12 .cse13))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse4 .cse5 .cse6 .cse10 .cse9))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (= |old(~s~0)| ~MPR3~0)) .cse23) (or .cse24 .cse2 .cse25 .cse3 .cse14 (let ((.cse26 (or .cse6 .cse11 .cse27 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse12 .cse28 .cse13))) (and (or .cse4 .cse7 .cse8 .cse26) (or .cse4 .cse10 .cse26))) .cse15 .cse16 .cse17 .cse29 .cse18 .cse30 (not (= 1 |old(~s~0)|)) .cse19 .cse21 .cse22 .cse20 .cse23) (or .cse31 (or .cse24 .cse2 .cse25 .cse3 .cse14 .cse16 .cse29 .cse18 .cse30 .cse19 .cse1 .cse21 .cse22 .cse23)))))) [2018-12-03 03:00:09,207 INFO L444 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (< ~SKIP2~0 .cse14)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-12-03 03:00:09,207 INFO L448 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-12-03 03:00:09,207 INFO L444 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,207 INFO L448 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-12-03 03:00:09,207 INFO L444 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-03 03:00:09,208 INFO L444 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L444 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (= |old(~s~0)| ~s~0)) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse5) (< ~IPC~0 (+ ~SKIP2~0 3))) .cse6) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L444 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 (< ~IPC~0 (+ ~DC~0 5)) (or .cse5 (not (= ~compRegistered~0 0)))) (or (or (or (or .cse1 .cse5) .cse0 .cse2 .cse3 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse4) (< ~IPC~0 (+ ~SKIP2~0 3))))) [2018-12-03 03:00:09,208 INFO L444 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (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))) [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-12-03 03:00:09,208 INFO L444 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (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))) [2018-12-03 03:00:09,208 INFO L444 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-12-03 03:00:09,208 INFO L448 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-12-03 03:00:09,209 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-12-03 03:00:09,209 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-12-03 03:00:09,209 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-12-03 03:00:09,209 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-12-03 03:00:09,209 INFO L444 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (= 0 ~pended~0)) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse11) .cse3 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-12-03 03:00:09,215 INFO L444 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< 0 .cse0) (< ~SKIP1~0 (+ ~s~0 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (< .cse0 0) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1))) [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-12-03 03:00:09,215 INFO L444 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ ~s~0 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse1 0) .cse8 .cse9 .cse10)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-12-03 03:00:09,215 INFO L451 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-12-03 03:00:09,215 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-12-03 03:00:09,215 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-12-03 03:00:09,216 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-12-03 03:00:09,216 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-12-03 03:00:09,216 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (let ((.cse1 (not (= ~myStatus~0 0)))) (let ((.cse0 (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= 2 ~DC~0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse4 (not (= 7 ~IPC~0))) (.cse5 (not (= ~DeviceUsageTypePaging~0 1))) (.cse6 (not (= ~Executive~0 0))) (.cse7 (not (= 1 ~NP~0))) (.cse8 (let ((.cse12 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse14 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse17 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse18 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse19 (not (= |old(~compRegistered~0)| 0))) (.cse20 (not (= 0 |old(~pended~0)|))) (.cse21 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse12 .cse13 (< 0 .cse9) .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse9 0) .cse19 .cse20 .cse21) (or .cse12 .cse13 .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (.cse10 (not (= 5 ~MPR1~0))) (.cse11 (not (= ~KernelMode~0 0)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 .cse9)) .cse10 .cse11) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (not (= |old(~customIrp~0)| 0)))))))) (and (or .cse0 .cse1 (= ~customIrp~0 0)) (or .cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)))))) [2018-12-03 03:00:09,220 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-12-03 03:00:09,220 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-12-03 03:00:09,220 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-12-03 03:00:09,220 INFO L448 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-12-03 03:00:09,221 INFO L444 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (and (and (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (= |old(~myStatus~0)| ~myStatus~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,221 INFO L448 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-12-03 03:00:09,224 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-12-03 03:00:09,224 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-12-03 03:00:09,224 INFO L448 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-12-03 03:00:09,224 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-12-03 03:00:09,224 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,224 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-12-03 03:00:09,224 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-12-03 03:00:09,224 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-12-03 03:00:09,225 INFO L444 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,225 INFO L444 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (and (= ~customIrp~0 0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,229 INFO L444 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,229 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-12-03 03:00:09,229 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-12-03 03:00:09,229 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-03 03:00:09,229 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-12-03 03:00:09,229 INFO L444 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (and (<= (+ |old(~myStatus~0)| 1) 0) (= |old(~myStatus~0)| ~myStatus~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,229 INFO L448 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-12-03 03:00:09,235 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-12-03 03:00:09,235 INFO L444 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~s~0 |old(~s~0)|) (<= (+ ~myStatus~0 1073741637) 0)) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,236 INFO L444 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,236 INFO L444 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (and (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= 1 ~setEventCalled~0) (= ~myStatus~0 |old(~myStatus~0)|))) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:00:09,236 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-12-03 03:00:09,236 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-12-03 03:00:09,236 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-12-03 03:00:09,239 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-12-03 03:00:09,239 INFO L448 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-12-03 03:00:09,239 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-12-03 03:00:09,239 INFO L444 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-12-03 03:00:09,239 INFO L451 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-12-03 03:00:09,239 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-12-03 03:00:09,239 INFO L451 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-12-03 03:00:09,239 INFO L448 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-12-03 03:00:09,240 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-12-03 03:00:09,240 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-12-03 03:00:09,240 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-12-03 03:00:09,240 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-12-03 03:00:09,240 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-12-03 03:00:09,240 INFO L444 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,240 INFO L448 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-12-03 03:00:09,240 INFO L444 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-12-03 03:00:09,244 INFO L448 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-12-03 03:00:09,244 INFO L444 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,244 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-12-03 03:00:09,244 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-12-03 03:00:09,244 INFO L448 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-12-03 03:00:09,244 INFO L444 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,244 INFO L444 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0))) [2018-12-03 03:00:09,245 INFO L448 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-12-03 03:00:09,245 INFO L448 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-12-03 03:00:09,245 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-12-03 03:00:09,245 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-12-03 03:00:09,252 INFO L444 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,252 INFO L444 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) [2018-12-03 03:00:09,253 INFO L444 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,253 INFO L448 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-12-03 03:00:09,253 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-12-03 03:00:09,253 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-12-03 03:00:09,253 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-12-03 03:00:09,253 INFO L444 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,253 INFO L448 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-12-03 03:00:09,253 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-12-03 03:00:09,263 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-12-03 03:00:09,263 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-12-03 03:00:09,263 INFO L444 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-12-03 03:00:09,263 INFO L448 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-12-03 03:00:09,263 INFO L444 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,263 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-12-03 03:00:09,263 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-12-03 03:00:09,263 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-12-03 03:00:09,264 INFO L444 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,264 INFO L448 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-12-03 03:00:09,264 INFO L444 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-12-03 03:00:09,274 INFO L448 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-12-03 03:00:09,275 INFO L448 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-12-03 03:00:09,275 INFO L444 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,275 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-12-03 03:00:09,275 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-12-03 03:00:09,275 INFO L448 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-12-03 03:00:09,275 INFO L444 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (and (<= 0 .cse0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-03 03:00:09,275 INFO L444 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-12-03 03:00:09,275 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-12-03 03:00:09,282 INFO L448 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L444 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L444 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse11) (<= .cse11 0)))) [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L444 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-12-03 03:00:09,283 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-12-03 03:00:09,284 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-12-03 03:00:09,284 INFO L444 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,284 INFO L448 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-12-03 03:00:09,285 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-12-03 03:00:09,285 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-12-03 03:00:09,285 INFO L444 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) [2018-12-03 03:00:09,285 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-12-03 03:00:09,285 INFO L444 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-03 03:00:09,285 INFO L448 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-12-03 03:00:09,285 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-12-03 03:00:09,285 INFO L444 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L444 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~myStatus~0) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|) (<= .cse11 0))))) [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L444 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-12-03 03:00:09,287 INFO L448 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-12-03 03:00:09,288 INFO L444 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse22 (+ ~MPR3~0 1)) (.cse18 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~DC~0 2)) (.cse20 (+ ~NP~0 5)) (.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse16 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse13 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse21)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse22)) (.cse11 (and (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse22 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse14 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse13 .cse14) (or .cse1 .cse8 .cse14))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse17 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) .cse16 (<= 0 .cse15) (= 1 ~setEventCalled~0) (<= 0 .cse17) (= ~MPR1~0 ~s~0) (<= .cse17 0))) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse16 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-12-03 03:00:09,293 INFO L444 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse22 (+ ~MPR3~0 1)) (.cse18 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~DC~0 2)) (.cse20 (+ ~NP~0 5)) (.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse16 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse13 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse21)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse22)) (.cse11 (and (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse22 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse14 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse13 .cse14) (or .cse1 .cse8 .cse14))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse17 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) .cse16 (<= 0 .cse15) (= 1 ~setEventCalled~0) (<= 0 .cse17) (= ~MPR1~0 ~s~0) (<= .cse17 0))) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse16 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-12-03 03:00:09,293 INFO L448 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-12-03 03:00:09,293 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-12-03 03:00:09,293 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-12-03 03:00:09,300 INFO L448 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-12-03 03:00:09,300 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-12-03 03:00:09,300 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse15 (= 0 ~pended~0)) (.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse16)) (.cse9 (< .cse16 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (and .cse15 (= |old(~s~0)| ~s~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse2 (or (let ((.cse14 (or .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse12))) (and (or .cse13 .cse14) (or .cse1 .cse9 .cse14))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse4 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11 (and .cse15 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse13 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2018-12-03 03:00:09,300 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-12-03 03:00:09,300 INFO L448 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-12-03 03:00:09,301 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-12-03 03:00:09,301 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-12-03 03:00:09,301 INFO L444 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse22 (+ ~MPR3~0 1)) (.cse18 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~DC~0 2)) (.cse20 (+ ~NP~0 5)) (.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse16 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse13 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse21)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse22)) (.cse11 (and (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse22 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse14 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse13 .cse14) (or .cse1 .cse8 .cse14))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse17 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) .cse16 (<= 0 .cse15) (= 1 ~setEventCalled~0) (<= 0 .cse17) (= ~MPR1~0 ~s~0) (<= .cse17 0))) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse16 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-12-03 03:00:09,309 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-12-03 03:00:09,310 INFO L448 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-12-03 03:00:09,310 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-12-03 03:00:09,310 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-12-03 03:00:09,310 INFO L444 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse7 (< 0 .cse14)) (.cse10 (< .cse14 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (not (= ~myStatus~0 0))) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11) (or (let ((.cse13 (or .cse8 (not (= 1 ~routine~0)) .cse3 .cse5 .cse11))) (and (or .cse12 .cse13) (or .cse7 .cse10 .cse13))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or .cse0 .cse12 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse11)))) [2018-12-03 03:00:09,310 INFO L448 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-12-03 03:00:09,310 INFO L444 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse15 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse15)) (.cse9 (< .cse15 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse4 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or (let ((.cse14 (or .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse12))) (and (or .cse13 .cse14) (or .cse1 .cse9 .cse14))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or .cse0 .cse13 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2018-12-03 03:00:09,319 INFO L448 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-12-03 03:00:09,320 INFO L444 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse22 (+ ~MPR3~0 1)) (.cse18 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~DC~0 2)) (.cse20 (+ ~NP~0 5)) (.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse16 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse13 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse21)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse22)) (.cse11 (and (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse22 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse14 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse13 .cse14) (or .cse1 .cse8 .cse14))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse17 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) .cse16 (<= 0 .cse15) (= 1 ~setEventCalled~0) (<= 0 .cse17) (= ~MPR1~0 ~s~0) (<= .cse17 0))) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse16 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-12-03 03:00:09,320 INFO L444 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse7 (< 0 .cse16)) (.cse10 (< .cse16 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse14 (not (= ~myStatus~0 0))) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11) (or (let ((.cse12 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse13 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse12 0) (= 0 ~pended~0) (<= 0 .cse12) (= 1 ~setEventCalled~0) (<= 0 .cse13) (= |old(~s~0)| ~s~0) (<= .cse13 0))) (or (let ((.cse15 (or .cse8 (not (= 1 ~routine~0)) .cse3 .cse5 .cse11))) (and (or .cse14 .cse15) (or .cse7 .cse10 .cse15))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) (or .cse0 .cse14 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse11)))) [2018-12-03 03:00:09,324 INFO L444 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse7 (< 0 .cse14)) (.cse10 (< .cse14 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (not (= ~myStatus~0 0))) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11) (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (or (let ((.cse13 (or .cse8 (not (= 1 ~routine~0)) .cse3 .cse5 .cse11))) (and (or .cse12 .cse13) (or .cse7 .cse10 .cse13))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) (or .cse0 .cse12 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse11)))) [2018-12-03 03:00:09,324 INFO L448 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-12-03 03:00:09,324 INFO L448 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-12-03 03:00:09,324 INFO L448 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-12-03 03:00:09,324 INFO L444 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-12-03 03:00:09,324 INFO L444 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L444 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L444 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L444 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-12-03 03:00:09,331 INFO L444 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:00:09,331 INFO L448 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-12-03 03:00:09,338 INFO L444 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:00:09,338 INFO L448 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-12-03 03:00:09,338 INFO L444 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:00:09,338 INFO L448 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-12-03 03:00:09,338 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-12-03 03:00:09,338 INFO L444 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,338 INFO L444 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,338 INFO L448 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-12-03 03:00:09,338 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-12-03 03:00:09,338 INFO L448 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-12-03 03:00:09,339 INFO L448 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-12-03 03:00:09,339 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-12-03 03:00:09,339 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-12-03 03:00:09,339 INFO L444 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse11 (+ ~NP~0 5))) (let ((.cse12 (and (= 0 ~pended~0) (<= .cse11 ~MPR3~0))) (.cse14 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse13 (= ~routine~0 0)) (.cse15 (= ~IPC~0 ~s~0))) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 .cse11)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (not (= 259 CdAudioDeviceControl_~status~3)) (= ~DC~0 ~s~0) (and .cse12 .cse13)) (and .cse14 (<= 1 ~compRegistered~0) .cse15 .cse13) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse12 .cse13 (= ~SKIP2~0 ~s~0)) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (and .cse12 .cse14 .cse13 .cse15)))) [2018-12-03 03:00:09,343 INFO L444 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,343 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-12-03 03:00:09,343 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-12-03 03:00:09,343 INFO L444 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,343 INFO L448 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-12-03 03:00:09,343 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-12-03 03:00:09,343 INFO L444 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,354 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-12-03 03:00:09,355 INFO L444 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,355 INFO L444 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-03 03:00:09,355 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-12-03 03:00:09,355 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-12-03 03:00:09,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:00:09,355 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~DC~0 ~s~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0)) [2018-12-03 03:00:09,355 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 03:00:09,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:00:09,355 INFO L444 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,365 INFO L448 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-12-03 03:00:09,365 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,366 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-12-03 03:00:09,366 INFO L444 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp106~1 1073741670)) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp106~1 4294967296) 1) 0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,366 INFO L448 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-12-03 03:00:09,366 INFO L448 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-12-03 03:00:09,366 INFO L444 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-03 03:00:09,366 INFO L448 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-12-03 03:00:09,366 INFO L448 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-12-03 03:00:09,366 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-12-03 03:00:09,366 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-12-03 03:00:09,366 INFO L444 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (let ((.cse0 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse0 0) (<= 0 .cse0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp109~1 4294967296) 1) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp109~1 1073741670)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))))) [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L444 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L444 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L444 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L448 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-12-03 03:00:09,375 INFO L444 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse2 (+ ~DC~0 2)) (.cse0 (+ ~NP~0 2)) (.cse1 (+ ~NP~0 5)) (.cse3 (+ ~SKIP1~0 2)) (.cse4 (+ ~MPR3~0 1))) (let ((.cse5 (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse2 ~SKIP2~0) (and (<= .cse0 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse1 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse3 ~MPR1~0)) (<= .cse4 ~IPC~0)))) (or (or (< ~SKIP1~0 .cse0) (< ~MPR3~0 .cse1) (< ~SKIP2~0 .cse2) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse3) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4)) (and (= 0 CdAudio435DeviceControl_~status~6) .cse5) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse5)))) [2018-12-03 03:00:09,383 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-12-03 03:00:09,383 INFO L448 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-12-03 03:00:09,383 INFO L444 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,383 INFO L448 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-12-03 03:00:09,383 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-12-03 03:00:09,383 INFO L444 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,384 INFO L444 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,384 INFO L444 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse2 (+ ~DC~0 2)) (.cse0 (+ ~NP~0 2)) (.cse1 (+ ~NP~0 5)) (.cse3 (+ ~SKIP1~0 2)) (.cse4 (+ ~MPR3~0 1))) (let ((.cse5 (and (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse2 ~SKIP2~0) (and (<= .cse0 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse1 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse3 ~MPR1~0))) (<= .cse4 ~IPC~0)))) (or (or (< ~SKIP1~0 .cse0) (< ~MPR3~0 .cse1) (< ~SKIP2~0 .cse2) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse3) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4)) (and (= 0 CdAudio435DeviceControl_~status~6) .cse5) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse5)))) [2018-12-03 03:00:09,384 INFO L448 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-12-03 03:00:09,384 INFO L448 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-12-03 03:00:09,384 INFO L444 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-03 03:00:09,391 INFO L444 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,391 INFO L448 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-12-03 03:00:09,391 INFO L448 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-12-03 03:00:09,391 INFO L448 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-12-03 03:00:09,391 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-12-03 03:00:09,391 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-12-03 03:00:09,391 INFO L444 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-03 03:00:09,391 INFO L444 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-12-03 03:00:09,391 INFO L448 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-12-03 03:00:09,391 INFO L448 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-12-03 03:00:09,392 INFO L444 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,392 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-12-03 03:00:09,403 INFO L448 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-12-03 03:00:09,403 INFO L448 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-12-03 03:00:09,403 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-12-03 03:00:09,403 INFO L444 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-12-03 03:00:09,404 INFO L448 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-12-03 03:00:09,404 INFO L444 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,404 INFO L448 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-12-03 03:00:09,404 INFO L444 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,404 INFO L448 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-12-03 03:00:09,404 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-12-03 03:00:09,404 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-12-03 03:00:09,404 INFO L448 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-12-03 03:00:09,404 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-12-03 03:00:09,404 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-12-03 03:00:09,404 INFO L444 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,413 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-12-03 03:00:09,413 INFO L444 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-03 03:00:09,414 INFO L448 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-12-03 03:00:09,414 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-12-03 03:00:09,414 INFO L444 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,414 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-12-03 03:00:09,414 INFO L448 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-12-03 03:00:09,414 INFO L444 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-03 03:00:09,414 INFO L448 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-12-03 03:00:09,414 INFO L444 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,414 INFO L448 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-12-03 03:00:09,414 INFO L444 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L444 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-12-03 03:00:09,424 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-12-03 03:00:09,425 INFO L444 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,425 INFO L448 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-12-03 03:00:09,425 INFO L448 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-12-03 03:00:09,425 INFO L444 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-03 03:00:09,429 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-12-03 03:00:09,429 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-12-03 03:00:09,429 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-12-03 03:00:09,429 INFO L448 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-12-03 03:00:09,429 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-12-03 03:00:09,429 INFO L448 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-12-03 03:00:09,429 INFO L448 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-12-03 03:00:09,429 INFO L444 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-03 03:00:09,430 INFO L448 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-12-03 03:00:09,430 INFO L448 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-12-03 03:00:09,430 INFO L444 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-03 03:00:09,430 INFO L448 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-12-03 03:00:09,430 INFO L448 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-12-03 03:00:09,430 INFO L448 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-12-03 03:00:09,430 INFO L448 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-12-03 03:00:09,430 INFO L448 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-12-03 03:00:09,430 INFO L448 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-12-03 03:00:09,430 INFO L444 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= 0 CdAudio435DeviceControl_~status~6))) [2018-12-03 03:00:09,435 INFO L448 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L444 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L444 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-12-03 03:00:09,436 INFO L451 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-12-03 03:00:09,436 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-12-03 03:00:09,441 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-12-03 03:00:09,441 INFO L448 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-12-03 03:00:09,441 INFO L448 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-12-03 03:00:09,441 INFO L448 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-12-03 03:00:09,441 INFO L444 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (let ((.cse4 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse4))) (let ((.cse0 (let ((.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse3 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse2 .cse3 (not (= ~myStatus~0 0))) (or .cse2 .cse3 .cse1 (< .cse4 0)))))) (and (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) .cse0 (not (= |old(~customIrp~0)| 0))) (or .cse1 .cse0))))) [2018-12-03 03:00:09,442 INFO L448 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-12-03 03:00:09,442 INFO L448 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-12-03 03:00:09,442 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-12-03 03:00:09,442 INFO L444 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse13 (< 0 .cse16))) (let ((.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse6 (not (= ~DeviceUsageTypePaging~0 1))) (.cse7 (not (= ~Executive~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 5 ~MPR1~0))) (.cse10 (not (= ~KernelMode~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse3 (= 0 ~pended~0)) (.cse5 (<= 1 ~compRegistered~0)) (.cse4 (= ~routine~0 1)) (.cse11 (let ((.cse14 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse15 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse14 .cse15 (not (= ~myStatus~0 0))) (or .cse14 .cse15 .cse13 (< .cse16 0)))))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 (= |old(~s~0)| ~s~0) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (= ~customIrp~0 0) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (or (and (and .cse3 .cse5 .cse4) (= ~s~0 |old(~s~0)|)) .cse13 .cse11))))) [2018-12-03 03:00:09,442 INFO L448 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-12-03 03:00:09,442 INFO L444 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (let ((.cse8 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 0 .cse8))) (let ((.cse5 (let ((.cse6 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse6 .cse7 (not (= ~myStatus~0 0))) (or .cse6 .cse7 .cse4 (< .cse8 0)))))) (let ((.cse0 (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) .cse5 (not (= |old(~customIrp~0)| 0)))) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~routine~0 0))) (and (or .cse0 (and .cse1 .cse2 (= |old(~s~0)| ~s~0) .cse3)) (or (= ~customIrp~0 0) .cse0) (or .cse4 (and (= ~s~0 ~NP~0) .cse1 .cse2 .cse3) .cse5)))))) [2018-12-03 03:00:09,445 INFO L444 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (let ((.cse4 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse4))) (let ((.cse0 (let ((.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse3 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse2 .cse3 (not (= ~myStatus~0 0))) (or .cse2 .cse3 .cse1 (< .cse4 0)))))) (and (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) .cse0 (not (= |old(~customIrp~0)| 0))) (or .cse1 .cse0))))) [2018-12-03 03:00:09,445 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-12-03 03:00:09,445 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-12-03 03:00:09,446 INFO L444 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse12 (+ ~myStatus~0 1073741637))) (let ((.cse8 (< 0 .cse12))) (let ((.cse1 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse5 (= ~routine~0 1)) (.cse4 (= 1 ~setEventCalled~0)) (.cse9 (let ((.cse10 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse10 .cse11 (not (= ~myStatus~0 0))) (or .cse10 .cse11 .cse8 (< .cse12 0)))))) (let ((.cse0 (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) .cse9 (not (= |old(~customIrp~0)| 0)))) (.cse7 (= ~s~0 ~MPR3~0)) (.cse6 (and .cse1 .cse2 .cse3 .cse5 .cse4))) (and (or (= ~customIrp~0 0) .cse0) (or (and (and .cse1 .cse2 .cse3 .cse4 .cse5) (= ~s~0 1)) .cse0 (and .cse6 .cse7)) (or .cse8 (and .cse7 .cse6) (and .cse1 .cse2 (= |old(~s~0)| ~s~0) .cse3 .cse4 .cse5) .cse9)))))) [2018-12-03 03:00:09,446 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-12-03 03:00:09,446 INFO L451 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-12-03 03:00:09,446 INFO L451 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-12-03 03:00:09,446 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-12-03 03:00:09,452 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-12-03 03:00:09,452 INFO L448 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-12-03 03:00:09,452 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-12-03 03:00:09,452 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-12-03 03:00:09,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:00:09 BoogieIcfgContainer [2018-12-03 03:00:09,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 03:00:09,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 03:00:09,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 03:00:09,502 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 03:00:09,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:58:42" (3/4) ... [2018-12-03 03:00:09,504 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-12-03 03:00:09,508 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-12-03 03:00:09,509 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-03 03:00:09,527 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2018-12-03 03:00:09,528 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-12-03 03:00:09,530 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 03:00:09,550 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status)) || (((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-03 03:00:09,551 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-03 03:00:09,551 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-03 03:00:09,552 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) [2018-12-03 03:00:09,552 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (customIrp == 0 && s == 1)) || !(\old(customIrp) == 0)) && (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (customIrp == 0 && \old(s) == s && 1 == setEventCalled))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5)) || s == NP)) && (customIrp == 0 || ((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) [2018-12-03 03:00:09,552 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (customIrp == 0 && s == 1)) || !(\old(customIrp) == 0)) && (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (customIrp == 0 && \old(s) == s && 1 == setEventCalled))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5)) || s == NP)) && (customIrp == 0 || ((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) [2018-12-03 03:00:09,553 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) [2018-12-03 03:00:09,553 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || !(\old(myStatus) == 0)) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-03 03:00:09,553 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) [2018-12-03 03:00:09,553 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) [2018-12-03 03:00:09,554 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3) [2018-12-03 03:00:09,554 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s) [2018-12-03 03:00:09,554 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(s) == s || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) && ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || ((customIrp == 0 && 1 == setEventCalled) && s == 1)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0))) && (customIrp == 0 || ((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) [2018-12-03 03:00:09,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-12-03 03:00:09,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-12-03 03:00:09,559 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((((((((customIrp == 0 && UNLOADED == 0) && MPR1 == 5) && IPC == 7) && Executive == 0) && DC == 2) && NP == 1) && DeviceUsageTypePaging == 1) && KernelMode == 0) && ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 + 1 <= IPC)))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-03 03:00:09,571 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) [2018-12-03 03:00:09,571 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) [2018-12-03 03:00:09,586 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,586 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) [2018-12-03 03:00:09,586 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,596 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,597 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) [2018-12-03 03:00:09,597 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,597 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,597 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || 0 < myStatus + 1073741637) && ((((((((((!(2 == DC) || !(UNLOADED == 0)) || (customIrp == 0 && ((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) [2018-12-03 03:00:09,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) [2018-12-03 03:00:09,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == status && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) [2018-12-03 03:00:09,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-03 03:00:09,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || 0 < myStatus + 1073741637) && ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || (customIrp == 0 && ((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) [2018-12-03 03:00:09,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= status + 1073741670 && s == NP && 0 == pended) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,634 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && s == \old(s)) && myStatus + 1073741637 <= 0) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) [2018-12-03 03:00:09,634 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) [2018-12-03 03:00:09,650 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-12-03 03:00:09,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-03 03:00:09,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode) || ((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) [2018-12-03 03:00:09,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-03 03:00:09,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-03 03:00:09,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-03 03:00:09,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-03 03:00:09,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-03 03:00:09,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && \old(s) == s) [2018-12-03 03:00:09,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-03 03:00:09,705 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-03 03:00:09,705 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-12-03 03:00:09,795 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dd38d003-9600-4ef8-8320-8c527fd855f1/bin-2019/utaipan/witness.graphml [2018-12-03 03:00:09,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 03:00:09,796 INFO L168 Benchmark]: Toolchain (without parser) took 88685.80 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 867.2 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -202.5 MB). Peak memory consumption was 664.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:00:09,797 INFO L168 Benchmark]: CDTParser took 0.11 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-12-03 03:00:09,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-12-03 03:00:09,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:00:09,797 INFO L168 Benchmark]: Boogie Preprocessor took 39.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:00:09,797 INFO L168 Benchmark]: RCFGBuilder took 695.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 936.7 MB in the end (delta: 149.8 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. [2018-12-03 03:00:09,798 INFO L168 Benchmark]: TraceAbstraction took 87291.04 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 760.2 MB). Free memory was 936.7 MB in the beginning and 1.2 GB in the end (delta: -258.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-03 03:00:09,798 INFO L168 Benchmark]: Witness Printer took 293.99 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-12-03 03:00:09,800 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 695.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 936.7 MB in the end (delta: 149.8 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87291.04 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 760.2 MB). Free memory was 936.7 MB in the beginning and 1.2 GB in the end (delta: -258.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 293.99 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: 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: 1756]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 2074]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status)) || (((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1934]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (customIrp == 0 && s == 1)) || !(\old(customIrp) == 0)) && (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (customIrp == 0 && \old(s) == s && 1 == setEventCalled))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5)) || s == NP)) && (customIrp == 0 || ((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || 0 < myStatus + 1073741637) && ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || (customIrp == 0 && ((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (customIrp == 0 && s == 1)) || !(\old(customIrp) == 0)) && (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (customIrp == 0 && \old(s) == s && 1 == setEventCalled))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5)) || s == NP)) && (customIrp == 0 || ((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || 0 < myStatus + 1073741637) && ((((((((((!(2 == DC) || !(UNLOADED == 0)) || (customIrp == 0 && ((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == status && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((((((((customIrp == 0 && UNLOADED == 0) && MPR1 == 5) && IPC == 7) && Executive == 0) && DC == 2) && NP == 1) && DeviceUsageTypePaging == 1) && KernelMode == 0) && ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 + 1 <= IPC)))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && \old(s) == s) - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: (((\old(s) == s || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) && ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || ((customIrp == 0 && 1 == setEventCalled) && s == 1)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0))) && (customIrp == 0 || ((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && s == \old(s)) && myStatus + 1073741637 <= 0) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode) || ((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) - InvariantResult [Line: 2079]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || !(\old(myStatus) == 0)) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((0 <= status + 1073741670 && s == NP && 0 == pended) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 2133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 2050]: Loop Invariant Derived loop invariant: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 534 locations, 1 error locations. SAFE Result, 87.2s OverallTime, 97 OverallIterations, 2 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 60.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 50639 SDtfs, 20574 SDslu, 225475 SDs, 0 SdLazy, 22699 SolverSat, 3457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1198 GetRequests, 427 SyntacticMatches, 8 SemanticMatches, 763 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=944occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9796444154520452 AbsIntWeakeningRatio, 1.7699115044247788 AbsIntAvgWeakeningVarsNumRemoved, 6.3584070796460175 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 97 MinimizatonAttempts, 2781 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1819 PreInvPairs, 2189 NumberOfFragments, 25980 HoareAnnotationTreeSize, 1819 FomulaSimplifications, 167081588 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 171 FomulaSimplificationsInter, 4519704 FormulaSimplificationTreeSizeReductionInter, 58.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 6443 NumberOfCodeBlocks, 6443 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 6346 ConstructedInterpolants, 0 QuantifiedInterpolants, 897374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 95 PerfectInterpolantSequences, 65/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...