./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/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_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/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-5842f4b [2018-11-18 12:15:39,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:15:39,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:15:39,315 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:15:39,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:15:39,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:15:39,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:15:39,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:15:39,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:15:39,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:15:39,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:15:39,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:15:39,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:15:39,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:15:39,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:15:39,323 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:15:39,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:15:39,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:15:39,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:15:39,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:15:39,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:15:39,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:15:39,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:15:39,330 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:15:39,330 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:15:39,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:15:39,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:15:39,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:15:39,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:15:39,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:15:39,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:15:39,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:15:39,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:15:39,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:15:39,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:15:39,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:15:39,336 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 12:15:39,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:15:39,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:15:39,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:15:39,346 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:15:39,346 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:15:39,346 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:15:39,346 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:15:39,346 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:15:39,346 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:15:39,346 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:15:39,347 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:15:39,347 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:15:39,347 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:15:39,347 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:15:39,347 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:15:39,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:15:39,347 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:15:39,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:15:39,348 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:15:39,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:15:39,348 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:15:39,348 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:15:39,348 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:15:39,348 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:15:39,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:15:39,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:15:39,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:15:39,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:15:39,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:15:39,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:15:39,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:15:39,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:15:39,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:15:39,349 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:15:39,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:15:39,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:15:39,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:15:39,350 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_323f49d4-eeba-49df-903a-0dcbb0a627ad/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-11-18 12:15:39,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:15:39,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:15:39,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:15:39,381 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:15:39,381 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:15:39,382 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 12:15:39,417 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/data/c41465ec1/05f81119bed849a08f01f4c38e77eb7a/FLAGd92a983c9 [2018-11-18 12:15:39,888 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:15:39,890 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 12:15:39,902 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/data/c41465ec1/05f81119bed849a08f01f4c38e77eb7a/FLAGd92a983c9 [2018-11-18 12:15:40,405 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/data/c41465ec1/05f81119bed849a08f01f4c38e77eb7a [2018-11-18 12:15:40,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:15:40,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:15:40,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:15:40,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:15:40,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:15:40,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428517bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40, skipping insertion in model container [2018-11-18 12:15:40,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:15:40,463 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:15:40,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:15:40,716 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:15:40,844 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:15:40,861 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:15:40,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40 WrapperNode [2018-11-18 12:15:40,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:15:40,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:15:40,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:15:40,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:15:40,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:15:40,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:15:40,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:15:40,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:15:40,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... [2018-11-18 12:15:40,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:15:40,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:15:40,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:15:40,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:15:40,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/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-11-18 12:15:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-18 12:15:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-18 12:15:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 12:15:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 12:15:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-18 12:15:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-18 12:15:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-18 12:15:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-18 12:15:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:15:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:15:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 12:15:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 12:15:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 12:15:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 12:15:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-18 12:15:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-18 12:15:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 12:15:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 12:15:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-18 12:15:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-18 12:15:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 12:15:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 12:15:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-18 12:15:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-18 12:15:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-18 12:15:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-18 12:15:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-18 12:15:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-18 12:15:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 12:15:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 12:15:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 12:15:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 12:15:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-18 12:15:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-18 12:15:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-18 12:15:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-18 12:15:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 12:15:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 12:15:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-18 12:15:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-18 12:15:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 12:15:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 12:15:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-18 12:15:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-18 12:15:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:15:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:15:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-18 12:15:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-18 12:15:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-18 12:15:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-18 12:15:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:15:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:15:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-18 12:15:40,980 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-18 12:15:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-18 12:15:40,980 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-18 12:15:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-18 12:15:40,980 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-18 12:15:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-18 12:15:40,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-18 12:15:41,260 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,260 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,365 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,365 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,436 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,436 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,541 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,541 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,592 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,593 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,699 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,699 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,740 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,740 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,753 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,754 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,893 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 12:15:41,893 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 12:15:41,906 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:15:41,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:15:41 BoogieIcfgContainer [2018-11-18 12:15:41,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:15:41,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:15:41,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:15:41,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:15:41,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:15:40" (1/3) ... [2018-11-18 12:15:41,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b9eccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:15:41, skipping insertion in model container [2018-11-18 12:15:41,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:15:40" (2/3) ... [2018-11-18 12:15:41,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b9eccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:15:41, skipping insertion in model container [2018-11-18 12:15:41,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:15:41" (3/3) ... [2018-11-18 12:15:41,911 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 12:15:41,918 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:15:41,923 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:15:41,933 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:15:41,957 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:15:41,957 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:15:41,957 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:15:41,957 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:15:41,958 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:15:41,958 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:15:41,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:15:41,958 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:15:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states. [2018-11-18 12:15:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 12:15:41,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:41,985 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:41,986 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:41,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash -545325625, now seen corresponding path program 1 times [2018-11-18 12:15:41,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:42,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:42,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:42,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:42,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:42,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:42,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:42,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:42,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:42,163 INFO L87 Difference]: Start difference. First operand 516 states. Second operand 3 states. [2018-11-18 12:15:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:42,307 INFO L93 Difference]: Finished difference Result 889 states and 1375 transitions. [2018-11-18 12:15:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:42,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 12:15:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:42,318 INFO L225 Difference]: With dead ends: 889 [2018-11-18 12:15:42,318 INFO L226 Difference]: Without dead ends: 508 [2018-11-18 12:15:42,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-11-18 12:15:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-11-18 12:15:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-18 12:15:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 738 transitions. [2018-11-18 12:15:42,385 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 738 transitions. Word has length 20 [2018-11-18 12:15:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:42,386 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 738 transitions. [2018-11-18 12:15:42,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 738 transitions. [2018-11-18 12:15:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 12:15:42,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:42,387 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:42,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:42,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash 736354971, now seen corresponding path program 1 times [2018-11-18 12:15:42,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:42,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:42,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:42,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:42,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:42,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:42,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:42,506 INFO L87 Difference]: Start difference. First operand 508 states and 738 transitions. Second operand 3 states. [2018-11-18 12:15:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:42,693 INFO L93 Difference]: Finished difference Result 792 states and 1120 transitions. [2018-11-18 12:15:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:42,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 12:15:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:42,699 INFO L225 Difference]: With dead ends: 792 [2018-11-18 12:15:42,699 INFO L226 Difference]: Without dead ends: 672 [2018-11-18 12:15:42,700 INFO L604 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-11-18 12:15:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-11-18 12:15:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 654. [2018-11-18 12:15:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-11-18 12:15:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 933 transitions. [2018-11-18 12:15:42,760 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 933 transitions. Word has length 25 [2018-11-18 12:15:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:42,760 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 933 transitions. [2018-11-18 12:15:42,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 933 transitions. [2018-11-18 12:15:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 12:15:42,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:42,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:42,762 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:42,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash -285439709, now seen corresponding path program 1 times [2018-11-18 12:15:42,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:42,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:42,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:42,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:42,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:42,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:42,815 INFO L87 Difference]: Start difference. First operand 654 states and 933 transitions. Second operand 3 states. [2018-11-18 12:15:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:42,875 INFO L93 Difference]: Finished difference Result 999 states and 1382 transitions. [2018-11-18 12:15:42,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:42,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 12:15:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:42,881 INFO L225 Difference]: With dead ends: 999 [2018-11-18 12:15:42,881 INFO L226 Difference]: Without dead ends: 823 [2018-11-18 12:15:42,882 INFO L604 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-11-18 12:15:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-11-18 12:15:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 771. [2018-11-18 12:15:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-11-18 12:15:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1095 transitions. [2018-11-18 12:15:42,918 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1095 transitions. Word has length 30 [2018-11-18 12:15:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:42,918 INFO L480 AbstractCegarLoop]: Abstraction has 771 states and 1095 transitions. [2018-11-18 12:15:42,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1095 transitions. [2018-11-18 12:15:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 12:15:42,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:42,920 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:42,920 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:42,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash -842217619, now seen corresponding path program 1 times [2018-11-18 12:15:42,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:42,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:42,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:42,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:42,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:42,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:42,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:42,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:42,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:42,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:42,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:42,964 INFO L87 Difference]: Start difference. First operand 771 states and 1095 transitions. Second operand 3 states. [2018-11-18 12:15:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:43,085 INFO L93 Difference]: Finished difference Result 1436 states and 2104 transitions. [2018-11-18 12:15:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:43,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 12:15:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:43,089 INFO L225 Difference]: With dead ends: 1436 [2018-11-18 12:15:43,090 INFO L226 Difference]: Without dead ends: 1168 [2018-11-18 12:15:43,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-11-18 12:15:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 907. [2018-11-18 12:15:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-18 12:15:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1331 transitions. [2018-11-18 12:15:43,131 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1331 transitions. Word has length 31 [2018-11-18 12:15:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:43,132 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1331 transitions. [2018-11-18 12:15:43,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1331 transitions. [2018-11-18 12:15:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 12:15:43,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:43,133 INFO L375 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-11-18 12:15:43,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:43,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:43,134 INFO L82 PathProgramCache]: Analyzing trace with hash -577334153, now seen corresponding path program 1 times [2018-11-18 12:15:43,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:43,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:43,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:43,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:43,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:43,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:43,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:43,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:43,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:43,195 INFO L87 Difference]: Start difference. First operand 907 states and 1331 transitions. Second operand 5 states. [2018-11-18 12:15:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:43,834 INFO L93 Difference]: Finished difference Result 1574 states and 2317 transitions. [2018-11-18 12:15:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:15:43,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-18 12:15:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:43,840 INFO L225 Difference]: With dead ends: 1574 [2018-11-18 12:15:43,840 INFO L226 Difference]: Without dead ends: 992 [2018-11-18 12:15:43,842 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:15:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-18 12:15:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 895. [2018-11-18 12:15:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-18 12:15:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1307 transitions. [2018-11-18 12:15:43,907 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1307 transitions. Word has length 32 [2018-11-18 12:15:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:43,908 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1307 transitions. [2018-11-18 12:15:43,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1307 transitions. [2018-11-18 12:15:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 12:15:43,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:43,910 INFO L375 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-11-18 12:15:43,910 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:43,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:43,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1232616009, now seen corresponding path program 1 times [2018-11-18 12:15:43,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:43,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:43,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:43,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:43,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:43,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:43,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:43,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:43,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:43,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:43,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:43,967 INFO L87 Difference]: Start difference. First operand 895 states and 1307 transitions. Second operand 3 states. [2018-11-18 12:15:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:44,036 INFO L93 Difference]: Finished difference Result 898 states and 1309 transitions. [2018-11-18 12:15:44,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:44,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 12:15:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:44,041 INFO L225 Difference]: With dead ends: 898 [2018-11-18 12:15:44,041 INFO L226 Difference]: Without dead ends: 894 [2018-11-18 12:15:44,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-11-18 12:15:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2018-11-18 12:15:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-18 12:15:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1304 transitions. [2018-11-18 12:15:44,086 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1304 transitions. Word has length 36 [2018-11-18 12:15:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:44,087 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1304 transitions. [2018-11-18 12:15:44,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1304 transitions. [2018-11-18 12:15:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 12:15:44,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:44,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:44,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:44,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:44,091 INFO L82 PathProgramCache]: Analyzing trace with hash -187804141, now seen corresponding path program 1 times [2018-11-18 12:15:44,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:44,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:44,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:44,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:44,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:44,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:44,131 INFO L87 Difference]: Start difference. First operand 894 states and 1304 transitions. Second operand 3 states. [2018-11-18 12:15:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:44,182 INFO L93 Difference]: Finished difference Result 1286 states and 1827 transitions. [2018-11-18 12:15:44,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:44,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 12:15:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:44,187 INFO L225 Difference]: With dead ends: 1286 [2018-11-18 12:15:44,187 INFO L226 Difference]: Without dead ends: 1023 [2018-11-18 12:15:44,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-11-18 12:15:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 880. [2018-11-18 12:15:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-18 12:15:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1246 transitions. [2018-11-18 12:15:44,233 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1246 transitions. Word has length 39 [2018-11-18 12:15:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:44,233 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 1246 transitions. [2018-11-18 12:15:44,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1246 transitions. [2018-11-18 12:15:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 12:15:44,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:44,235 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:44,235 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:44,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:44,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1893485112, now seen corresponding path program 1 times [2018-11-18 12:15:44,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:44,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:44,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:44,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:44,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:44,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:44,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:44,272 INFO L87 Difference]: Start difference. First operand 880 states and 1246 transitions. Second operand 3 states. [2018-11-18 12:15:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:44,324 INFO L93 Difference]: Finished difference Result 980 states and 1370 transitions. [2018-11-18 12:15:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:44,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 12:15:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:44,328 INFO L225 Difference]: With dead ends: 980 [2018-11-18 12:15:44,328 INFO L226 Difference]: Without dead ends: 962 [2018-11-18 12:15:44,329 INFO L604 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-11-18 12:15:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-11-18 12:15:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 900. [2018-11-18 12:15:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-18 12:15:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1272 transitions. [2018-11-18 12:15:44,375 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1272 transitions. Word has length 40 [2018-11-18 12:15:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:44,375 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1272 transitions. [2018-11-18 12:15:44,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1272 transitions. [2018-11-18 12:15:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 12:15:44,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:44,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:44,378 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:44,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash -328961088, now seen corresponding path program 1 times [2018-11-18 12:15:44,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:44,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-11-18 12:15:44,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:44,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:44,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:44,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:44,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:44,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:44,431 INFO L87 Difference]: Start difference. First operand 900 states and 1272 transitions. Second operand 3 states. [2018-11-18 12:15:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:44,481 INFO L93 Difference]: Finished difference Result 1179 states and 1651 transitions. [2018-11-18 12:15:44,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:44,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 12:15:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:44,485 INFO L225 Difference]: With dead ends: 1179 [2018-11-18 12:15:44,486 INFO L226 Difference]: Without dead ends: 933 [2018-11-18 12:15:44,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-11-18 12:15:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2018-11-18 12:15:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-18 12:15:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1271 transitions. [2018-11-18 12:15:44,534 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1271 transitions. Word has length 46 [2018-11-18 12:15:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:44,534 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1271 transitions. [2018-11-18 12:15:44,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1271 transitions. [2018-11-18 12:15:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 12:15:44,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:44,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:44,537 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:44,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash -266214691, now seen corresponding path program 1 times [2018-11-18 12:15:44,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:44,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:44,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:44,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:44,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:15:44,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:44,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:15:44,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:15:44,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:15:44,575 INFO L87 Difference]: Start difference. First operand 900 states and 1271 transitions. Second operand 4 states. [2018-11-18 12:15:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:44,853 INFO L93 Difference]: Finished difference Result 1022 states and 1417 transitions. [2018-11-18 12:15:44,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:15:44,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-18 12:15:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:44,857 INFO L225 Difference]: With dead ends: 1022 [2018-11-18 12:15:44,857 INFO L226 Difference]: Without dead ends: 789 [2018-11-18 12:15:44,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:15:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-11-18 12:15:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 755. [2018-11-18 12:15:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-11-18 12:15:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1060 transitions. [2018-11-18 12:15:44,904 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1060 transitions. Word has length 47 [2018-11-18 12:15:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:44,904 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1060 transitions. [2018-11-18 12:15:44,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:15:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1060 transitions. [2018-11-18 12:15:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 12:15:44,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:44,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:44,906 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:44,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash -95752597, now seen corresponding path program 1 times [2018-11-18 12:15:44,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:44,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:44,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:44,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:44,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:44,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:44,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:44,968 INFO L87 Difference]: Start difference. First operand 755 states and 1060 transitions. Second operand 3 states. [2018-11-18 12:15:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:45,010 INFO L93 Difference]: Finished difference Result 875 states and 1208 transitions. [2018-11-18 12:15:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:45,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 12:15:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:45,014 INFO L225 Difference]: With dead ends: 875 [2018-11-18 12:15:45,014 INFO L226 Difference]: Without dead ends: 779 [2018-11-18 12:15:45,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-18 12:15:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 754. [2018-11-18 12:15:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-18 12:15:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1055 transitions. [2018-11-18 12:15:45,074 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1055 transitions. Word has length 47 [2018-11-18 12:15:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:45,075 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 1055 transitions. [2018-11-18 12:15:45,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1055 transitions. [2018-11-18 12:15:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 12:15:45,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:45,076 INFO L375 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-11-18 12:15:45,077 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:45,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1151602405, now seen corresponding path program 1 times [2018-11-18 12:15:45,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:45,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:45,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:45,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:45,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:45,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:45,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:45,118 INFO L87 Difference]: Start difference. First operand 754 states and 1055 transitions. Second operand 3 states. [2018-11-18 12:15:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:45,206 INFO L93 Difference]: Finished difference Result 944 states and 1304 transitions. [2018-11-18 12:15:45,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:45,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 12:15:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:45,210 INFO L225 Difference]: With dead ends: 944 [2018-11-18 12:15:45,210 INFO L226 Difference]: Without dead ends: 934 [2018-11-18 12:15:45,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-11-18 12:15:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 829. [2018-11-18 12:15:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-11-18 12:15:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1142 transitions. [2018-11-18 12:15:45,254 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1142 transitions. Word has length 48 [2018-11-18 12:15:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:45,254 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1142 transitions. [2018-11-18 12:15:45,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1142 transitions. [2018-11-18 12:15:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 12:15:45,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:45,256 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:45,256 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:45,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1783806924, now seen corresponding path program 1 times [2018-11-18 12:15:45,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:45,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:45,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:15:45,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:45,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:15:45,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:15:45,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:15:45,305 INFO L87 Difference]: Start difference. First operand 829 states and 1142 transitions. Second operand 8 states. [2018-11-18 12:15:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:45,426 INFO L93 Difference]: Finished difference Result 855 states and 1176 transitions. [2018-11-18 12:15:45,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:15:45,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 12:15:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:45,430 INFO L225 Difference]: With dead ends: 855 [2018-11-18 12:15:45,430 INFO L226 Difference]: Without dead ends: 851 [2018-11-18 12:15:45,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:15:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-18 12:15:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 848. [2018-11-18 12:15:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-11-18 12:15:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1169 transitions. [2018-11-18 12:15:45,478 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1169 transitions. Word has length 49 [2018-11-18 12:15:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:45,479 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1169 transitions. [2018-11-18 12:15:45,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:15:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1169 transitions. [2018-11-18 12:15:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 12:15:45,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:45,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:45,481 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:45,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:45,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1783530094, now seen corresponding path program 1 times [2018-11-18 12:15:45,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:45,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:45,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:45,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:45,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:15:45,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:45,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:15:45,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:15:45,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:15:45,529 INFO L87 Difference]: Start difference. First operand 848 states and 1169 transitions. Second operand 8 states. [2018-11-18 12:15:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:45,641 INFO L93 Difference]: Finished difference Result 890 states and 1221 transitions. [2018-11-18 12:15:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:15:45,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 12:15:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:45,645 INFO L225 Difference]: With dead ends: 890 [2018-11-18 12:15:45,645 INFO L226 Difference]: Without dead ends: 869 [2018-11-18 12:15:45,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:15:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-18 12:15:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 868. [2018-11-18 12:15:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-11-18 12:15:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1193 transitions. [2018-11-18 12:15:45,695 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1193 transitions. Word has length 49 [2018-11-18 12:15:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:45,695 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 1193 transitions. [2018-11-18 12:15:45,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:15:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1193 transitions. [2018-11-18 12:15:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 12:15:45,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:45,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:45,698 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:45,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1751655904, now seen corresponding path program 1 times [2018-11-18 12:15:45,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:45,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:45,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:45,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:45,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:45,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:45,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:45,748 INFO L87 Difference]: Start difference. First operand 868 states and 1193 transitions. Second operand 3 states. [2018-11-18 12:15:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:45,873 INFO L93 Difference]: Finished difference Result 1087 states and 1478 transitions. [2018-11-18 12:15:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:45,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 12:15:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:45,877 INFO L225 Difference]: With dead ends: 1087 [2018-11-18 12:15:45,877 INFO L226 Difference]: Without dead ends: 1055 [2018-11-18 12:15:45,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-11-18 12:15:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 948. [2018-11-18 12:15:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-11-18 12:15:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1285 transitions. [2018-11-18 12:15:45,932 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1285 transitions. Word has length 50 [2018-11-18 12:15:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:45,932 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 1285 transitions. [2018-11-18 12:15:45,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1285 transitions. [2018-11-18 12:15:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 12:15:45,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:45,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:45,934 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:45,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1898348706, now seen corresponding path program 1 times [2018-11-18 12:15:45,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:45,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:45,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:45,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:46,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:46,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:15:46,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:46,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:15:46,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:15:46,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:15:46,002 INFO L87 Difference]: Start difference. First operand 948 states and 1285 transitions. Second operand 7 states. [2018-11-18 12:15:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:46,861 INFO L93 Difference]: Finished difference Result 1114 states and 1559 transitions. [2018-11-18 12:15:46,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:15:46,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-18 12:15:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:46,865 INFO L225 Difference]: With dead ends: 1114 [2018-11-18 12:15:46,865 INFO L226 Difference]: Without dead ends: 1020 [2018-11-18 12:15:46,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:15:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-11-18 12:15:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 878. [2018-11-18 12:15:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-11-18 12:15:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1184 transitions. [2018-11-18 12:15:46,920 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1184 transitions. Word has length 50 [2018-11-18 12:15:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:46,921 INFO L480 AbstractCegarLoop]: Abstraction has 878 states and 1184 transitions. [2018-11-18 12:15:46,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:15:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1184 transitions. [2018-11-18 12:15:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 12:15:46,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:46,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:46,923 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:46,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:46,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1307715265, now seen corresponding path program 1 times [2018-11-18 12:15:46,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:46,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:47,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-11-18 12:15:47,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:47,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:15:47,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:47,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:15:47,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:15:47,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:15:47,007 INFO L87 Difference]: Start difference. First operand 878 states and 1184 transitions. Second operand 9 states. [2018-11-18 12:15:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:48,395 INFO L93 Difference]: Finished difference Result 1192 states and 1644 transitions. [2018-11-18 12:15:48,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 12:15:48,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-18 12:15:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:48,398 INFO L225 Difference]: With dead ends: 1192 [2018-11-18 12:15:48,398 INFO L226 Difference]: Without dead ends: 1123 [2018-11-18 12:15:48,399 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-18 12:15:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-18 12:15:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 891. [2018-11-18 12:15:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-11-18 12:15:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1209 transitions. [2018-11-18 12:15:48,434 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1209 transitions. Word has length 50 [2018-11-18 12:15:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:48,434 INFO L480 AbstractCegarLoop]: Abstraction has 891 states and 1209 transitions. [2018-11-18 12:15:48,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:15:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1209 transitions. [2018-11-18 12:15:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 12:15:48,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:48,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:48,436 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:48,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash -212723345, now seen corresponding path program 1 times [2018-11-18 12:15:48,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:48,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:48,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:48,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:48,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:48,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:48,466 INFO L87 Difference]: Start difference. First operand 891 states and 1209 transitions. Second operand 3 states. [2018-11-18 12:15:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:48,531 INFO L93 Difference]: Finished difference Result 916 states and 1237 transitions. [2018-11-18 12:15:48,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:48,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-18 12:15:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:48,533 INFO L225 Difference]: With dead ends: 916 [2018-11-18 12:15:48,534 INFO L226 Difference]: Without dead ends: 911 [2018-11-18 12:15:48,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-11-18 12:15:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 907. [2018-11-18 12:15:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-18 12:15:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1228 transitions. [2018-11-18 12:15:48,567 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1228 transitions. Word has length 52 [2018-11-18 12:15:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:48,567 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1228 transitions. [2018-11-18 12:15:48,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1228 transitions. [2018-11-18 12:15:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 12:15:48,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:48,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:48,569 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:48,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:48,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1458849901, now seen corresponding path program 1 times [2018-11-18 12:15:48,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:48,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:48,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:48,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:48,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:48,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-11-18 12:15:48,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:48,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:48,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:48,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:48,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:48,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:48,591 INFO L87 Difference]: Start difference. First operand 907 states and 1228 transitions. Second operand 3 states. [2018-11-18 12:15:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:48,657 INFO L93 Difference]: Finished difference Result 1123 states and 1518 transitions. [2018-11-18 12:15:48,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:48,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-18 12:15:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:48,660 INFO L225 Difference]: With dead ends: 1123 [2018-11-18 12:15:48,660 INFO L226 Difference]: Without dead ends: 879 [2018-11-18 12:15:48,661 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-18 12:15:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2018-11-18 12:15:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-18 12:15:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1191 transitions. [2018-11-18 12:15:48,692 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1191 transitions. Word has length 54 [2018-11-18 12:15:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:48,693 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1191 transitions. [2018-11-18 12:15:48,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1191 transitions. [2018-11-18 12:15:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 12:15:48,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:48,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:48,695 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:48,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1855862492, now seen corresponding path program 1 times [2018-11-18 12:15:48,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:48,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:48,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:48,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:48,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:48,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:48,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:48,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:48,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:48,741 INFO L87 Difference]: Start difference. First operand 879 states and 1191 transitions. Second operand 5 states. [2018-11-18 12:15:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:49,013 INFO L93 Difference]: Finished difference Result 889 states and 1199 transitions. [2018-11-18 12:15:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:49,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 12:15:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:49,016 INFO L225 Difference]: With dead ends: 889 [2018-11-18 12:15:49,016 INFO L226 Difference]: Without dead ends: 883 [2018-11-18 12:15:49,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-11-18 12:15:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 879. [2018-11-18 12:15:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-18 12:15:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1190 transitions. [2018-11-18 12:15:49,071 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1190 transitions. Word has length 53 [2018-11-18 12:15:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:49,071 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1190 transitions. [2018-11-18 12:15:49,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1190 transitions. [2018-11-18 12:15:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 12:15:49,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:49,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:49,074 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:49,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash -14681562, now seen corresponding path program 1 times [2018-11-18 12:15:49,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:49,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:49,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:49,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:49,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:49,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:49,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:49,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:49,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:49,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:49,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:49,119 INFO L87 Difference]: Start difference. First operand 879 states and 1190 transitions. Second operand 5 states. [2018-11-18 12:15:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:49,454 INFO L93 Difference]: Finished difference Result 891 states and 1201 transitions. [2018-11-18 12:15:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:49,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-18 12:15:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:49,456 INFO L225 Difference]: With dead ends: 891 [2018-11-18 12:15:49,456 INFO L226 Difference]: Without dead ends: 855 [2018-11-18 12:15:49,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-11-18 12:15:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 851. [2018-11-18 12:15:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-18 12:15:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1158 transitions. [2018-11-18 12:15:49,510 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1158 transitions. Word has length 52 [2018-11-18 12:15:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:49,510 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1158 transitions. [2018-11-18 12:15:49,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1158 transitions. [2018-11-18 12:15:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 12:15:49,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:49,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:49,514 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:49,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1965789300, now seen corresponding path program 1 times [2018-11-18 12:15:49,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:49,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:49,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:49,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:49,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:49,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:49,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:49,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:49,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:49,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:49,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:49,564 INFO L87 Difference]: Start difference. First operand 851 states and 1158 transitions. Second operand 5 states. [2018-11-18 12:15:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:49,839 INFO L93 Difference]: Finished difference Result 859 states and 1164 transitions. [2018-11-18 12:15:49,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:49,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 12:15:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:49,842 INFO L225 Difference]: With dead ends: 859 [2018-11-18 12:15:49,842 INFO L226 Difference]: Without dead ends: 853 [2018-11-18 12:15:49,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-18 12:15:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 851. [2018-11-18 12:15:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-18 12:15:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1157 transitions. [2018-11-18 12:15:49,895 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1157 transitions. Word has length 54 [2018-11-18 12:15:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:49,896 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1157 transitions. [2018-11-18 12:15:49,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1157 transitions. [2018-11-18 12:15:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 12:15:49,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:49,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:49,898 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:49,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1122077901, now seen corresponding path program 1 times [2018-11-18 12:15:49,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:49,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:49,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:49,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:49,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:49,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:49,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:15:49,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:49,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:15:49,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:15:49,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:15:49,967 INFO L87 Difference]: Start difference. First operand 851 states and 1157 transitions. Second operand 4 states. [2018-11-18 12:15:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:50,162 INFO L93 Difference]: Finished difference Result 890 states and 1198 transitions. [2018-11-18 12:15:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:15:50,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-18 12:15:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:50,166 INFO L225 Difference]: With dead ends: 890 [2018-11-18 12:15:50,166 INFO L226 Difference]: Without dead ends: 858 [2018-11-18 12:15:50,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-18 12:15:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 853. [2018-11-18 12:15:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-11-18 12:15:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1159 transitions. [2018-11-18 12:15:50,223 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1159 transitions. Word has length 55 [2018-11-18 12:15:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:50,223 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1159 transitions. [2018-11-18 12:15:50,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:15:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1159 transitions. [2018-11-18 12:15:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 12:15:50,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:50,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:50,228 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:50,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:50,228 INFO L82 PathProgramCache]: Analyzing trace with hash 612604811, now seen corresponding path program 1 times [2018-11-18 12:15:50,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:50,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:50,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:50,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:50,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:50,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:50,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:15:50,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:50,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:15:50,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:15:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:15:50,299 INFO L87 Difference]: Start difference. First operand 853 states and 1159 transitions. Second operand 9 states. [2018-11-18 12:15:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:50,435 INFO L93 Difference]: Finished difference Result 880 states and 1189 transitions. [2018-11-18 12:15:50,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:15:50,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-18 12:15:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:50,437 INFO L225 Difference]: With dead ends: 880 [2018-11-18 12:15:50,437 INFO L226 Difference]: Without dead ends: 842 [2018-11-18 12:15:50,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-11-18 12:15:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2018-11-18 12:15:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-11-18 12:15:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1133 transitions. [2018-11-18 12:15:50,488 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1133 transitions. Word has length 55 [2018-11-18 12:15:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:50,488 INFO L480 AbstractCegarLoop]: Abstraction has 842 states and 1133 transitions. [2018-11-18 12:15:50,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:15:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1133 transitions. [2018-11-18 12:15:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 12:15:50,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:50,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:50,494 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:50,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash 943898090, now seen corresponding path program 1 times [2018-11-18 12:15:50,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:50,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:50,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:50,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:50,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:50,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 12:15:50,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:50,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:15:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:15:50,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:15:50,615 INFO L87 Difference]: Start difference. First operand 842 states and 1133 transitions. Second operand 10 states. [2018-11-18 12:15:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:50,775 INFO L93 Difference]: Finished difference Result 858 states and 1150 transitions. [2018-11-18 12:15:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:15:50,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-18 12:15:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:50,777 INFO L225 Difference]: With dead ends: 858 [2018-11-18 12:15:50,778 INFO L226 Difference]: Without dead ends: 840 [2018-11-18 12:15:50,778 INFO L604 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-11-18 12:15:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-18 12:15:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2018-11-18 12:15:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-18 12:15:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1129 transitions. [2018-11-18 12:15:50,817 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1129 transitions. Word has length 56 [2018-11-18 12:15:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:50,818 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1129 transitions. [2018-11-18 12:15:50,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:15:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1129 transitions. [2018-11-18 12:15:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 12:15:50,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:50,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:50,821 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:50,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash -584250765, now seen corresponding path program 1 times [2018-11-18 12:15:50,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:50,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:50,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:50,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:50,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 12:15:50,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:50,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:15:50,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:15:50,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:15:50,912 INFO L87 Difference]: Start difference. First operand 840 states and 1129 transitions. Second operand 10 states. [2018-11-18 12:15:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:51,070 INFO L93 Difference]: Finished difference Result 853 states and 1143 transitions. [2018-11-18 12:15:51,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:15:51,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-18 12:15:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:51,073 INFO L225 Difference]: With dead ends: 853 [2018-11-18 12:15:51,073 INFO L226 Difference]: Without dead ends: 835 [2018-11-18 12:15:51,074 INFO L604 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-11-18 12:15:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-18 12:15:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2018-11-18 12:15:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-11-18 12:15:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1122 transitions. [2018-11-18 12:15:51,104 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1122 transitions. Word has length 55 [2018-11-18 12:15:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:51,104 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1122 transitions. [2018-11-18 12:15:51,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:15:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1122 transitions. [2018-11-18 12:15:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 12:15:51,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:51,106 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:51,106 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:51,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash 885529078, now seen corresponding path program 1 times [2018-11-18 12:15:51,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:51,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:51,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:51,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:51,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:51,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:51,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:51,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:51,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:51,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:51,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:51,151 INFO L87 Difference]: Start difference. First operand 835 states and 1122 transitions. Second operand 5 states. [2018-11-18 12:15:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:51,650 INFO L93 Difference]: Finished difference Result 1388 states and 1935 transitions. [2018-11-18 12:15:51,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:15:51,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-18 12:15:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:51,654 INFO L225 Difference]: With dead ends: 1388 [2018-11-18 12:15:51,654 INFO L226 Difference]: Without dead ends: 1222 [2018-11-18 12:15:51,655 INFO L604 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-11-18 12:15:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2018-11-18 12:15:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 874. [2018-11-18 12:15:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-18 12:15:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1178 transitions. [2018-11-18 12:15:51,706 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1178 transitions. Word has length 61 [2018-11-18 12:15:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:51,706 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1178 transitions. [2018-11-18 12:15:51,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1178 transitions. [2018-11-18 12:15:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 12:15:51,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:51,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:51,708 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:51,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1025869542, now seen corresponding path program 1 times [2018-11-18 12:15:51,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:51,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:51,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:15:51,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:51,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:15:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:15:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:51,829 INFO L87 Difference]: Start difference. First operand 874 states and 1178 transitions. Second operand 11 states. [2018-11-18 12:15:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:51,986 INFO L93 Difference]: Finished difference Result 891 states and 1196 transitions. [2018-11-18 12:15:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:15:51,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 12:15:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:51,988 INFO L225 Difference]: With dead ends: 891 [2018-11-18 12:15:51,988 INFO L226 Difference]: Without dead ends: 871 [2018-11-18 12:15:51,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-11-18 12:15:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2018-11-18 12:15:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-11-18 12:15:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1173 transitions. [2018-11-18 12:15:52,023 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1173 transitions. Word has length 58 [2018-11-18 12:15:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:52,023 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1173 transitions. [2018-11-18 12:15:52,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:15:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1173 transitions. [2018-11-18 12:15:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 12:15:52,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:52,025 INFO L375 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-11-18 12:15:52,025 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:52,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1034569085, now seen corresponding path program 1 times [2018-11-18 12:15:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:52,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 12:15:52,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:52,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:15:52,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:15:52,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:15:52,139 INFO L87 Difference]: Start difference. First operand 871 states and 1173 transitions. Second operand 12 states. [2018-11-18 12:15:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:52,310 INFO L93 Difference]: Finished difference Result 897 states and 1201 transitions. [2018-11-18 12:15:52,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:15:52,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-18 12:15:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:52,315 INFO L225 Difference]: With dead ends: 897 [2018-11-18 12:15:52,316 INFO L226 Difference]: Without dead ends: 872 [2018-11-18 12:15:52,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:15:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-11-18 12:15:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-11-18 12:15:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-18 12:15:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1162 transitions. [2018-11-18 12:15:52,365 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1162 transitions. Word has length 59 [2018-11-18 12:15:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:52,365 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1162 transitions. [2018-11-18 12:15:52,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:15:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1162 transitions. [2018-11-18 12:15:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 12:15:52,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:52,367 INFO L375 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-11-18 12:15:52,368 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:52,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1584207719, now seen corresponding path program 1 times [2018-11-18 12:15:52,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:52,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:52,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:52,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-11-18 12:15:52,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:52,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:52,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:52,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:52,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:52,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:52,417 INFO L87 Difference]: Start difference. First operand 870 states and 1162 transitions. Second operand 3 states. [2018-11-18 12:15:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:52,446 INFO L93 Difference]: Finished difference Result 904 states and 1196 transitions. [2018-11-18 12:15:52,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:52,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-18 12:15:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:52,450 INFO L225 Difference]: With dead ends: 904 [2018-11-18 12:15:52,450 INFO L226 Difference]: Without dead ends: 872 [2018-11-18 12:15:52,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-11-18 12:15:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-11-18 12:15:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-18 12:15:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1161 transitions. [2018-11-18 12:15:52,486 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1161 transitions. Word has length 59 [2018-11-18 12:15:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:52,487 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1161 transitions. [2018-11-18 12:15:52,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1161 transitions. [2018-11-18 12:15:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 12:15:52,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:52,488 INFO L375 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-11-18 12:15:52,488 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:52,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1074734629, now seen corresponding path program 1 times [2018-11-18 12:15:52,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:52,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:52,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:52,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:52,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:15:52,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:52,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:15:52,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:15:52,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:15:52,541 INFO L87 Difference]: Start difference. First operand 870 states and 1161 transitions. Second operand 9 states. [2018-11-18 12:15:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:52,646 INFO L93 Difference]: Finished difference Result 892 states and 1184 transitions. [2018-11-18 12:15:52,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:15:52,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-18 12:15:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:52,649 INFO L225 Difference]: With dead ends: 892 [2018-11-18 12:15:52,649 INFO L226 Difference]: Without dead ends: 858 [2018-11-18 12:15:52,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-18 12:15:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2018-11-18 12:15:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-11-18 12:15:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1141 transitions. [2018-11-18 12:15:52,684 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1141 transitions. Word has length 59 [2018-11-18 12:15:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:52,684 INFO L480 AbstractCegarLoop]: Abstraction has 858 states and 1141 transitions. [2018-11-18 12:15:52,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:15:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1141 transitions. [2018-11-18 12:15:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 12:15:52,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:52,685 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:52,686 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:52,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 518615990, now seen corresponding path program 1 times [2018-11-18 12:15:52,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:52,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:52,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:15:52,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:52,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:15:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:15:52,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:15:52,725 INFO L87 Difference]: Start difference. First operand 858 states and 1141 transitions. Second operand 4 states. [2018-11-18 12:15:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:52,813 INFO L93 Difference]: Finished difference Result 1014 states and 1364 transitions. [2018-11-18 12:15:52,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:15:52,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-18 12:15:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:52,816 INFO L225 Difference]: With dead ends: 1014 [2018-11-18 12:15:52,817 INFO L226 Difference]: Without dead ends: 903 [2018-11-18 12:15:52,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-11-18 12:15:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 865. [2018-11-18 12:15:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 12:15:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1157 transitions. [2018-11-18 12:15:52,853 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1157 transitions. Word has length 60 [2018-11-18 12:15:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:52,853 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1157 transitions. [2018-11-18 12:15:52,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:15:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1157 transitions. [2018-11-18 12:15:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 12:15:52,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:52,855 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:52,855 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:52,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:52,856 INFO L82 PathProgramCache]: Analyzing trace with hash 793375604, now seen corresponding path program 1 times [2018-11-18 12:15:52,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:52,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:52,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:52,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:52,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-11-18 12:15:52,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:52,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:15:52,936 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:52,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:15:52,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:15:52,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:52,936 INFO L87 Difference]: Start difference. First operand 865 states and 1157 transitions. Second operand 11 states. [2018-11-18 12:15:53,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:53,022 INFO L93 Difference]: Finished difference Result 934 states and 1250 transitions. [2018-11-18 12:15:53,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:15:53,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-18 12:15:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:53,025 INFO L225 Difference]: With dead ends: 934 [2018-11-18 12:15:53,025 INFO L226 Difference]: Without dead ends: 879 [2018-11-18 12:15:53,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-18 12:15:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 869. [2018-11-18 12:15:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-18 12:15:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1175 transitions. [2018-11-18 12:15:53,063 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1175 transitions. Word has length 60 [2018-11-18 12:15:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:53,063 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1175 transitions. [2018-11-18 12:15:53,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:15:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1175 transitions. [2018-11-18 12:15:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 12:15:53,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:53,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:53,065 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:53,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash 826541143, now seen corresponding path program 1 times [2018-11-18 12:15:53,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:53,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:53,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:53,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:53,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:15:53,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:53,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:15:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:15:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:15:53,120 INFO L87 Difference]: Start difference. First operand 869 states and 1175 transitions. Second operand 9 states. [2018-11-18 12:15:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:53,225 INFO L93 Difference]: Finished difference Result 900 states and 1212 transitions. [2018-11-18 12:15:53,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:15:53,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-18 12:15:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:53,227 INFO L225 Difference]: With dead ends: 900 [2018-11-18 12:15:53,228 INFO L226 Difference]: Without dead ends: 861 [2018-11-18 12:15:53,228 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-11-18 12:15:53,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2018-11-18 12:15:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-11-18 12:15:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1159 transitions. [2018-11-18 12:15:53,261 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1159 transitions. Word has length 60 [2018-11-18 12:15:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:53,261 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1159 transitions. [2018-11-18 12:15:53,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:15:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1159 transitions. [2018-11-18 12:15:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 12:15:53,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:53,263 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:53,263 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:53,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:53,263 INFO L82 PathProgramCache]: Analyzing trace with hash 940267595, now seen corresponding path program 1 times [2018-11-18 12:15:53,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:53,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:53,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:53,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:53,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 12:15:53,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:53,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:15:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:15:53,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:53,352 INFO L87 Difference]: Start difference. First operand 861 states and 1159 transitions. Second operand 13 states. [2018-11-18 12:15:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:53,529 INFO L93 Difference]: Finished difference Result 878 states and 1177 transitions. [2018-11-18 12:15:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:15:53,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-18 12:15:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:53,531 INFO L225 Difference]: With dead ends: 878 [2018-11-18 12:15:53,531 INFO L226 Difference]: Without dead ends: 856 [2018-11-18 12:15:53,532 INFO L604 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-11-18 12:15:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-18 12:15:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-18 12:15:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-18 12:15:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1152 transitions. [2018-11-18 12:15:53,577 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1152 transitions. Word has length 63 [2018-11-18 12:15:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:53,577 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1152 transitions. [2018-11-18 12:15:53,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:15:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1152 transitions. [2018-11-18 12:15:53,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 12:15:53,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:53,579 INFO L375 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-11-18 12:15:53,579 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:53,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:53,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1381266646, now seen corresponding path program 1 times [2018-11-18 12:15:53,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:53,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:53,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:53,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:53,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 12:15:53,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:53,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:15:53,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:15:53,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:53,692 INFO L87 Difference]: Start difference. First operand 856 states and 1152 transitions. Second operand 13 states. [2018-11-18 12:15:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:53,860 INFO L93 Difference]: Finished difference Result 873 states and 1170 transitions. [2018-11-18 12:15:53,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:15:53,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-18 12:15:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:53,863 INFO L225 Difference]: With dead ends: 873 [2018-11-18 12:15:53,863 INFO L226 Difference]: Without dead ends: 851 [2018-11-18 12:15:53,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:15:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-18 12:15:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2018-11-18 12:15:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-18 12:15:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1145 transitions. [2018-11-18 12:15:53,896 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1145 transitions. Word has length 62 [2018-11-18 12:15:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:53,896 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1145 transitions. [2018-11-18 12:15:53,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:15:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1145 transitions. [2018-11-18 12:15:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 12:15:53,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:53,898 INFO L375 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-11-18 12:15:53,898 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:53,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2111475177, now seen corresponding path program 1 times [2018-11-18 12:15:53,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:53,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:53,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:53,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:53,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:53,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:53,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:53,927 INFO L87 Difference]: Start difference. First operand 851 states and 1145 transitions. Second operand 3 states. [2018-11-18 12:15:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:53,955 INFO L93 Difference]: Finished difference Result 1129 states and 1519 transitions. [2018-11-18 12:15:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:53,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-18 12:15:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:53,958 INFO L225 Difference]: With dead ends: 1129 [2018-11-18 12:15:53,958 INFO L226 Difference]: Without dead ends: 790 [2018-11-18 12:15:53,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-11-18 12:15:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 738. [2018-11-18 12:15:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-18 12:15:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 959 transitions. [2018-11-18 12:15:53,989 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 959 transitions. Word has length 62 [2018-11-18 12:15:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:53,989 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 959 transitions. [2018-11-18 12:15:53,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 959 transitions. [2018-11-18 12:15:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 12:15:53,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:53,990 INFO L375 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-11-18 12:15:53,991 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:53,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:53,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1792922453, now seen corresponding path program 1 times [2018-11-18 12:15:53,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:53,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:54,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:54,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 12:15:54,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:54,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:15:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:15:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:15:54,080 INFO L87 Difference]: Start difference. First operand 738 states and 959 transitions. Second operand 12 states. [2018-11-18 12:15:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:54,208 INFO L93 Difference]: Finished difference Result 762 states and 984 transitions. [2018-11-18 12:15:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:15:54,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-18 12:15:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:54,210 INFO L225 Difference]: With dead ends: 762 [2018-11-18 12:15:54,210 INFO L226 Difference]: Without dead ends: 738 [2018-11-18 12:15:54,210 INFO L604 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-11-18 12:15:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-18 12:15:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-11-18 12:15:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-18 12:15:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 955 transitions. [2018-11-18 12:15:54,238 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 955 transitions. Word has length 66 [2018-11-18 12:15:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:54,238 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 955 transitions. [2018-11-18 12:15:54,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:15:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 955 transitions. [2018-11-18 12:15:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 12:15:54,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:54,239 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:54,239 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:54,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1330358999, now seen corresponding path program 1 times [2018-11-18 12:15:54,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:54,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:54,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:54,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:54,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 12:15:54,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:54,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:15:54,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:15:54,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:15:54,326 INFO L87 Difference]: Start difference. First operand 736 states and 955 transitions. Second operand 12 states. [2018-11-18 12:15:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:54,442 INFO L93 Difference]: Finished difference Result 758 states and 978 transitions. [2018-11-18 12:15:54,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:15:54,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-18 12:15:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:54,443 INFO L225 Difference]: With dead ends: 758 [2018-11-18 12:15:54,443 INFO L226 Difference]: Without dead ends: 734 [2018-11-18 12:15:54,444 INFO L604 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-11-18 12:15:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-18 12:15:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-18 12:15:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-18 12:15:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 951 transitions. [2018-11-18 12:15:54,485 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 951 transitions. Word has length 63 [2018-11-18 12:15:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:54,486 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 951 transitions. [2018-11-18 12:15:54,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:15:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 951 transitions. [2018-11-18 12:15:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 12:15:54,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:54,486 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:54,487 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:54,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:54,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1286779497, now seen corresponding path program 1 times [2018-11-18 12:15:54,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:54,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:54,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:54,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:54,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:54,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:54,547 INFO L87 Difference]: Start difference. First operand 734 states and 951 transitions. Second operand 5 states. [2018-11-18 12:15:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:54,666 INFO L93 Difference]: Finished difference Result 768 states and 990 transitions. [2018-11-18 12:15:54,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:54,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 12:15:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:54,669 INFO L225 Difference]: With dead ends: 768 [2018-11-18 12:15:54,669 INFO L226 Difference]: Without dead ends: 741 [2018-11-18 12:15:54,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-18 12:15:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2018-11-18 12:15:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-11-18 12:15:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 959 transitions. [2018-11-18 12:15:54,702 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 959 transitions. Word has length 67 [2018-11-18 12:15:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:54,702 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 959 transitions. [2018-11-18 12:15:54,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 959 transitions. [2018-11-18 12:15:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 12:15:54,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:54,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:54,703 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:54,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash -585179623, now seen corresponding path program 1 times [2018-11-18 12:15:54,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:54,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:54,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:54,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:54,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 12:15:54,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:54,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:15:54,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:15:54,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:15:54,770 INFO L87 Difference]: Start difference. First operand 739 states and 959 transitions. Second operand 12 states. [2018-11-18 12:15:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:54,886 INFO L93 Difference]: Finished difference Result 763 states and 984 transitions. [2018-11-18 12:15:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:15:54,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-18 12:15:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:54,888 INFO L225 Difference]: With dead ends: 763 [2018-11-18 12:15:54,888 INFO L226 Difference]: Without dead ends: 739 [2018-11-18 12:15:54,889 INFO L604 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-11-18 12:15:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-11-18 12:15:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2018-11-18 12:15:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-18 12:15:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 955 transitions. [2018-11-18 12:15:54,940 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 955 transitions. Word has length 67 [2018-11-18 12:15:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:54,942 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 955 transitions. [2018-11-18 12:15:54,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:15:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 955 transitions. [2018-11-18 12:15:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 12:15:54,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:54,943 INFO L375 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-11-18 12:15:54,944 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:54,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash 119968528, now seen corresponding path program 1 times [2018-11-18 12:15:54,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:54,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:54,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:54,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:54,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:55,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:55,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 12:15:55,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:55,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:15:55,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:15:55,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:15:55,081 INFO L87 Difference]: Start difference. First operand 737 states and 955 transitions. Second operand 12 states. [2018-11-18 12:15:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:55,216 INFO L93 Difference]: Finished difference Result 759 states and 978 transitions. [2018-11-18 12:15:55,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:15:55,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-18 12:15:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:55,218 INFO L225 Difference]: With dead ends: 759 [2018-11-18 12:15:55,218 INFO L226 Difference]: Without dead ends: 735 [2018-11-18 12:15:55,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:15:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-11-18 12:15:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 730. [2018-11-18 12:15:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-18 12:15:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 943 transitions. [2018-11-18 12:15:55,266 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 943 transitions. Word has length 62 [2018-11-18 12:15:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:55,267 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 943 transitions. [2018-11-18 12:15:55,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:15:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 943 transitions. [2018-11-18 12:15:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:15:55,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:55,268 INFO L375 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-11-18 12:15:55,268 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:55,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash -31742391, now seen corresponding path program 1 times [2018-11-18 12:15:55,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:55,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:55,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:55,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:55,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:55,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:55,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:55,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:55,330 INFO L87 Difference]: Start difference. First operand 730 states and 943 transitions. Second operand 3 states. [2018-11-18 12:15:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:55,384 INFO L93 Difference]: Finished difference Result 942 states and 1214 transitions. [2018-11-18 12:15:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:55,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-18 12:15:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:55,386 INFO L225 Difference]: With dead ends: 942 [2018-11-18 12:15:55,386 INFO L226 Difference]: Without dead ends: 803 [2018-11-18 12:15:55,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-11-18 12:15:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 772. [2018-11-18 12:15:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-11-18 12:15:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 995 transitions. [2018-11-18 12:15:55,436 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 995 transitions. Word has length 80 [2018-11-18 12:15:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:55,437 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 995 transitions. [2018-11-18 12:15:55,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 995 transitions. [2018-11-18 12:15:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 12:15:55,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:55,437 INFO L375 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-11-18 12:15:55,438 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:55,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:55,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1468658595, now seen corresponding path program 1 times [2018-11-18 12:15:55,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:55,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:55,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:15:55,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:55,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:15:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:15:55,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:55,457 INFO L87 Difference]: Start difference. First operand 772 states and 995 transitions. Second operand 3 states. [2018-11-18 12:15:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:55,492 INFO L93 Difference]: Finished difference Result 904 states and 1170 transitions. [2018-11-18 12:15:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:15:55,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 12:15:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:55,494 INFO L225 Difference]: With dead ends: 904 [2018-11-18 12:15:55,494 INFO L226 Difference]: Without dead ends: 772 [2018-11-18 12:15:55,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:15:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-11-18 12:15:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2018-11-18 12:15:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-11-18 12:15:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 992 transitions. [2018-11-18 12:15:55,546 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 992 transitions. Word has length 66 [2018-11-18 12:15:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:55,546 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 992 transitions. [2018-11-18 12:15:55,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:15:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 992 transitions. [2018-11-18 12:15:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 12:15:55,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:55,547 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:55,547 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:55,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2028069485, now seen corresponding path program 1 times [2018-11-18 12:15:55,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:55,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:55,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:55,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:55,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:55,576 INFO L87 Difference]: Start difference. First operand 772 states and 992 transitions. Second operand 5 states. [2018-11-18 12:15:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:55,631 INFO L93 Difference]: Finished difference Result 826 states and 1051 transitions. [2018-11-18 12:15:55,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:55,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 12:15:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:55,633 INFO L225 Difference]: With dead ends: 826 [2018-11-18 12:15:55,633 INFO L226 Difference]: Without dead ends: 774 [2018-11-18 12:15:55,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-11-18 12:15:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2018-11-18 12:15:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-11-18 12:15:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 991 transitions. [2018-11-18 12:15:55,665 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 991 transitions. Word has length 65 [2018-11-18 12:15:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:55,665 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 991 transitions. [2018-11-18 12:15:55,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 991 transitions. [2018-11-18 12:15:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 12:15:55,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:55,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:55,666 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:55,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:55,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1565297937, now seen corresponding path program 1 times [2018-11-18 12:15:55,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:55,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:55,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:55,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:55,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:55,704 INFO L87 Difference]: Start difference. First operand 772 states and 991 transitions. Second operand 5 states. [2018-11-18 12:15:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:55,861 INFO L93 Difference]: Finished difference Result 836 states and 1066 transitions. [2018-11-18 12:15:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:15:55,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 12:15:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:55,864 INFO L225 Difference]: With dead ends: 836 [2018-11-18 12:15:55,864 INFO L226 Difference]: Without dead ends: 803 [2018-11-18 12:15:55,864 INFO L604 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-11-18 12:15:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-11-18 12:15:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 778. [2018-11-18 12:15:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-11-18 12:15:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 998 transitions. [2018-11-18 12:15:55,908 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 998 transitions. Word has length 65 [2018-11-18 12:15:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:55,908 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 998 transitions. [2018-11-18 12:15:55,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 998 transitions. [2018-11-18 12:15:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 12:15:55,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:55,910 INFO L375 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-11-18 12:15:55,910 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:55,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1088995916, now seen corresponding path program 1 times [2018-11-18 12:15:55,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:55,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:55,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:55,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:15:55,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:55,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:15:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:15:55,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:55,976 INFO L87 Difference]: Start difference. First operand 778 states and 998 transitions. Second operand 6 states. [2018-11-18 12:15:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:56,033 INFO L93 Difference]: Finished difference Result 812 states and 1032 transitions. [2018-11-18 12:15:56,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:15:56,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 12:15:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:56,036 INFO L225 Difference]: With dead ends: 812 [2018-11-18 12:15:56,036 INFO L226 Difference]: Without dead ends: 780 [2018-11-18 12:15:56,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:15:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-11-18 12:15:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 778. [2018-11-18 12:15:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-11-18 12:15:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 997 transitions. [2018-11-18 12:15:56,090 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 997 transitions. Word has length 66 [2018-11-18 12:15:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:56,090 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 997 transitions. [2018-11-18 12:15:56,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:15:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 997 transitions. [2018-11-18 12:15:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 12:15:56,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:56,091 INFO L375 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-11-18 12:15:56,092 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:56,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash 579522826, now seen corresponding path program 1 times [2018-11-18 12:15:56,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:56,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:56,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:56,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:15:56,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:56,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:15:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:15:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:56,165 INFO L87 Difference]: Start difference. First operand 778 states and 997 transitions. Second operand 11 states. [2018-11-18 12:15:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:56,258 INFO L93 Difference]: Finished difference Result 800 states and 1020 transitions. [2018-11-18 12:15:56,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:15:56,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-18 12:15:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:56,261 INFO L225 Difference]: With dead ends: 800 [2018-11-18 12:15:56,261 INFO L226 Difference]: Without dead ends: 774 [2018-11-18 12:15:56,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-11-18 12:15:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 768. [2018-11-18 12:15:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-11-18 12:15:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 984 transitions. [2018-11-18 12:15:56,292 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 984 transitions. Word has length 66 [2018-11-18 12:15:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:56,292 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 984 transitions. [2018-11-18 12:15:56,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:15:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 984 transitions. [2018-11-18 12:15:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 12:15:56,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:56,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:56,294 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:56,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:56,294 INFO L82 PathProgramCache]: Analyzing trace with hash -59264446, now seen corresponding path program 1 times [2018-11-18 12:15:56,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:56,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:56,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:56,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:56,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:56,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:56,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:56,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:56,331 INFO L87 Difference]: Start difference. First operand 768 states and 984 transitions. Second operand 5 states. [2018-11-18 12:15:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:56,400 INFO L93 Difference]: Finished difference Result 809 states and 1028 transitions. [2018-11-18 12:15:56,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:56,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 12:15:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:56,401 INFO L225 Difference]: With dead ends: 809 [2018-11-18 12:15:56,401 INFO L226 Difference]: Without dead ends: 775 [2018-11-18 12:15:56,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-11-18 12:15:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 768. [2018-11-18 12:15:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-11-18 12:15:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 983 transitions. [2018-11-18 12:15:56,431 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 983 transitions. Word has length 67 [2018-11-18 12:15:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:56,431 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 983 transitions. [2018-11-18 12:15:56,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 983 transitions. [2018-11-18 12:15:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 12:15:56,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:56,432 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:56,432 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:56,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1508193805, now seen corresponding path program 1 times [2018-11-18 12:15:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:56,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:15:56,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:56,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:15:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:15:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:56,485 INFO L87 Difference]: Start difference. First operand 768 states and 983 transitions. Second operand 6 states. [2018-11-18 12:15:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:56,558 INFO L93 Difference]: Finished difference Result 807 states and 1024 transitions. [2018-11-18 12:15:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:15:56,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-18 12:15:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:56,561 INFO L225 Difference]: With dead ends: 807 [2018-11-18 12:15:56,561 INFO L226 Difference]: Without dead ends: 775 [2018-11-18 12:15:56,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:15:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-11-18 12:15:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 770. [2018-11-18 12:15:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-11-18 12:15:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 985 transitions. [2018-11-18 12:15:56,603 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 985 transitions. Word has length 68 [2018-11-18 12:15:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:56,603 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 985 transitions. [2018-11-18 12:15:56,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:15:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 985 transitions. [2018-11-18 12:15:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 12:15:56,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:56,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:56,605 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:56,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2017666895, now seen corresponding path program 1 times [2018-11-18 12:15:56,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:56,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:56,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:15:56,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:56,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:15:56,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:15:56,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:56,683 INFO L87 Difference]: Start difference. First operand 770 states and 985 transitions. Second operand 11 states. [2018-11-18 12:15:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:56,766 INFO L93 Difference]: Finished difference Result 795 states and 1012 transitions. [2018-11-18 12:15:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:15:56,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-18 12:15:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:56,768 INFO L225 Difference]: With dead ends: 795 [2018-11-18 12:15:56,768 INFO L226 Difference]: Without dead ends: 762 [2018-11-18 12:15:56,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-18 12:15:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2018-11-18 12:15:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-18 12:15:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 975 transitions. [2018-11-18 12:15:56,803 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 975 transitions. Word has length 68 [2018-11-18 12:15:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:56,803 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 975 transitions. [2018-11-18 12:15:56,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:15:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 975 transitions. [2018-11-18 12:15:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 12:15:56,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:56,804 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:56,804 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:56,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash 491674496, now seen corresponding path program 1 times [2018-11-18 12:15:56,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:56,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:56,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:15:56,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:56,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:15:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:15:56,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:56,879 INFO L87 Difference]: Start difference. First operand 762 states and 975 transitions. Second operand 6 states. [2018-11-18 12:15:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:56,958 INFO L93 Difference]: Finished difference Result 809 states and 1023 transitions. [2018-11-18 12:15:56,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:15:56,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-18 12:15:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:56,960 INFO L225 Difference]: With dead ends: 809 [2018-11-18 12:15:56,960 INFO L226 Difference]: Without dead ends: 757 [2018-11-18 12:15:56,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:15:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-11-18 12:15:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 755. [2018-11-18 12:15:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-11-18 12:15:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 962 transitions. [2018-11-18 12:15:56,990 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 962 transitions. Word has length 68 [2018-11-18 12:15:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:56,990 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 962 transitions. [2018-11-18 12:15:56,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:15:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 962 transitions. [2018-11-18 12:15:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 12:15:56,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:56,991 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:56,991 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:56,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash -17798594, now seen corresponding path program 1 times [2018-11-18 12:15:56,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:56,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:56,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:56,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:57,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:57,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:15:57,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:57,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:15:57,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:15:57,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:57,059 INFO L87 Difference]: Start difference. First operand 755 states and 962 transitions. Second operand 11 states. [2018-11-18 12:15:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:57,147 INFO L93 Difference]: Finished difference Result 777 states and 985 transitions. [2018-11-18 12:15:57,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:15:57,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-18 12:15:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:57,149 INFO L225 Difference]: With dead ends: 777 [2018-11-18 12:15:57,150 INFO L226 Difference]: Without dead ends: 745 [2018-11-18 12:15:57,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-18 12:15:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2018-11-18 12:15:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-18 12:15:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 948 transitions. [2018-11-18 12:15:57,182 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 948 transitions. Word has length 68 [2018-11-18 12:15:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:57,182 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 948 transitions. [2018-11-18 12:15:57,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:15:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 948 transitions. [2018-11-18 12:15:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 12:15:57,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:57,183 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:57,183 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:57,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:57,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1487313881, now seen corresponding path program 1 times [2018-11-18 12:15:57,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:57,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:57,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:57,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:57,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:57,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:57,202 INFO L87 Difference]: Start difference. First operand 745 states and 948 transitions. Second operand 5 states. [2018-11-18 12:15:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:57,400 INFO L93 Difference]: Finished difference Result 807 states and 1028 transitions. [2018-11-18 12:15:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:57,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-18 12:15:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:57,402 INFO L225 Difference]: With dead ends: 807 [2018-11-18 12:15:57,402 INFO L226 Difference]: Without dead ends: 801 [2018-11-18 12:15:57,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-18 12:15:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 745. [2018-11-18 12:15:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-18 12:15:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 947 transitions. [2018-11-18 12:15:57,433 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 947 transitions. Word has length 68 [2018-11-18 12:15:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:57,433 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 947 transitions. [2018-11-18 12:15:57,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 947 transitions. [2018-11-18 12:15:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 12:15:57,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:57,435 INFO L375 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-11-18 12:15:57,435 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:57,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -217966723, now seen corresponding path program 1 times [2018-11-18 12:15:57,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:57,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:57,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:57,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:57,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:57,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:57,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:57,475 INFO L87 Difference]: Start difference. First operand 745 states and 947 transitions. Second operand 5 states. [2018-11-18 12:15:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:57,518 INFO L93 Difference]: Finished difference Result 786 states and 991 transitions. [2018-11-18 12:15:57,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:57,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 12:15:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:57,519 INFO L225 Difference]: With dead ends: 786 [2018-11-18 12:15:57,519 INFO L226 Difference]: Without dead ends: 752 [2018-11-18 12:15:57,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-11-18 12:15:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 745. [2018-11-18 12:15:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-18 12:15:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 946 transitions. [2018-11-18 12:15:57,549 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 946 transitions. Word has length 69 [2018-11-18 12:15:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:57,549 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 946 transitions. [2018-11-18 12:15:57,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 946 transitions. [2018-11-18 12:15:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 12:15:57,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:57,550 INFO L375 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-11-18 12:15:57,550 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:57,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash -195334469, now seen corresponding path program 1 times [2018-11-18 12:15:57,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:57,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:57,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:15:57,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:57,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:15:57,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:15:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:57,616 INFO L87 Difference]: Start difference. First operand 745 states and 946 transitions. Second operand 6 states. [2018-11-18 12:15:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:57,675 INFO L93 Difference]: Finished difference Result 784 states and 987 transitions. [2018-11-18 12:15:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:15:57,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 12:15:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:57,676 INFO L225 Difference]: With dead ends: 784 [2018-11-18 12:15:57,677 INFO L226 Difference]: Without dead ends: 752 [2018-11-18 12:15:57,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:15:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-11-18 12:15:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 747. [2018-11-18 12:15:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-11-18 12:15:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 948 transitions. [2018-11-18 12:15:57,707 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 948 transitions. Word has length 69 [2018-11-18 12:15:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:57,707 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 948 transitions. [2018-11-18 12:15:57,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:15:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 948 transitions. [2018-11-18 12:15:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 12:15:57,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:57,708 INFO L375 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-11-18 12:15:57,708 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:57,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash -704807559, now seen corresponding path program 1 times [2018-11-18 12:15:57,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:57,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-11-18 12:15:57,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:57,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:15:57,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:57,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:15:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:15:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:57,796 INFO L87 Difference]: Start difference. First operand 747 states and 948 transitions. Second operand 11 states. [2018-11-18 12:15:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:57,877 INFO L93 Difference]: Finished difference Result 772 states and 975 transitions. [2018-11-18 12:15:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:15:57,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 12:15:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:57,878 INFO L225 Difference]: With dead ends: 772 [2018-11-18 12:15:57,878 INFO L226 Difference]: Without dead ends: 740 [2018-11-18 12:15:57,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-11-18 12:15:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2018-11-18 12:15:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-11-18 12:15:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 939 transitions. [2018-11-18 12:15:57,907 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 939 transitions. Word has length 69 [2018-11-18 12:15:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:57,908 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 939 transitions. [2018-11-18 12:15:57,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:15:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 939 transitions. [2018-11-18 12:15:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 12:15:57,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:57,908 INFO L375 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-11-18 12:15:57,909 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:57,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash -338104504, now seen corresponding path program 1 times [2018-11-18 12:15:57,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:57,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:57,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:57,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:15:57,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:57,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:15:57,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:15:57,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:57,947 INFO L87 Difference]: Start difference. First operand 740 states and 939 transitions. Second operand 6 states. [2018-11-18 12:15:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:58,007 INFO L93 Difference]: Finished difference Result 779 states and 980 transitions. [2018-11-18 12:15:58,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:15:58,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 12:15:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:58,008 INFO L225 Difference]: With dead ends: 779 [2018-11-18 12:15:58,008 INFO L226 Difference]: Without dead ends: 747 [2018-11-18 12:15:58,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:15:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-11-18 12:15:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 742. [2018-11-18 12:15:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-11-18 12:15:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 941 transitions. [2018-11-18 12:15:58,055 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 941 transitions. Word has length 69 [2018-11-18 12:15:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:58,055 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 941 transitions. [2018-11-18 12:15:58,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:15:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 941 transitions. [2018-11-18 12:15:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 12:15:58,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:58,056 INFO L375 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-11-18 12:15:58,056 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:58,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:58,056 INFO L82 PathProgramCache]: Analyzing trace with hash -847577594, now seen corresponding path program 1 times [2018-11-18 12:15:58,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:58,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:58,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:58,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:15:58,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:58,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:15:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:15:58,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:58,121 INFO L87 Difference]: Start difference. First operand 742 states and 941 transitions. Second operand 11 states. [2018-11-18 12:15:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:58,216 INFO L93 Difference]: Finished difference Result 767 states and 968 transitions. [2018-11-18 12:15:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:15:58,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 12:15:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:58,218 INFO L225 Difference]: With dead ends: 767 [2018-11-18 12:15:58,218 INFO L226 Difference]: Without dead ends: 737 [2018-11-18 12:15:58,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-18 12:15:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2018-11-18 12:15:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-18 12:15:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 934 transitions. [2018-11-18 12:15:58,267 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 934 transitions. Word has length 69 [2018-11-18 12:15:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:58,267 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 934 transitions. [2018-11-18 12:15:58,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:15:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 934 transitions. [2018-11-18 12:15:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 12:15:58,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:58,268 INFO L375 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-11-18 12:15:58,268 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:58,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1778230437, now seen corresponding path program 1 times [2018-11-18 12:15:58,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:58,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:58,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:15:58,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:58,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:15:58,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:15:58,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:15:58,357 INFO L87 Difference]: Start difference. First operand 737 states and 934 transitions. Second operand 11 states. [2018-11-18 12:15:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:58,468 INFO L93 Difference]: Finished difference Result 747 states and 943 transitions. [2018-11-18 12:15:58,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:15:58,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 12:15:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:58,469 INFO L225 Difference]: With dead ends: 747 [2018-11-18 12:15:58,469 INFO L226 Difference]: Without dead ends: 741 [2018-11-18 12:15:58,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-18 12:15:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 735. [2018-11-18 12:15:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-11-18 12:15:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 930 transitions. [2018-11-18 12:15:58,499 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 930 transitions. Word has length 69 [2018-11-18 12:15:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:58,499 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 930 transitions. [2018-11-18 12:15:58,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:15:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 930 transitions. [2018-11-18 12:15:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 12:15:58,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:58,500 INFO L375 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-11-18 12:15:58,500 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:58,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1778507267, now seen corresponding path program 1 times [2018-11-18 12:15:58,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:58,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:58,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:15:58,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:58,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:15:58,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:15:58,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:15:58,523 INFO L87 Difference]: Start difference. First operand 735 states and 930 transitions. Second operand 5 states. [2018-11-18 12:15:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:58,716 INFO L93 Difference]: Finished difference Result 793 states and 1006 transitions. [2018-11-18 12:15:58,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:15:58,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 12:15:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:58,718 INFO L225 Difference]: With dead ends: 793 [2018-11-18 12:15:58,718 INFO L226 Difference]: Without dead ends: 731 [2018-11-18 12:15:58,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:15:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-11-18 12:15:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 679. [2018-11-18 12:15:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-11-18 12:15:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 859 transitions. [2018-11-18 12:15:58,746 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 859 transitions. Word has length 69 [2018-11-18 12:15:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:58,746 INFO L480 AbstractCegarLoop]: Abstraction has 679 states and 859 transitions. [2018-11-18 12:15:58,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:15:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 859 transitions. [2018-11-18 12:15:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 12:15:58,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:58,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:58,747 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:58,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash 441145900, now seen corresponding path program 1 times [2018-11-18 12:15:58,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:58,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:58,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 12:15:58,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:58,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:15:58,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:15:58,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:15:58,836 INFO L87 Difference]: Start difference. First operand 679 states and 859 transitions. Second operand 12 states. [2018-11-18 12:15:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:58,957 INFO L93 Difference]: Finished difference Result 707 states and 891 transitions. [2018-11-18 12:15:58,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:15:58,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-18 12:15:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:58,959 INFO L225 Difference]: With dead ends: 707 [2018-11-18 12:15:58,959 INFO L226 Difference]: Without dead ends: 684 [2018-11-18 12:15:58,960 INFO L604 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-11-18 12:15:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-11-18 12:15:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2018-11-18 12:15:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2018-11-18 12:15:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 866 transitions. [2018-11-18 12:15:58,989 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 866 transitions. Word has length 70 [2018-11-18 12:15:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:58,990 INFO L480 AbstractCegarLoop]: Abstraction has 684 states and 866 transitions. [2018-11-18 12:15:58,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:15:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 866 transitions. [2018-11-18 12:15:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 12:15:58,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:58,991 INFO L375 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-11-18 12:15:58,991 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:58,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash 289758020, now seen corresponding path program 1 times [2018-11-18 12:15:58,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:58,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:58,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:58,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:59,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:59,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:15:59,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:59,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:15:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:15:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:15:59,054 INFO L87 Difference]: Start difference. First operand 684 states and 866 transitions. Second operand 7 states. [2018-11-18 12:15:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:59,132 INFO L93 Difference]: Finished difference Result 730 states and 913 transitions. [2018-11-18 12:15:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:15:59,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-18 12:15:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:59,135 INFO L225 Difference]: With dead ends: 730 [2018-11-18 12:15:59,135 INFO L226 Difference]: Without dead ends: 685 [2018-11-18 12:15:59,135 INFO L604 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-11-18 12:15:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-18 12:15:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 683. [2018-11-18 12:15:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-11-18 12:15:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 862 transitions. [2018-11-18 12:15:59,165 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 862 transitions. Word has length 74 [2018-11-18 12:15:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:59,165 INFO L480 AbstractCegarLoop]: Abstraction has 683 states and 862 transitions. [2018-11-18 12:15:59,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:15:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 862 transitions. [2018-11-18 12:15:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 12:15:59,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:59,166 INFO L375 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-11-18 12:15:59,167 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:59,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:59,167 INFO L82 PathProgramCache]: Analyzing trace with hash 991357894, now seen corresponding path program 1 times [2018-11-18 12:15:59,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:59,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:59,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:59,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:59,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:15:59,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:59,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:15:59,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:15:59,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:15:59,250 INFO L87 Difference]: Start difference. First operand 683 states and 862 transitions. Second operand 14 states. [2018-11-18 12:15:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:59,412 INFO L93 Difference]: Finished difference Result 705 states and 885 transitions. [2018-11-18 12:15:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:15:59,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-18 12:15:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:59,416 INFO L225 Difference]: With dead ends: 705 [2018-11-18 12:15:59,416 INFO L226 Difference]: Without dead ends: 673 [2018-11-18 12:15:59,416 INFO L604 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-11-18 12:15:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-11-18 12:15:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2018-11-18 12:15:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-11-18 12:15:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 847 transitions. [2018-11-18 12:15:59,467 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 847 transitions. Word has length 74 [2018-11-18 12:15:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:59,467 INFO L480 AbstractCegarLoop]: Abstraction has 673 states and 847 transitions. [2018-11-18 12:15:59,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:15:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 847 transitions. [2018-11-18 12:15:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 12:15:59,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:59,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:15:59,469 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:59,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:59,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1142745774, now seen corresponding path program 1 times [2018-11-18 12:15:59,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:59,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:59,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:59,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:59,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:59,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:59,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:15:59,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:59,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:15:59,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:15:59,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:15:59,564 INFO L87 Difference]: Start difference. First operand 673 states and 847 transitions. Second operand 14 states. [2018-11-18 12:15:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:59,677 INFO L93 Difference]: Finished difference Result 697 states and 873 transitions. [2018-11-18 12:15:59,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:15:59,677 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-18 12:15:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:59,679 INFO L225 Difference]: With dead ends: 697 [2018-11-18 12:15:59,679 INFO L226 Difference]: Without dead ends: 670 [2018-11-18 12:15:59,680 INFO L604 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-11-18 12:15:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-18 12:15:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-11-18 12:15:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-18 12:15:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 842 transitions. [2018-11-18 12:15:59,712 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 842 transitions. Word has length 70 [2018-11-18 12:15:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:59,712 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 842 transitions. [2018-11-18 12:15:59,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:15:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 842 transitions. [2018-11-18 12:15:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 12:15:59,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:59,714 INFO L375 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-11-18 12:15:59,714 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:59,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1242279399, now seen corresponding path program 1 times [2018-11-18 12:15:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:59,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:59,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:59,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:59,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:59,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:15:59,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 12:15:59,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:59,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:15:59,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:15:59,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:15:59,838 INFO L87 Difference]: Start difference. First operand 670 states and 842 transitions. Second operand 13 states. [2018-11-18 12:16:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:00,035 INFO L93 Difference]: Finished difference Result 687 states and 860 transitions. [2018-11-18 12:16:00,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:16:00,035 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-18 12:16:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:00,036 INFO L225 Difference]: With dead ends: 687 [2018-11-18 12:16:00,036 INFO L226 Difference]: Without dead ends: 658 [2018-11-18 12:16:00,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:16:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-11-18 12:16:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2018-11-18 12:16:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-18 12:16:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 826 transitions. [2018-11-18 12:16:00,063 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 826 transitions. Word has length 69 [2018-11-18 12:16:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:00,063 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 826 transitions. [2018-11-18 12:16:00,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:16:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 826 transitions. [2018-11-18 12:16:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 12:16:00,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:00,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:00,064 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:00,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1181847886, now seen corresponding path program 1 times [2018-11-18 12:16:00,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:00,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-11-18 12:16:00,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:00,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:16:00,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:16:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:16:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:16:00,157 INFO L87 Difference]: Start difference. First operand 658 states and 826 transitions. Second operand 14 states. [2018-11-18 12:16:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:00,275 INFO L93 Difference]: Finished difference Result 722 states and 894 transitions. [2018-11-18 12:16:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:16:00,275 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 12:16:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:00,276 INFO L225 Difference]: With dead ends: 722 [2018-11-18 12:16:00,276 INFO L226 Difference]: Without dead ends: 651 [2018-11-18 12:16:00,276 INFO L604 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-11-18 12:16:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-11-18 12:16:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2018-11-18 12:16:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-18 12:16:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 815 transitions. [2018-11-18 12:16:00,309 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 815 transitions. Word has length 71 [2018-11-18 12:16:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:00,309 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 815 transitions. [2018-11-18 12:16:00,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:16:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 815 transitions. [2018-11-18 12:16:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 12:16:00,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:00,310 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:00,310 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:00,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash -912563853, now seen corresponding path program 1 times [2018-11-18 12:16:00,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:00,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:00,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:00,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-11-18 12:16:00,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:00,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:16:00,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:00,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:16:00,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:16:00,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:16:00,433 INFO L87 Difference]: Start difference. First operand 651 states and 815 transitions. Second operand 14 states. [2018-11-18 12:16:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:00,596 INFO L93 Difference]: Finished difference Result 715 states and 883 transitions. [2018-11-18 12:16:00,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:16:00,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 12:16:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:00,598 INFO L225 Difference]: With dead ends: 715 [2018-11-18 12:16:00,598 INFO L226 Difference]: Without dead ends: 645 [2018-11-18 12:16:00,599 INFO L604 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-11-18 12:16:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-11-18 12:16:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2018-11-18 12:16:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-11-18 12:16:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 806 transitions. [2018-11-18 12:16:00,642 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 806 transitions. Word has length 71 [2018-11-18 12:16:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:00,643 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 806 transitions. [2018-11-18 12:16:00,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:16:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 806 transitions. [2018-11-18 12:16:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 12:16:00,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:00,644 INFO L375 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-11-18 12:16:00,644 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:00,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1679420721, now seen corresponding path program 1 times [2018-11-18 12:16:00,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:00,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:00,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:16:00,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:00,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:16:00,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:16:00,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:16:00,713 INFO L87 Difference]: Start difference. First operand 645 states and 806 transitions. Second operand 11 states. [2018-11-18 12:16:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:00,813 INFO L93 Difference]: Finished difference Result 672 states and 836 transitions. [2018-11-18 12:16:00,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:16:00,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-18 12:16:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:00,814 INFO L225 Difference]: With dead ends: 672 [2018-11-18 12:16:00,814 INFO L226 Difference]: Without dead ends: 627 [2018-11-18 12:16:00,815 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:16:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-18 12:16:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-11-18 12:16:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-18 12:16:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 778 transitions. [2018-11-18 12:16:00,842 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 778 transitions. Word has length 72 [2018-11-18 12:16:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:00,842 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 778 transitions. [2018-11-18 12:16:00,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:16:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 778 transitions. [2018-11-18 12:16:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 12:16:00,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:00,843 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:00,843 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:00,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:00,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1765380645, now seen corresponding path program 1 times [2018-11-18 12:16:00,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:00,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:00,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:00,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:00,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:16:00,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:00,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:16:00,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:16:00,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:00,881 INFO L87 Difference]: Start difference. First operand 627 states and 778 transitions. Second operand 6 states. [2018-11-18 12:16:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:00,931 INFO L93 Difference]: Finished difference Result 668 states and 822 transitions. [2018-11-18 12:16:00,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:16:00,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-18 12:16:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:00,932 INFO L225 Difference]: With dead ends: 668 [2018-11-18 12:16:00,932 INFO L226 Difference]: Without dead ends: 632 [2018-11-18 12:16:00,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:16:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-11-18 12:16:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 627. [2018-11-18 12:16:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-18 12:16:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 776 transitions. [2018-11-18 12:16:00,960 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 776 transitions. Word has length 71 [2018-11-18 12:16:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:00,961 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 776 transitions. [2018-11-18 12:16:00,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:16:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 776 transitions. [2018-11-18 12:16:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 12:16:00,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:00,962 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:00,962 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:00,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2020113561, now seen corresponding path program 1 times [2018-11-18 12:16:00,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:00,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16: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-11-18 12:16:01,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:01,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:16:01,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:01,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:16:01,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:16:01,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:16:01,039 INFO L87 Difference]: Start difference. First operand 627 states and 776 transitions. Second operand 11 states. [2018-11-18 12:16:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:01,111 INFO L93 Difference]: Finished difference Result 652 states and 803 transitions. [2018-11-18 12:16:01,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:16:01,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-18 12:16:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:01,113 INFO L225 Difference]: With dead ends: 652 [2018-11-18 12:16:01,113 INFO L226 Difference]: Without dead ends: 619 [2018-11-18 12:16:01,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:16:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-18 12:16:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2018-11-18 12:16:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-11-18 12:16:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 765 transitions. [2018-11-18 12:16:01,140 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 765 transitions. Word has length 71 [2018-11-18 12:16:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:01,141 INFO L480 AbstractCegarLoop]: Abstraction has 619 states and 765 transitions. [2018-11-18 12:16:01,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:16:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 765 transitions. [2018-11-18 12:16:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 12:16:01,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:01,142 INFO L375 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-11-18 12:16:01,142 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:01,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash -188897816, now seen corresponding path program 1 times [2018-11-18 12:16:01,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:01,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:01,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:16:01,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:01,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:16:01,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:16:01,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:16:01,189 INFO L87 Difference]: Start difference. First operand 619 states and 765 transitions. Second operand 7 states. [2018-11-18 12:16:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:01,247 INFO L93 Difference]: Finished difference Result 673 states and 826 transitions. [2018-11-18 12:16:01,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:16:01,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-18 12:16:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:01,248 INFO L225 Difference]: With dead ends: 673 [2018-11-18 12:16:01,248 INFO L226 Difference]: Without dead ends: 617 [2018-11-18 12:16:01,249 INFO L604 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-11-18 12:16:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-18 12:16:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2018-11-18 12:16:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-18 12:16:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 755 transitions. [2018-11-18 12:16:01,274 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 755 transitions. Word has length 77 [2018-11-18 12:16:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:01,274 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 755 transitions. [2018-11-18 12:16:01,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:16:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 755 transitions. [2018-11-18 12:16:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 12:16:01,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:01,275 INFO L375 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-11-18 12:16:01,275 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:01,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:01,275 INFO L82 PathProgramCache]: Analyzing trace with hash 512702058, now seen corresponding path program 1 times [2018-11-18 12:16:01,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:01,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:01,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:01,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:01,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:16:01,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:01,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:16:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:16:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:16:01,346 INFO L87 Difference]: Start difference. First operand 613 states and 755 transitions. Second operand 14 states. [2018-11-18 12:16:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:01,448 INFO L93 Difference]: Finished difference Result 639 states and 783 transitions. [2018-11-18 12:16:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:16:01,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-18 12:16:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:01,449 INFO L225 Difference]: With dead ends: 639 [2018-11-18 12:16:01,449 INFO L226 Difference]: Without dead ends: 615 [2018-11-18 12:16:01,449 INFO L604 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-11-18 12:16:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-18 12:16:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2018-11-18 12:16:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-11-18 12:16:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 751 transitions. [2018-11-18 12:16:01,474 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 751 transitions. Word has length 77 [2018-11-18 12:16:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:01,475 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 751 transitions. [2018-11-18 12:16:01,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:16:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 751 transitions. [2018-11-18 12:16:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 12:16:01,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:01,475 INFO L375 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-11-18 12:16:01,475 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:01,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1032362721, now seen corresponding path program 1 times [2018-11-18 12:16:01,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:01,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:01,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:01,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:01,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:16:01,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:01,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:16:01,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:16:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:16:01,562 INFO L87 Difference]: Start difference. First operand 611 states and 751 transitions. Second operand 14 states. [2018-11-18 12:16:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:01,675 INFO L93 Difference]: Finished difference Result 670 states and 813 transitions. [2018-11-18 12:16:01,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:16:01,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-18 12:16:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:01,676 INFO L225 Difference]: With dead ends: 670 [2018-11-18 12:16:01,677 INFO L226 Difference]: Without dead ends: 599 [2018-11-18 12:16:01,677 INFO L604 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-11-18 12:16:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-11-18 12:16:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2018-11-18 12:16:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-11-18 12:16:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 732 transitions. [2018-11-18 12:16:01,718 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 732 transitions. Word has length 72 [2018-11-18 12:16:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:01,718 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 732 transitions. [2018-11-18 12:16:01,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:16:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 732 transitions. [2018-11-18 12:16:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 12:16:01,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:01,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:01,719 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:01,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:01,719 INFO L82 PathProgramCache]: Analyzing trace with hash 772709398, now seen corresponding path program 1 times [2018-11-18 12:16:01,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:01,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:01,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:01,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:01,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 12:16:01,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:01,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:16:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:16:01,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:16:01,813 INFO L87 Difference]: Start difference. First operand 599 states and 732 transitions. Second operand 13 states. [2018-11-18 12:16:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:01,947 INFO L93 Difference]: Finished difference Result 619 states and 753 transitions. [2018-11-18 12:16:01,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:16:01,947 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-18 12:16:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:01,948 INFO L225 Difference]: With dead ends: 619 [2018-11-18 12:16:01,948 INFO L226 Difference]: Without dead ends: 594 [2018-11-18 12:16:01,948 INFO L604 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-11-18 12:16:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-18 12:16:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2018-11-18 12:16:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-18 12:16:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 724 transitions. [2018-11-18 12:16:01,975 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 724 transitions. Word has length 79 [2018-11-18 12:16:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:01,975 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 724 transitions. [2018-11-18 12:16:01,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:16:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 724 transitions. [2018-11-18 12:16:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 12:16:01,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:01,976 INFO L375 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-11-18 12:16:01,976 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:01,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:01,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1597492846, now seen corresponding path program 1 times [2018-11-18 12:16:01,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:01,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:01,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:02,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:02,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 12:16:02,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:02,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:16:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:16:02,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:16:02,062 INFO L87 Difference]: Start difference. First operand 594 states and 724 transitions. Second operand 13 states. [2018-11-18 12:16:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:02,194 INFO L93 Difference]: Finished difference Result 596 states and 725 transitions. [2018-11-18 12:16:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:16:02,195 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-18 12:16:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:02,195 INFO L225 Difference]: With dead ends: 596 [2018-11-18 12:16:02,195 INFO L226 Difference]: Without dead ends: 541 [2018-11-18 12:16:02,196 INFO L604 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-11-18 12:16:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-11-18 12:16:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2018-11-18 12:16:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-11-18 12:16:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 666 transitions. [2018-11-18 12:16:02,218 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 666 transitions. Word has length 72 [2018-11-18 12:16:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:02,219 INFO L480 AbstractCegarLoop]: Abstraction has 541 states and 666 transitions. [2018-11-18 12:16:02,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:16:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 666 transitions. [2018-11-18 12:16:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 12:16:02,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:02,219 INFO L375 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-11-18 12:16:02,219 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:02,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 806990906, now seen corresponding path program 1 times [2018-11-18 12:16:02,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:02,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:02,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:02,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:02,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:02,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:02,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 12:16:02,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:02,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:16:02,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:16:02,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:16:02,262 INFO L87 Difference]: Start difference. First operand 541 states and 666 transitions. Second operand 10 states. [2018-11-18 12:16:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:03,018 INFO L93 Difference]: Finished difference Result 1067 states and 1316 transitions. [2018-11-18 12:16:03,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 12:16:03,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-18 12:16:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:03,021 INFO L225 Difference]: With dead ends: 1067 [2018-11-18 12:16:03,021 INFO L226 Difference]: Without dead ends: 922 [2018-11-18 12:16:03,021 INFO L604 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-11-18 12:16:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2018-11-18 12:16:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 852. [2018-11-18 12:16:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-11-18 12:16:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1073 transitions. [2018-11-18 12:16:03,061 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1073 transitions. Word has length 73 [2018-11-18 12:16:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:03,061 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1073 transitions. [2018-11-18 12:16:03,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:16:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1073 transitions. [2018-11-18 12:16:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 12:16:03,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:03,062 INFO L375 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-11-18 12:16:03,062 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:03,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1486263160, now seen corresponding path program 1 times [2018-11-18 12:16:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:03,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:03,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:16:03,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:03,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:16:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:16:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:03,103 INFO L87 Difference]: Start difference. First operand 852 states and 1073 transitions. Second operand 6 states. [2018-11-18 12:16:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:03,423 INFO L93 Difference]: Finished difference Result 1069 states and 1313 transitions. [2018-11-18 12:16:03,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:16:03,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-18 12:16:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:03,424 INFO L225 Difference]: With dead ends: 1069 [2018-11-18 12:16:03,424 INFO L226 Difference]: Without dead ends: 964 [2018-11-18 12:16:03,425 INFO L604 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-11-18 12:16:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-11-18 12:16:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 920. [2018-11-18 12:16:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2018-11-18 12:16:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1149 transitions. [2018-11-18 12:16:03,469 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1149 transitions. Word has length 73 [2018-11-18 12:16:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:03,469 INFO L480 AbstractCegarLoop]: Abstraction has 920 states and 1149 transitions. [2018-11-18 12:16:03,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:16:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1149 transitions. [2018-11-18 12:16:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 12:16:03,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:03,470 INFO L375 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-11-18 12:16:03,470 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:03,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1012469071, now seen corresponding path program 1 times [2018-11-18 12:16:03,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:03,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:03,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:03,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-11-18 12:16:03,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:03,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:16:03,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:03,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:16:03,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:16:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:03,554 INFO L87 Difference]: Start difference. First operand 920 states and 1149 transitions. Second operand 6 states. [2018-11-18 12:16:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:03,682 INFO L93 Difference]: Finished difference Result 1198 states and 1509 transitions. [2018-11-18 12:16:03,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:16:03,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-18 12:16:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:03,685 INFO L225 Difference]: With dead ends: 1198 [2018-11-18 12:16:03,685 INFO L226 Difference]: Without dead ends: 906 [2018-11-18 12:16:03,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:16:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-18 12:16:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2018-11-18 12:16:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-18 12:16:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1127 transitions. [2018-11-18 12:16:03,769 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1127 transitions. Word has length 77 [2018-11-18 12:16:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:03,769 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1127 transitions. [2018-11-18 12:16:03,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:16:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1127 transitions. [2018-11-18 12:16:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 12:16:03,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:03,771 INFO L375 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-11-18 12:16:03,771 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:03,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:03,771 INFO L82 PathProgramCache]: Analyzing trace with hash 774162684, now seen corresponding path program 1 times [2018-11-18 12:16:03,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:16:03,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:03,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:16:03,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:03,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:16:03,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:16:03,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:16:03,801 INFO L87 Difference]: Start difference. First operand 906 states and 1127 transitions. Second operand 5 states. [2018-11-18 12:16:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:03,860 INFO L93 Difference]: Finished difference Result 951 states and 1175 transitions. [2018-11-18 12:16:03,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:16:03,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-18 12:16:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:03,862 INFO L225 Difference]: With dead ends: 951 [2018-11-18 12:16:03,862 INFO L226 Difference]: Without dead ends: 906 [2018-11-18 12:16:03,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:16:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-18 12:16:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2018-11-18 12:16:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-18 12:16:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1125 transitions. [2018-11-18 12:16:03,935 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1125 transitions. Word has length 75 [2018-11-18 12:16:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:03,935 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1125 transitions. [2018-11-18 12:16:03,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:16:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1125 transitions. [2018-11-18 12:16:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 12:16:03,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:03,936 INFO L375 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-11-18 12:16:03,936 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:03,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 796794938, now seen corresponding path program 1 times [2018-11-18 12:16:03,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:16:04,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:04,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:16:04,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:04,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:16:04,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:16:04,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:04,013 INFO L87 Difference]: Start difference. First operand 906 states and 1125 transitions. Second operand 6 states. [2018-11-18 12:16:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:04,071 INFO L93 Difference]: Finished difference Result 947 states and 1167 transitions. [2018-11-18 12:16:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:16:04,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-18 12:16:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:04,072 INFO L225 Difference]: With dead ends: 947 [2018-11-18 12:16:04,073 INFO L226 Difference]: Without dead ends: 906 [2018-11-18 12:16:04,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:16:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-18 12:16:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2018-11-18 12:16:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-18 12:16:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1123 transitions. [2018-11-18 12:16:04,118 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1123 transitions. Word has length 75 [2018-11-18 12:16:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:04,118 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1123 transitions. [2018-11-18 12:16:04,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:16:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1123 transitions. [2018-11-18 12:16:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 12:16:04,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:04,119 INFO L375 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-11-18 12:16:04,119 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:04,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash 287321848, now seen corresponding path program 1 times [2018-11-18 12:16:04,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:04,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:04,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:16:04,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:04,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:16:04,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:04,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:16:04,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:16:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:16:04,180 INFO L87 Difference]: Start difference. First operand 906 states and 1123 transitions. Second operand 11 states. [2018-11-18 12:16:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:04,271 INFO L93 Difference]: Finished difference Result 928 states and 1146 transitions. [2018-11-18 12:16:04,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:16:04,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-18 12:16:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:04,272 INFO L225 Difference]: With dead ends: 928 [2018-11-18 12:16:04,273 INFO L226 Difference]: Without dead ends: 859 [2018-11-18 12:16:04,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:16:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-11-18 12:16:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 853. [2018-11-18 12:16:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-11-18 12:16:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1060 transitions. [2018-11-18 12:16:04,315 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1060 transitions. Word has length 75 [2018-11-18 12:16:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:04,315 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1060 transitions. [2018-11-18 12:16:04,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:16:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1060 transitions. [2018-11-18 12:16:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 12:16:04,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:04,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:04,316 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:04,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:04,316 INFO L82 PathProgramCache]: Analyzing trace with hash 84992920, now seen corresponding path program 1 times [2018-11-18 12:16:04,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:04,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:04,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:04,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:04,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:16:04,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:04,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:16:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:16:04,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:16:04,360 INFO L87 Difference]: Start difference. First operand 853 states and 1060 transitions. Second operand 5 states. [2018-11-18 12:16:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:04,494 INFO L93 Difference]: Finished difference Result 1099 states and 1382 transitions. [2018-11-18 12:16:04,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:16:04,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-18 12:16:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:04,496 INFO L225 Difference]: With dead ends: 1099 [2018-11-18 12:16:04,496 INFO L226 Difference]: Without dead ends: 821 [2018-11-18 12:16:04,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:16:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-11-18 12:16:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2018-11-18 12:16:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-18 12:16:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1020 transitions. [2018-11-18 12:16:04,535 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1020 transitions. Word has length 81 [2018-11-18 12:16:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:04,535 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1020 transitions. [2018-11-18 12:16:04,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:16:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1020 transitions. [2018-11-18 12:16:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 12:16:04,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:04,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:04,536 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:04,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:04,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1129636383, now seen corresponding path program 1 times [2018-11-18 12:16:04,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:04,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:04,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:04,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:04,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:04,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:04,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 12:16:04,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:04,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:16:04,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:16:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:16:04,582 INFO L87 Difference]: Start difference. First operand 821 states and 1020 transitions. Second operand 10 states. [2018-11-18 12:16:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:05,276 INFO L93 Difference]: Finished difference Result 871 states and 1069 transitions. [2018-11-18 12:16:05,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:16:05,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-18 12:16:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:05,278 INFO L225 Difference]: With dead ends: 871 [2018-11-18 12:16:05,278 INFO L226 Difference]: Without dead ends: 737 [2018-11-18 12:16:05,278 INFO L604 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-11-18 12:16:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-18 12:16:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 370. [2018-11-18 12:16:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 12:16:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 460 transitions. [2018-11-18 12:16:05,302 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 460 transitions. Word has length 78 [2018-11-18 12:16:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:05,302 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 460 transitions. [2018-11-18 12:16:05,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:16:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 460 transitions. [2018-11-18 12:16:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:16:05,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:05,303 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:05,303 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:05,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1264149450, now seen corresponding path program 1 times [2018-11-18 12:16:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:05,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:05,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:16:05,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:05,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:05,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:05,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:16:05,335 INFO L87 Difference]: Start difference. First operand 370 states and 460 transitions. Second operand 3 states. [2018-11-18 12:16:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:05,362 INFO L93 Difference]: Finished difference Result 413 states and 505 transitions. [2018-11-18 12:16:05,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:05,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-18 12:16:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:05,363 INFO L225 Difference]: With dead ends: 413 [2018-11-18 12:16:05,363 INFO L226 Difference]: Without dead ends: 375 [2018-11-18 12:16:05,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:16:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-18 12:16:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2018-11-18 12:16:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 12:16:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 461 transitions. [2018-11-18 12:16:05,390 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 461 transitions. Word has length 80 [2018-11-18 12:16:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:05,391 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 461 transitions. [2018-11-18 12:16:05,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 461 transitions. [2018-11-18 12:16:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:16:05,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:05,391 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:05,391 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:05,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash -979833848, now seen corresponding path program 1 times [2018-11-18 12:16:05,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:05,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:05,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 12:16:05,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:05,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:16:05,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:16:05,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:16:05,470 INFO L87 Difference]: Start difference. First operand 371 states and 461 transitions. Second operand 14 states. [2018-11-18 12:16:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:05,557 INFO L93 Difference]: Finished difference Result 386 states and 477 transitions. [2018-11-18 12:16:05,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:16:05,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-18 12:16:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:05,558 INFO L225 Difference]: With dead ends: 386 [2018-11-18 12:16:05,558 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 12:16:05,558 INFO L604 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-11-18 12:16:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 12:16:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-11-18 12:16:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-18 12:16:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 391 transitions. [2018-11-18 12:16:05,578 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 391 transitions. Word has length 80 [2018-11-18 12:16:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:05,579 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 391 transitions. [2018-11-18 12:16:05,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:16:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 391 transitions. [2018-11-18 12:16:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 12:16:05,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:05,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:05,580 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:05,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash -483712077, now seen corresponding path program 1 times [2018-11-18 12:16:05,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:05,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:05,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:05,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:05,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:16:05,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:05,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:16:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:16:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:05,615 INFO L87 Difference]: Start difference. First operand 313 states and 391 transitions. Second operand 6 states. [2018-11-18 12:16:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:05,744 INFO L93 Difference]: Finished difference Result 449 states and 550 transitions. [2018-11-18 12:16:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:16:05,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-18 12:16:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:05,745 INFO L225 Difference]: With dead ends: 449 [2018-11-18 12:16:05,745 INFO L226 Difference]: Without dead ends: 305 [2018-11-18 12:16:05,745 INFO L604 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-11-18 12:16:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-18 12:16:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 258. [2018-11-18 12:16:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-18 12:16:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 302 transitions. [2018-11-18 12:16:05,761 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 302 transitions. Word has length 83 [2018-11-18 12:16:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:05,761 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 302 transitions. [2018-11-18 12:16:05,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:16:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 302 transitions. [2018-11-18 12:16:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 12:16:05,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:05,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:05,762 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:05,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:05,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1209726040, now seen corresponding path program 1 times [2018-11-18 12:16:05,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:05,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:05,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:05,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:05,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 12:16:05,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:05,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:16:05,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:16:05,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:16:05,851 INFO L87 Difference]: Start difference. First operand 258 states and 302 transitions. Second operand 13 states. [2018-11-18 12:16:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:06,296 INFO L93 Difference]: Finished difference Result 290 states and 339 transitions. [2018-11-18 12:16:06,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:16:06,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-18 12:16:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:06,297 INFO L225 Difference]: With dead ends: 290 [2018-11-18 12:16:06,297 INFO L226 Difference]: Without dead ends: 267 [2018-11-18 12:16:06,297 INFO L604 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-11-18 12:16:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-18 12:16:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 258. [2018-11-18 12:16:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-18 12:16:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 301 transitions. [2018-11-18 12:16:06,313 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 301 transitions. Word has length 99 [2018-11-18 12:16:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:06,313 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 301 transitions. [2018-11-18 12:16:06,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:16:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 301 transitions. [2018-11-18 12:16:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 12:16:06,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:06,314 INFO L375 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-11-18 12:16:06,314 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:06,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:06,314 INFO L82 PathProgramCache]: Analyzing trace with hash 802283324, now seen corresponding path program 1 times [2018-11-18 12:16:06,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:06,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:06,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:06,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:06,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:16:06,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:06,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:06,336 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-11-18 12:16:06,337 INFO L202 CegarAbsIntRunner]: [21], [22], [96], [100], [103], [111], [116], [119], [133], [146], [161], [173], [177], [180], [183], [186], [192], [202], [205], [208], [235], [240], [350], [353], [356], [361], [365], [375], [378], [383], [386], [411], [414], [419], [463], [464], [465], [466], [467], [472], [475], [489], [491], [501], [505], [510], [533], [536], [541], [543], [549], [550], [552], [553], [554], [794], [797], [804], [807], [809], [813], [816], [826], [853], [856], [859], [872], [873], [886], [887], [1315], [1321], [1327], [1329], [1331], [1334], [1336], [1340], [1341], [1364], [1365], [1366], [1367], [1370], [1371], [1378], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1427], [1430], [1431], [1468], [1469], [1470], [1471], [1496], [1497], [1498], [1554], [1555], [1556], [1557] [2018-11-18 12:16:06,363 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:06,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:06,527 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:16:06,528 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-11-18 12:16:06,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:06,554 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:16:06,670 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 75.08% of their original sizes. [2018-11-18 12:16:06,670 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:16:06,735 INFO L415 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-11-18 12:16:06,735 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:16:06,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:16:06,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 12:16:06,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:06,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:16:06,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:16:06,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:16:06,737 INFO L87 Difference]: Start difference. First operand 258 states and 301 transitions. Second operand 10 states. [2018-11-18 12:16:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:08,469 INFO L93 Difference]: Finished difference Result 652 states and 767 transitions. [2018-11-18 12:16:08,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:16:08,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-11-18 12:16:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:08,470 INFO L225 Difference]: With dead ends: 652 [2018-11-18 12:16:08,471 INFO L226 Difference]: Without dead ends: 487 [2018-11-18 12:16:08,471 INFO L604 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-11-18 12:16:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-11-18 12:16:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 467. [2018-11-18 12:16:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-11-18 12:16:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions. [2018-11-18 12:16:08,505 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 114 [2018-11-18 12:16:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:08,506 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions. [2018-11-18 12:16:08,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:16:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions. [2018-11-18 12:16:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 12:16:08,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:08,507 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:08,507 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:08,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash -398118782, now seen corresponding path program 1 times [2018-11-18 12:16:08,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:08,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:08,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:08,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-11-18 12:16:08,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:08,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:16:08,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:08,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:16:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:16:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:16:08,555 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 8 states. [2018-11-18 12:16:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:08,621 INFO L93 Difference]: Finished difference Result 485 states and 566 transitions. [2018-11-18 12:16:08,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:16:08,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-18 12:16:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:08,623 INFO L225 Difference]: With dead ends: 485 [2018-11-18 12:16:08,623 INFO L226 Difference]: Without dead ends: 349 [2018-11-18 12:16:08,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:16:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-18 12:16:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-11-18 12:16:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-18 12:16:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 381 transitions. [2018-11-18 12:16:08,647 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 381 transitions. Word has length 101 [2018-11-18 12:16:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:08,647 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 381 transitions. [2018-11-18 12:16:08,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:16:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 381 transitions. [2018-11-18 12:16:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 12:16:08,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:08,648 INFO L375 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-11-18 12:16:08,648 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:08,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1231110722, now seen corresponding path program 1 times [2018-11-18 12:16:08,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:08,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:08,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:16:08,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:08,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:08,697 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-11-18 12:16:08,697 INFO L202 CegarAbsIntRunner]: [21], [22], [96], [100], [105], [111], [116], [119], [133], [146], [161], [173], [177], [180], [183], [186], [192], [202], [205], [208], [235], [240], [350], [353], [356], [361], [365], [375], [378], [383], [386], [411], [414], [419], [463], [464], [465], [466], [467], [472], [475], [489], [491], [501], [505], [510], [533], [536], [541], [543], [549], [550], [552], [553], [554], [794], [797], [804], [807], [809], [813], [816], [826], [853], [856], [859], [872], [873], [886], [887], [1315], [1321], [1327], [1329], [1331], [1334], [1336], [1340], [1341], [1364], [1365], [1366], [1367], [1370], [1371], [1378], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1427], [1430], [1431], [1468], [1469], [1470], [1471], [1496], [1497], [1498], [1554], [1555], [1556], [1557] [2018-11-18 12:16:08,701 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:08,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:08,730 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:16:08,731 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-11-18 12:16:08,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:08,734 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:16:08,778 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 74.99% of their original sizes. [2018-11-18 12:16:08,778 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:16:08,817 INFO L415 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-11-18 12:16:08,818 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:16:08,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:16:08,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 12:16:08,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:08,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:16:08,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:16:08,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:16:08,818 INFO L87 Difference]: Start difference. First operand 335 states and 381 transitions. Second operand 10 states. [2018-11-18 12:16:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:09,482 INFO L93 Difference]: Finished difference Result 425 states and 483 transitions. [2018-11-18 12:16:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:16:09,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-11-18 12:16:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:09,483 INFO L225 Difference]: With dead ends: 425 [2018-11-18 12:16:09,483 INFO L226 Difference]: Without dead ends: 296 [2018-11-18 12:16:09,483 INFO L604 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-11-18 12:16:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-18 12:16:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 147. [2018-11-18 12:16:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 12:16:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-11-18 12:16:09,498 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 114 [2018-11-18 12:16:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:09,498 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-11-18 12:16:09,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:16:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-11-18 12:16:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 12:16:09,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:09,499 INFO L375 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-11-18 12:16:09,499 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:09,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1503601113, now seen corresponding path program 1 times [2018-11-18 12:16:09,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:09,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:09,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 12:16:09,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:09,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:16:09,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:09,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:16:09,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:16:09,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:16:09,573 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 11 states. [2018-11-18 12:16:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:09,853 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-11-18 12:16:09,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:16:09,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-11-18 12:16:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:09,855 INFO L225 Difference]: With dead ends: 169 [2018-11-18 12:16:09,855 INFO L226 Difference]: Without dead ends: 146 [2018-11-18 12:16:09,855 INFO L604 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-11-18 12:16:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-18 12:16:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-18 12:16:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 12:16:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-11-18 12:16:09,870 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-11-18 12:16:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:09,870 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-11-18 12:16:09,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:16:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-11-18 12:16:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 12:16:09,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:09,871 INFO L375 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-11-18 12:16:09,871 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:09,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash 44602583, now seen corresponding path program 1 times [2018-11-18 12:16:09,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:09,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:09,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:09,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:09,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 12:16:09,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:09,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:16:09,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:09,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:16:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:16:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:16:09,935 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-11-18 12:16:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:10,249 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-11-18 12:16:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 12:16:10,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-11-18 12:16:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:10,251 INFO L225 Difference]: With dead ends: 280 [2018-11-18 12:16:10,251 INFO L226 Difference]: Without dead ends: 146 [2018-11-18 12:16:10,251 INFO L604 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-11-18 12:16:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-18 12:16:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-18 12:16:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 12:16:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-11-18 12:16:10,266 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-11-18 12:16:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:10,266 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-11-18 12:16:10,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:16:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-11-18 12:16:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 12:16:10,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:10,267 INFO L375 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-11-18 12:16:10,267 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:10,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash 163044057, now seen corresponding path program 1 times [2018-11-18 12:16:10,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:10,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:10,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 12:16:10,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:10,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:16:10,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:10,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:16:10,304 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-11-18 12:16:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:10,340 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-11-18 12:16:10,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:10,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-18 12:16:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:10,341 INFO L225 Difference]: With dead ends: 192 [2018-11-18 12:16:10,341 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 12:16:10,341 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:16:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 12:16:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-18 12:16:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 12:16:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-11-18 12:16:10,363 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-11-18 12:16:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:10,363 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-11-18 12:16:10,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-11-18 12:16:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 12:16:10,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:10,364 INFO L375 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-11-18 12:16:10,364 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:10,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:10,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1296949864, now seen corresponding path program 1 times [2018-11-18 12:16:10,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:10,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 12:16:10,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:10,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:16:10,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:10,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:10,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:16:10,389 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 3 states. [2018-11-18 12:16:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:10,411 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-11-18 12:16:10,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:10,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-18 12:16:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:10,412 INFO L225 Difference]: With dead ends: 191 [2018-11-18 12:16:10,412 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 12:16:10,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:16:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 12:16:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-18 12:16:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 12:16:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-11-18 12:16:10,427 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 116 [2018-11-18 12:16:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:10,428 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-11-18 12:16:10,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-11-18 12:16:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 12:16:10,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:10,428 INFO L375 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-11-18 12:16:10,429 INFO L423 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:10,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1549247451, now seen corresponding path program 1 times [2018-11-18 12:16:10,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:10,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:10,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 12:16:10,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:10,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:16:10,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:10,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:16:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:16:10,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:16:10,484 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 11 states. [2018-11-18 12:16:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:10,720 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-11-18 12:16:10,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:16:10,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-11-18 12:16:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:10,721 INFO L225 Difference]: With dead ends: 152 [2018-11-18 12:16:10,721 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 12:16:10,721 INFO L604 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-11-18 12:16:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 12:16:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 12:16:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 12:16:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 12:16:10,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-11-18 12:16:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:10,721 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:16:10,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:16:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:16:10,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 12:16:10,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 12:16:10,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:10,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:11,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:12,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:16:13,210 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 1 [2018-11-18 12:16:13,526 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 65 [2018-11-18 12:16:14,032 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 95 [2018-11-18 12:16:14,237 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2018-11-18 12:16:14,550 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-11-18 12:16:14,880 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2018-11-18 12:16:15,544 WARN L180 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-11-18 12:16:15,841 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 59 [2018-11-18 12:16:16,379 WARN L180 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 119 [2018-11-18 12:16:16,609 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 88 [2018-11-18 12:16:16,744 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-11-18 12:16:17,102 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 94 [2018-11-18 12:16:17,410 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 94 [2018-11-18 12:16:18,413 WARN L180 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 138 [2018-11-18 12:16:18,593 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-11-18 12:16:18,946 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 94 [2018-11-18 12:16:19,094 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2018-11-18 12:16:19,580 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-11-18 12:16:20,706 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 241 DAG size of output: 141 [2018-11-18 12:16:21,031 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 99 [2018-11-18 12:16:21,568 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 125 [2018-11-18 12:16:21,747 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 61 [2018-11-18 12:16:22,010 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 99 [2018-11-18 12:16:22,266 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 97 [2018-11-18 12:16:22,422 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 69 [2018-11-18 12:16:23,099 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2018-11-18 12:16:23,380 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 94 [2018-11-18 12:16:23,843 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-11-18 12:16:24,474 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 97 [2018-11-18 12:16:24,696 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 96 [2018-11-18 12:16:24,998 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-11-18 12:16:25,355 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-11-18 12:16:25,483 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-18 12:16:25,813 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2018-11-18 12:16:26,483 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 98 [2018-11-18 12:16:26,738 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 97 [2018-11-18 12:16:27,212 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 102 [2018-11-18 12:16:27,392 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 1 [2018-11-18 12:16:27,748 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 103 [2018-11-18 12:16:28,298 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2018-11-18 12:16:28,509 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2018-11-18 12:16:29,369 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-11-18 12:16:29,497 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-18 12:16:30,630 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 241 DAG size of output: 141 [2018-11-18 12:16:30,937 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-18 12:16:31,388 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 94 [2018-11-18 12:16:31,714 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 56 [2018-11-18 12:16:32,161 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2018-11-18 12:16:32,406 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 94 [2018-11-18 12:16:32,588 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 70 [2018-11-18 12:16:32,992 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 95 [2018-11-18 12:16:33,304 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 86 [2018-11-18 12:16:33,619 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 110 [2018-11-18 12:16:33,891 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2018-11-18 12:16:34,591 WARN L180 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 137 [2018-11-18 12:16:34,898 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 86 [2018-11-18 12:16:35,372 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 101 [2018-11-18 12:16:35,627 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2018-11-18 12:16:36,028 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2018-11-18 12:16:36,257 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 80 [2018-11-18 12:16:36,764 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2018-11-18 12:16:37,129 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 94 [2018-11-18 12:16:37,302 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-11-18 12:16:37,798 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-18 12:16:38,229 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 62 [2018-11-18 12:16:38,417 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-11-18 12:16:38,775 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 97 [2018-11-18 12:16:39,123 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 87 [2018-11-18 12:16:39,503 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 108 [2018-11-18 12:16:39,773 INFO L425 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-11-18 12:16:39,773 INFO L421 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 (= 1 ~NP~0)) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= 5 ~MPR1~0)) (let ((.cse7 (or .cse0 (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5 .cse6)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse7 .cse8 (< 0 .cse9) (< .cse9 0))) (or .cse7 .cse8 (not (= ~myStatus~0 0))))) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0))))) [2018-11-18 12:16:39,773 INFO L425 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-11-18 12:16:39,773 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-11-18 12:16:39,774 INFO L425 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-11-18 12:16:39,774 INFO L421 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637)) (.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 ~pended~0))) (.cse16 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse17 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse1 (not (= 2 ~DC~0))) (.cse2 (not (= ~UNLOADED~0 0))) (.cse3 (not (= 7 ~IPC~0))) (.cse8 (not (= ~DeviceUsageTypePaging~0 1))) (.cse9 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (let ((.cse18 (or .cse11 (or .cse12 .cse13 .cse14 .cse15 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse16 .cse17)) (.cse19 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse18 .cse19 (< 0 .cse10) (< .cse10 0)) (or .cse18 .cse19 (not (= ~myStatus~0 0)))))) (.cse7 (not (= ~KernelMode~0 0))) (.cse4 (= |old(~s~0)| ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse3 (= ~customIrp~0 0) .cse8 .cse9 .cse0 (not (= 0 .cse10)) .cse5 .cse6 .cse7 (not (= |old(~customIrp~0)| 0))) (or .cse4 (or .cse11 (or .cse12 .cse13 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse14 .cse15 .cse16 .cse17 (< ~IPC~0 (+ ~DC~0 5))))))) [2018-11-18 12:16:39,774 INFO L425 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-11-18 12:16:39,774 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-11-18 12:16:39,774 INFO L425 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-11-18 12:16:39,774 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-11-18 12:16:39,774 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 62 83) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (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 (= ~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-11-18 12:16:39,774 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L421 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-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse1 (+ (div AG_SetStatusAndReturn_~__cil_tmp4~0 4294967296) 1))) (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))))) (.cse2 (<= .cse1 0))) (and (or .cse0 (and (or (< 0 .cse1) (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)) (or .cse2 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|)))) (or (and (= |old(~s~0)| ~s~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) .cse0) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)) (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) .cse2))))) [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L421 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 1 ~NP~0))) (.cse6 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse7 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= ~Executive~0 0)))) (and (or (= ~customIrp~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse6 .cse0 .cse1 .cse2 .cse8 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse9 .cse3 .cse4)))) [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L421 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= 2 ~DC~0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse4 (not (= 7 ~IPC~0))) (.cse7 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse1 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse9) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse9 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (not (= ~KernelMode~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse5 .cse6 .cse7 .cse8) (or .cse2 .cse3 .cse4 .cse7 .cse8 .cse0 .cse1 (= ~customIrp~0 0) (not (= 0 .cse9)) .cse5 .cse6 (not (= |old(~customIrp~0)| 0)))))) [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-11-18 12:16:39,775 INFO L425 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-11-18 12:16:39,776 INFO L425 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-11-18 12:16:39,776 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-11-18 12:16:39,776 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-18 12:16:39,776 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-11-18 12:16:39,776 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-11-18 12:16:39,776 INFO L421 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 1 ~NP~0))) (.cse6 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse7 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~customIrp~0 0) .cse6 (not (= 0 .cse7)) .cse8 .cse9 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse6 .cse0 .cse1 .cse2 .cse8 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse9 .cse3 .cse4)))) [2018-11-18 12:16:39,776 INFO L421 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= 2 ~DC~0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse4 (not (= 7 ~IPC~0))) (.cse7 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse1 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse9) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse9 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (not (= ~KernelMode~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse5 .cse6 .cse7 .cse8) (or .cse2 .cse3 .cse4 .cse7 .cse8 .cse0 .cse1 (= ~customIrp~0 0) (not (= 0 .cse9)) .cse5 .cse6 (not (= |old(~customIrp~0)| 0)))))) [2018-11-18 12:16:39,776 INFO L425 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-11-18 12:16:39,776 INFO L425 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-18 12:16:39,777 INFO L421 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 1 ~NP~0))) (.cse6 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse7 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~customIrp~0 0) .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse6 .cse0 .cse1 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse2 .cse8 .cse9 .cse3 .cse4)))) [2018-11-18 12:16:39,777 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 171 188) no Hoare annotation was computed. [2018-11-18 12:16:39,777 INFO L421 ceAbstractionStarter]: At program point L171-3(lines 171 188) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 1 ~NP~0))) (.cse6 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse7 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~customIrp~0 0) .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse6 .cse0 .cse1 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse2 .cse8 .cse9 .cse3 .cse4)))) [2018-11-18 12:16:39,777 INFO L421 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(~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)|)) (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(~IPC~0)|))) [2018-11-18 12:16:39,777 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-11-18 12:16:39,777 INFO L425 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-11-18 12:16:39,778 INFO L421 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)|)) (and .cse8 (not (= 259 main_~status~9)) .cse9 .cse2 .cse6 .cse10) (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)|)) (and .cse12 .cse11 .cse4 .cse7))))) [2018-11-18 12:16:39,778 INFO L421 ceAbstractionStarter]: At program point L1754(line 1754) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 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(~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-11-18 12:16:39,778 INFO L425 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-11-18 12:16:39,778 INFO L425 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-11-18 12:16:39,778 INFO L421 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-11-18 12:16:39,778 INFO L421 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)|)) (and .cse8 (not (= 259 main_~status~9)) .cse9 .cse2 .cse6 .cse10) (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)|)) (and .cse12 .cse11 .cse4 .cse7))))) [2018-11-18 12:16:39,778 INFO L425 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-11-18 12:16:39,778 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-11-18 12:16:39,779 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-11-18 12:16:39,779 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-11-18 12:16:39,779 INFO L425 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-11-18 12:16:39,779 INFO L421 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)|)) (and (and .cse1 .cse2 .cse0 (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~9))) (not (= |old(~compRegistered~0)| 0)) (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-11-18 12:16:39,779 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 1716 1878) the Hoare annotation is: (or (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(~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-11-18 12:16:39,779 INFO L425 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-11-18 12:16:39,779 INFO L421 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-11-18 12:16:39,780 INFO L421 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-11-18 12:16:39,780 INFO L425 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-11-18 12:16:39,780 INFO L421 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-11-18 12:16:39,780 INFO L425 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-11-18 12:16:39,780 INFO L425 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-11-18 12:16:39,780 INFO L425 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-11-18 12:16:39,780 INFO L425 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-11-18 12:16:39,781 INFO L421 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) the Hoare annotation is: (or (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse0 (= ~UNLOADED~0 0)) (.cse5 (= ~NP~0 1)) (.cse1 (= ~MPR1~0 5)) (.cse2 (= ~IPC~0 7)) (.cse6 (= ~DeviceUsageTypePaging~0 1)) (.cse7 (= ~KernelMode~0 0)) (.cse3 (= ~Executive~0 0)) (.cse4 (= ~DC~0 2)) (.cse8 (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)) (.cse16 (= ~routine~0 0)) (.cse17 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse18 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse19 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 .cse9) .cse16 .cse17 .cse18 (<= .cse9 0) .cse19) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~myStatus~0) .cse19))))) (or (and (= ~customIrp~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse7 (= .cse9 0) .cse3 .cse4 .cse8)))) (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-11-18 12:16:39,781 INFO L425 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-11-18 12:16:39,781 INFO L421 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-11-18 12:16:39,781 INFO L425 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-11-18 12:16:39,781 INFO L421 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-11-18 12:16:39,781 INFO L425 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-11-18 12:16:39,781 INFO L425 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-11-18 12:16:39,781 INFO L425 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-11-18 12:16:39,781 INFO L425 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-11-18 12:16:39,781 INFO L428 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-11-18 12:16:39,781 INFO L425 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-11-18 12:16:39,782 INFO L425 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-11-18 12:16:39,782 INFO L425 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-11-18 12:16:39,782 INFO L421 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-11-18 12:16:39,782 INFO L421 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-11-18 12:16:39,782 INFO L425 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-11-18 12:16:39,782 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (= ~s~0 |old(~s~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 (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-11-18 12:16:39,782 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-11-18 12:16:39,782 INFO L425 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-11-18 12:16:39,783 INFO L421 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-11-18 12:16:39,783 INFO L421 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-11-18 12:16:39,783 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-11-18 12:16:39,783 INFO L421 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-11-18 12:16:39,783 INFO L425 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-11-18 12:16:39,783 INFO L425 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-11-18 12:16:39,783 INFO L425 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-11-18 12:16:39,783 INFO L421 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-11-18 12:16:39,783 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-11-18 12:16:39,783 INFO L425 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-11-18 12:16:39,783 INFO L421 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-11-18 12:16:39,783 INFO L425 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L421 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-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-11-18 12:16:39,784 INFO L421 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-11-18 12:16:39,784 INFO L421 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-11-18 12:16:39,784 INFO L425 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L421 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-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L421 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-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L421 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-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-11-18 12:16:39,785 INFO L425 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-11-18 12:16:39,786 INFO L425 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-11-18 12:16:39,786 INFO L421 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 |old(~s~0)|)) .cse19 .cse20 .cse21) (or .cse29 (or .cse22 .cse1 .cse23 .cse2 .cse13 .cse15 .cse27 .cse17 .cse28 .cse18 .cse0 .cse19 .cse20 .cse21)))))) [2018-11-18 12:16:39,786 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-11-18 12:16:39,786 INFO L425 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-11-18 12:16:39,786 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-11-18 12:16:39,787 INFO L421 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse34 (+ ~myStatus~0 1073741637))) (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.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))) (.cse7 (< 0 .cse34)) (.cse8 (< .cse34 0)) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (not (= ~myStatus~0 0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse31 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1)) (.cse32 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 1 ~routine~0))) (.cse15 (not (= ~SKIP2~0 4))) (.cse16 (not (= ~DeviceUsageTypePaging~0 1))) (.cse17 (not (= 6 ~MPR3~0))) (.cse26 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse18 (not (= ~Executive~0 0))) (.cse27 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse19 (not (= 1 ~NP~0))) (.cse20 (not (= 5 ~MPR1~0))) (.cse21 (not (= ~KernelMode~0 0))) (.cse22 (not (= |old(~customIrp~0)| 0)))) (let ((.cse0 (= ~customIrp~0 0)) (.cse23 (or .cse24 .cse2 .cse25 .cse3 .cse14 (let ((.cse33 (or .cse6 .cse11 .cse31 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse12 .cse32 .cse13))) (and (or .cse4 .cse7 .cse8 .cse33) (or .cse4 .cse10 .cse33))) .cse15 .cse16 .cse17 .cse26 .cse18 .cse27 (not (= 1 |old(~s~0)|)) .cse19 .cse20 .cse21 .cse22)) (.cse28 (let ((.cse29 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse30 (or .cse5 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse11 .cse31 .cse32 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse29 .cse7 .cse8 .cse30) (or .cse29 .cse10 .cse30)))) (.cse1 (= ~s~0 ~NP~0))) (and (or (and .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 (not (= |old(~s~0)| ~MPR3~0)) .cse22)) (or .cse0 .cse23) (or (or .cse24 .cse2 .cse25 .cse3 .cse14 .cse16 .cse26 .cse18 .cse27 .cse19 .cse28 .cse20 .cse21 .cse22) .cse0) (or (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)) .cse23) (or .cse28 .cse1))))) [2018-11-18 12:16:39,787 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-11-18 12:16:39,787 INFO L421 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse34 (+ ~myStatus~0 1073741637))) (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.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))) (.cse7 (< 0 .cse34)) (.cse8 (< .cse34 0)) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (not (= ~myStatus~0 0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse31 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1)) (.cse32 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 1 ~routine~0))) (.cse15 (not (= ~SKIP2~0 4))) (.cse16 (not (= ~DeviceUsageTypePaging~0 1))) (.cse17 (not (= 6 ~MPR3~0))) (.cse26 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse18 (not (= ~Executive~0 0))) (.cse27 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse19 (not (= 1 ~NP~0))) (.cse20 (not (= 5 ~MPR1~0))) (.cse21 (not (= ~KernelMode~0 0))) (.cse22 (not (= |old(~customIrp~0)| 0)))) (let ((.cse0 (= ~customIrp~0 0)) (.cse23 (or .cse24 .cse2 .cse25 .cse3 .cse14 (let ((.cse33 (or .cse6 .cse11 .cse31 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse12 .cse32 .cse13))) (and (or .cse4 .cse7 .cse8 .cse33) (or .cse4 .cse10 .cse33))) .cse15 .cse16 .cse17 .cse26 .cse18 .cse27 (not (= 1 |old(~s~0)|)) .cse19 .cse20 .cse21 .cse22)) (.cse28 (let ((.cse29 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse30 (or .cse5 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse11 .cse31 .cse32 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse29 .cse7 .cse8 .cse30) (or .cse29 .cse10 .cse30)))) (.cse1 (= ~s~0 ~NP~0))) (and (or (and .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 (not (= |old(~s~0)| ~MPR3~0)) .cse22)) (or .cse0 .cse23) (or (or .cse24 .cse2 .cse25 .cse3 .cse14 .cse16 .cse26 .cse18 .cse27 .cse19 .cse28 .cse20 .cse21 .cse22) .cse0) (or (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)) .cse23) (or .cse28 .cse1))))) [2018-11-18 12:16:39,787 INFO L421 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-11-18 12:16:39,787 INFO L425 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-11-18 12:16:39,787 INFO L425 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-11-18 12:16:39,788 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-11-18 12:16:39,788 INFO L425 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-11-18 12:16:39,788 INFO L425 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-11-18 12:16:39,788 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse34 (+ ~myStatus~0 1073741637))) (let ((.cse8 (< 0 .cse34)) (.cse9 (< .cse34 0)) (.cse11 (not (= ~myStatus~0 0))) (.cse6 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (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 ((.cse2 (and .cse31 (and .cse0 (= 1 ~setEventCalled~0)))) (.cse5 (not (= |old(~setEventCalled~0)| 1))) (.cse13 (< ~compRegistered~0 1)) (.cse14 (not (= 1 ~routine~0))) (.cse16 (not (= ~SKIP2~0 4))) (.cse18 (not (= 6 ~MPR3~0))) (.cse24 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse3 (not (= 2 ~DC~0))) (.cse25 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse4 (not (= ~UNLOADED~0 0))) (.cse15 (not (= 7 ~IPC~0))) (.cse17 (not (= ~DeviceUsageTypePaging~0 1))) (.cse29 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse19 (not (= ~Executive~0 0))) (.cse30 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse20 (not (= 1 ~NP~0))) (.cse1 (let ((.cse32 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse33 (or .cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse7 .cse12 .cse27 .cse28 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse32 .cse8 .cse9 .cse33) (or .cse32 .cse11 .cse33)))) (.cse21 (not (= 5 ~MPR1~0))) (.cse22 (not (= ~KernelMode~0 0))) (.cse23 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or .cse2 (or .cse3 .cse4 (let ((.cse10 (or .cse12 .cse13 .cse14))) (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse5 .cse6 .cse7 .cse11 .cse10))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (= |old(~s~0)| ~MPR3~0)) .cse23)) (or .cse2 .cse24 .cse3 .cse25 .cse4 .cse15 (let ((.cse26 (or .cse7 .cse12 .cse27 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse13 .cse28 .cse14))) (and (or .cse5 .cse8 .cse9 .cse26) (or .cse5 .cse11 .cse26))) .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 (not (= 1 |old(~s~0)|)) .cse20 .cse21 .cse22 .cse23) (or .cse31 (or .cse24 .cse3 .cse25 .cse4 .cse15 .cse17 .cse29 .cse19 .cse30 .cse20 .cse1 .cse21 .cse22 .cse23)))))) [2018-11-18 12:16:39,788 INFO L421 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-11-18 12:16:39,788 INFO L425 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-11-18 12:16:39,789 INFO L421 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-11-18 12:16:39,789 INFO L425 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-11-18 12:16:39,789 INFO L421 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-11-18 12:16:39,789 INFO L421 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-11-18 12:16:39,789 INFO L425 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-11-18 12:16:39,789 INFO L425 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-11-18 12:16:39,789 INFO L425 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-11-18 12:16:39,789 INFO L421 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-11-18 12:16:39,789 INFO L425 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-11-18 12:16:39,790 INFO L425 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-11-18 12:16:39,790 INFO L425 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-11-18 12:16:39,790 INFO L425 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-11-18 12:16:39,790 INFO L425 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-11-18 12:16:39,791 INFO L421 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-11-18 12:16:39,791 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-11-18 12:16:39,791 INFO L421 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-11-18 12:16:39,791 INFO L421 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-11-18 12:16:39,791 INFO L425 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-11-18 12:16:39,791 INFO L421 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-11-18 12:16:39,791 INFO L421 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-11-18 12:16:39,791 INFO L425 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-11-18 12:16:39,791 INFO L425 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-11-18 12:16:39,791 INFO L425 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-11-18 12:16:39,792 INFO L425 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-11-18 12:16:39,792 INFO L425 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-11-18 12:16:39,792 INFO L421 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-11-18 12:16:39,801 INFO L425 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-11-18 12:16:39,801 INFO L421 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-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L421 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-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L428 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-11-18 12:16:39,802 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-11-18 12:16:39,803 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (let ((.cse1 (+ ~myStatus~0 1073741637))) (or (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)))) (or (and (= ~customIrp~0 0) .cse0) (and (= .cse1 0) .cse0))) (let ((.cse4 (not (= 2 ~DC~0))) (.cse5 (not (= ~UNLOADED~0 0))) (.cse6 (not (= 7 ~IPC~0))) (.cse9 (not (= ~DeviceUsageTypePaging~0 1))) (.cse10 (not (= ~Executive~0 0))) (.cse2 (not (= 1 ~NP~0))) (.cse3 (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 ~routine~0))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse18 (not (= |old(~compRegistered~0)| 0))) (.cse19 (not (= 0 |old(~pended~0)|))) (.cse20 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse11 .cse12 (< 0 .cse1) .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse1 0) .cse18 .cse19 .cse20) (or .cse11 .cse12 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) (.cse7 (not (= 5 ~MPR1~0))) (.cse8 (not (= ~KernelMode~0 0)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse1)) .cse7 .cse8 .cse9 .cse10) (or .cse4 .cse5 .cse6 .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 (not (= |old(~customIrp~0)| 0))))))) [2018-11-18 12:16:39,805 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-11-18 12:16:39,805 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-11-18 12:16:39,806 INFO L421 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-11-18 12:16:39,806 INFO L425 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-11-18 12:16:39,806 INFO L421 ceAbstractionStarter]: At program point L287-2(lines 277 291) 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 (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= ~myStatus~0 |old(~myStatus~0)|))) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-11-18 12:16:39,806 INFO L425 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-11-18 12:16:39,809 INFO L425 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-18 12:16:39,809 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-11-18 12:16:39,809 INFO L425 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-11-18 12:16:39,809 INFO L425 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-11-18 12:16:39,809 INFO L421 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-11-18 12:16:39,809 INFO L425 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-11-18 12:16:39,809 INFO L425 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-11-18 12:16:39,809 INFO L425 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-11-18 12:16:39,809 INFO L421 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-11-18 12:16:39,809 INFO L421 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) 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 (= ~customIrp~0 0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)))) [2018-11-18 12:16:39,813 INFO L421 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-11-18 12:16:39,813 INFO L425 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-11-18 12:16:39,813 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-11-18 12:16:39,813 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-18 12:16:39,813 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-18 12:16:39,813 INFO L421 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (let ((.cse12 (+ ~SKIP2~0 3)) (.cse14 (+ ~DC~0 2)) (.cse16 (+ ~NP~0 2)) (.cse15 (+ ~NP~0 5)) (.cse13 (+ ~SKIP1~0 2)) (.cse11 (+ ~MPR3~0 1))) (let ((.cse17 (and (<= .cse12 ~IPC~0) (and (<= .cse14 ~SKIP2~0) (and (<= .cse16 ~SKIP1~0) (= 0 ~pended~0) (<= .cse15 ~MPR3~0) (= ~s~0 ~NP~0) (<= .cse13 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (= ~routine~0 1)) (<= .cse11 ~IPC~0))))) (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 .cse16)) (.cse1 (< ~MPR3~0 .cse15)) (.cse3 (< ~SKIP2~0 .cse14)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse13)) (.cse7 (< ~IPC~0 .cse12)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse11))) (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 (= |old(~myStatus~0)| ~myStatus~0) .cse17 (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (and (= 0 CdAudioPnp_~status~2) .cse17)))) [2018-11-18 12:16:39,819 INFO L425 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-11-18 12:16:39,819 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-11-18 12:16:39,819 INFO L421 ceAbstractionStarter]: At program point L236(lines 235 307) 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 (= ~customIrp~0 0) (= (+ ~myStatus~0 1073741637) 0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)))) [2018-11-18 12:16:39,819 INFO L421 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-11-18 12:16:39,819 INFO L421 ceAbstractionStarter]: At program point L294(line 294) 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 (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))) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-11-18 12:16:39,823 INFO L421 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-11-18 12:16:39,823 INFO L428 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-11-18 12:16:39,823 INFO L428 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-11-18 12:16:39,823 INFO L425 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-11-18 12:16:39,824 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-11-18 12:16:39,824 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-11-18 12:16:39,829 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-11-18 12:16:39,829 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-11-18 12:16:39,829 INFO L421 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-11-18 12:16:39,829 INFO L425 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-11-18 12:16:39,830 INFO L421 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-11-18 12:16:39,830 INFO L425 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-11-18 12:16:39,830 INFO L421 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-11-18 12:16:39,830 INFO L425 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-11-18 12:16:39,830 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-11-18 12:16:39,830 INFO L425 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-11-18 12:16:39,830 INFO L421 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-11-18 12:16:39,837 INFO L421 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-11-18 12:16:39,838 INFO L425 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-11-18 12:16:39,838 INFO L425 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-11-18 12:16:39,838 INFO L425 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-11-18 12:16:39,838 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-11-18 12:16:39,838 INFO L421 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-11-18 12:16:39,838 INFO L421 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-11-18 12:16:39,838 INFO L421 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-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L421 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-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L421 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-11-18 12:16:39,848 INFO L425 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-11-18 12:16:39,848 INFO L421 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-11-18 12:16:39,861 INFO L425 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-11-18 12:16:39,861 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-11-18 12:16:39,862 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-11-18 12:16:39,862 INFO L421 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-11-18 12:16:39,862 INFO L425 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-11-18 12:16:39,862 INFO L421 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-11-18 12:16:39,862 INFO L425 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-11-18 12:16:39,862 INFO L425 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-11-18 12:16:39,862 INFO L421 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-11-18 12:16:39,862 INFO L425 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-11-18 12:16:39,869 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L421 ceAbstractionStarter]: At program point L721(lines 711 732) 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)) (= ~myStatus~0 |old(~myStatus~0)|) (<= .cse11 0)))) [2018-11-18 12:16:39,870 INFO L421 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 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-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L421 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-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-18 12:16:39,870 INFO L425 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-11-18 12:16:39,872 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-11-18 12:16:39,872 INFO L421 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-11-18 12:16:39,872 INFO L425 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-11-18 12:16:39,872 INFO L421 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-11-18 12:16:39,872 INFO L425 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-11-18 12:16:39,872 INFO L425 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-11-18 12:16:39,872 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-11-18 12:16:39,872 INFO L421 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-11-18 12:16:39,873 INFO L425 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-11-18 12:16:39,873 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-11-18 12:16:39,873 INFO L425 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-11-18 12:16:39,873 INFO L421 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-11-18 12:16:39,875 INFO L425 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-11-18 12:16:39,875 INFO L421 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-11-18 12:16:39,875 INFO L425 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-11-18 12:16:39,875 INFO L425 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-11-18 12:16:39,876 INFO L421 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-11-18 12:16:39,876 INFO L425 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-11-18 12:16:39,876 INFO L425 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-11-18 12:16:39,876 INFO L425 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-11-18 12:16:39,876 INFO L421 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))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-11-18 12:16:39,876 INFO L425 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-11-18 12:16:39,882 INFO L425 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-11-18 12:16:39,882 INFO L425 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-11-18 12:16:39,882 INFO L425 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-11-18 12:16:39,882 INFO L425 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-11-18 12:16:39,882 INFO L421 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-11-18 12:16:39,882 INFO L425 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-11-18 12:16:39,882 INFO L425 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-11-18 12:16:39,882 INFO L421 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)) (.cse14 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse16 (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 ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) .cse14 (<= 0 .cse13) (= ~MPR1~0 ~s~0) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (or (let ((.cse17 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse16 .cse17) (or .cse1 .cse8 .cse17))) (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 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse14 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 12:16:39,883 INFO L421 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)) (.cse14 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse16 (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 ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) .cse14 (<= 0 .cse13) (= ~MPR1~0 ~s~0) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (or (let ((.cse17 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse16 .cse17) (or .cse1 .cse8 .cse17))) (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 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse14 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 12:16:39,888 INFO L425 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-11-18 12:16:39,889 INFO L425 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-11-18 12:16:39,889 INFO L425 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-11-18 12:16:39,889 INFO L425 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-11-18 12:16:39,889 INFO L425 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-11-18 12:16:39,889 INFO L421 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 (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)) .cse2 (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-11-18 12:16:39,889 INFO L425 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-11-18 12:16:39,898 INFO L425 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-11-18 12:16:39,898 INFO L425 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-11-18 12:16:39,899 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-11-18 12:16:39,899 INFO L421 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)) (.cse14 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse16 (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 ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) .cse14 (<= 0 .cse13) (= ~MPR1~0 ~s~0) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (or (let ((.cse17 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse16 .cse17) (or .cse1 .cse8 .cse17))) (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 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse14 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 12:16:39,899 INFO L425 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-11-18 12:16:39,899 INFO L425 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-11-18 12:16:39,899 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-11-18 12:16:39,899 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-11-18 12:16:39,899 INFO L421 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-11-18 12:16:39,909 INFO L425 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-11-18 12:16:39,909 INFO L421 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-11-18 12:16:39,909 INFO L425 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-11-18 12:16:39,909 INFO L421 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)) (.cse14 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse16 (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 ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) .cse14 (<= 0 .cse13) (= ~MPR1~0 ~s~0) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (or (let ((.cse17 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse16 .cse17) (or .cse1 .cse8 .cse17))) (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 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse14 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 12:16:39,915 INFO L421 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (not (= ~myStatus~0 0))) (.cse7 (< 0 .cse16)) (.cse10 (< .cse16 0)) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 |old(~pended~0)|))) (.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 .cse0 .cse12 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .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)) (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse14 0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse14) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (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)))))) [2018-11-18 12:16:39,915 INFO L421 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse9 (< 0 .cse14)) (.cse10 (< .cse14 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse7 (not (= ~myStatus~0 0))) (.cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse13 (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))) (.cse12 (< ~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 (let ((.cse8 (or .cse11 (not (= 1 ~routine~0)) .cse3 .cse5 .cse12))) (and (or .cse7 .cse8) (or .cse9 .cse10 .cse8))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (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 .cse9 .cse11 .cse1 .cse2 .cse13 .cse3 .cse4 .cse10 .cse5 .cse6 .cse12) (or .cse0 .cse7 .cse11 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse12)))) [2018-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L421 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-11-18 12:16:39,923 INFO L421 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-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L421 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-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:16:39,923 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2018-11-18 12:16:39,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L421 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-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L421 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-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L421 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-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L421 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-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L421 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-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L425 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-11-18 12:16:39,927 INFO L421 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-11-18 12:16:39,932 INFO L421 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-11-18 12:16:39,932 INFO L425 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-11-18 12:16:39,932 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-11-18 12:16:39,932 INFO L425 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-11-18 12:16:39,932 INFO L425 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-11-18 12:16:39,932 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-11-18 12:16:39,933 INFO L425 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-11-18 12:16:39,933 INFO L421 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-11-18 12:16:39,933 INFO L421 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-11-18 12:16:39,941 INFO L425 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-11-18 12:16:39,941 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-11-18 12:16:39,941 INFO L421 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-11-18 12:16:39,941 INFO L425 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-11-18 12:16:39,941 INFO L425 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-11-18 12:16:39,942 INFO L421 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-11-18 12:16:39,942 INFO L425 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-18 12:16:39,942 INFO L421 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-11-18 12:16:39,942 INFO L421 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-11-18 12:16:39,951 INFO L425 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-11-18 12:16:39,951 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-11-18 12:16:39,951 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:16:39,951 INFO L421 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-11-18 12:16:39,951 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 12:16:39,951 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:16:39,951 INFO L421 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp104~1 1073741670)) (<= .cse0 0) (<= 0 .cse0) (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))) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp104~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-11-18 12:16:39,951 INFO L425 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-11-18 12:16:39,952 INFO L421 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-11-18 12:16:39,952 INFO L425 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-11-18 12:16:39,952 INFO L421 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-11-18 12:16:39,959 INFO L425 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-11-18 12:16:39,959 INFO L425 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-11-18 12:16:39,960 INFO L421 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-11-18 12:16:39,960 INFO L425 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-11-18 12:16:39,960 INFO L425 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-11-18 12:16:39,960 INFO L425 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-11-18 12:16:39,960 INFO L425 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-11-18 12:16:39,960 INFO L421 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-11-18 12:16:39,960 INFO L425 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-11-18 12:16:39,960 INFO L425 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-11-18 12:16:39,960 INFO L421 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-11-18 12:16:39,960 INFO L425 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-11-18 12:16:39,960 INFO L421 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-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L421 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-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L421 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-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L421 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-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L425 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-11-18 12:16:39,970 INFO L421 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-11-18 12:16:39,978 INFO L421 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-11-18 12:16:39,978 INFO L421 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-11-18 12:16:39,978 INFO L425 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-11-18 12:16:39,978 INFO L425 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-11-18 12:16:39,978 INFO L421 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-11-18 12:16:39,979 INFO L421 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-11-18 12:16:39,979 INFO L425 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-11-18 12:16:39,979 INFO L425 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-11-18 12:16:39,979 INFO L425 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-11-18 12:16:39,979 INFO L425 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-11-18 12:16:39,979 INFO L425 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-11-18 12:16:39,979 INFO L421 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-11-18 12:16:39,990 INFO L421 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-11-18 12:16:39,990 INFO L425 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-11-18 12:16:39,990 INFO L425 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-11-18 12:16:39,990 INFO L421 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-11-18 12:16:39,990 INFO L425 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-11-18 12:16:39,990 INFO L425 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-11-18 12:16:39,990 INFO L425 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-11-18 12:16:39,990 INFO L425 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-11-18 12:16:39,990 INFO L421 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-11-18 12:16:39,990 INFO L425 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-11-18 12:16:39,990 INFO L421 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-11-18 12:16:39,990 INFO L425 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-11-18 12:16:39,999 INFO L421 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-11-18 12:16:39,999 INFO L425 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-11-18 12:16:39,999 INFO L425 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-11-18 12:16:39,999 INFO L425 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-11-18 12:16:39,999 INFO L425 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-11-18 12:16:39,999 INFO L425 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-11-18 12:16:39,999 INFO L425 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-11-18 12:16:40,000 INFO L421 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-11-18 12:16:40,000 INFO L425 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-11-18 12:16:40,000 INFO L421 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-11-18 12:16:40,000 INFO L425 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-11-18 12:16:40,000 INFO L425 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-11-18 12:16:40,000 INFO L421 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-11-18 12:16:40,000 INFO L425 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-11-18 12:16:40,000 INFO L425 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-11-18 12:16:40,009 INFO L421 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-11-18 12:16:40,009 INFO L425 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-11-18 12:16:40,009 INFO L421 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-11-18 12:16:40,009 INFO L425 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L421 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-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L421 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-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-11-18 12:16:40,010 INFO L425 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L421 ceAbstractionStarter]: At program point L1237(line 1237) 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 (<= 0 .cse0) (and (<= .cse0 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)|)))) [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L421 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-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-11-18 12:16:40,018 INFO L421 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-11-18 12:16:40,018 INFO L425 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-11-18 12:16:40,019 INFO L425 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-11-18 12:16:40,019 INFO L421 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-11-18 12:16:40,023 INFO L425 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-11-18 12:16:40,023 INFO L425 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-11-18 12:16:40,023 INFO L425 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-11-18 12:16:40,023 INFO L425 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-11-18 12:16:40,023 INFO L425 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L421 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-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L421 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-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-11-18 12:16:40,024 INFO L425 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-11-18 12:16:40,030 INFO L425 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-11-18 12:16:40,030 INFO L425 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-11-18 12:16:40,030 INFO L425 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-11-18 12:16:40,030 INFO L425 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-11-18 12:16:40,030 INFO L421 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-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L428 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L421 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (or (not (= 1 ~NP~0)) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse0 (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))))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0))) (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0))))) (not (= ~Executive~0 0))) [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L425 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-11-18 12:16:40,031 INFO L421 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (let ((.cse5 (not (= 1 ~NP~0))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse6 (not (= 5 ~MPR1~0))) (.cse7 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (let ((.cse9 (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))))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse9 .cse10 (not (= ~myStatus~0 0))) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse9 .cse10 (< 0 .cse11) (< .cse11 0)))))) (.cse4 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 (= ~customIrp~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse0 .cse1 .cse2 .cse6 .cse7 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse3 .cse8 .cse4))) [2018-11-18 12:16:40,035 INFO L425 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-11-18 12:16:40,035 INFO L421 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (let ((.cse1 (not (= 2 ~DC~0))) (.cse2 (not (= ~UNLOADED~0 0))) (.cse3 (not (= 7 ~IPC~0))) (.cse6 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (not (= ~KernelMode~0 0))) (.cse7 (let ((.cse9 (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))))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse9 .cse10 (not (= ~myStatus~0 0))) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse9 .cse10 (< 0 .cse11) (< .cse11 0))))))) (and (or .cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse3 .cse6 (= ~customIrp~0 0) .cse8 .cse0 .cse4 .cse5 .cse7 (not (= |old(~customIrp~0)| 0))))) [2018-11-18 12:16:40,035 INFO L421 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (or (not (= 1 ~NP~0)) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse0 (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))))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0))) (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0))))) (not (= ~Executive~0 0))) [2018-11-18 12:16:40,035 INFO L425 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-11-18 12:16:40,035 INFO L425 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-11-18 12:16:40,035 INFO L421 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse5 (not (= 2 ~DC~0))) (.cse6 (not (= ~UNLOADED~0 0))) (.cse7 (not (= 7 ~IPC~0))) (.cse8 (not (= ~DeviceUsageTypePaging~0 1))) (.cse9 (not (= ~Executive~0 0))) (.cse10 (not (= 1 ~NP~0))) (.cse11 (not (= 5 ~MPR1~0))) (.cse12 (not (= ~KernelMode~0 0))) (.cse13 (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))) (let ((.cse16 (+ ~myStatus~0 1073741637))) (or .cse14 .cse15 (< 0 .cse16) (< .cse16 0))))))) (and (let ((.cse0 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= 1 ~compRegistered~0)) (.cse4 (= 1 ~setEventCalled~0)) (.cse3 (= ~routine~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) (= ~s~0 ~MPR3~0)) .cse5 .cse6 (and .cse0 .cse1 (= |old(~s~0)| ~s~0) .cse2 .cse4 .cse3) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse5 .cse6 .cse7 .cse8 (= ~customIrp~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |old(~customIrp~0)| 0))))) [2018-11-18 12:16:40,038 INFO L428 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-11-18 12:16:40,038 INFO L428 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-11-18 12:16:40,038 INFO L428 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-11-18 12:16:40,038 INFO L425 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-11-18 12:16:40,038 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-11-18 12:16:40,038 INFO L425 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-11-18 12:16:40,038 INFO L425 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-11-18 12:16:40,038 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-11-18 12:16:40,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:16:40 BoogieIcfgContainer [2018-11-18 12:16:40,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:16:40,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:16:40,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:16:40,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:16:40,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:15:41" (3/4) ... [2018-11-18 12:16:40,139 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 12:16:40,144 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-11-18 12:16:40,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-11-18 12:16:40,148 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-11-18 12:16:40,149 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-11-18 12:16:40,149 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-11-18 12:16:40,149 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-11-18 12:16:40,149 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-18 12:16:40,178 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2018-11-18 12:16:40,180 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-18 12:16:40,182 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 12:16:40,210 WARN L220 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-11-18 12:16:40,210 WARN L220 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-11-18 12:16:40,210 WARN L220 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))) || ((((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(compRegistered) == 0)) || !(\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-11-18 12:16:40,211 WARN L220 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) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(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)) || !(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-11-18 12:16:40,211 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((customIrp == 0 && s == NP) || (((((((((((!(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)) && (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))) && ((((((((((((((!(\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)) || customIrp == 0)) && ((\old(s) == s && 1 == setEventCalled) || (((((((((((((((!(\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))) && (((((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) [2018-11-18 12:16:40,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((customIrp == 0 && s == NP) || (((((((((((!(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)) && (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))) && ((((((((((((((!(\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)) || customIrp == 0)) && ((\old(s) == s && 1 == setEventCalled) || (((((((((((((((!(\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))) && (((((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) [2018-11-18 12:16:40,212 WARN L220 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-11-18 12:16:40,212 WARN L220 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-11-18 12:16:40,212 WARN L220 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-11-18 12:16:40,213 WARN L220 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) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(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)) || !(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-11-18 12:16:40,214 WARN L220 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))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3) [2018-11-18 12:16:40,214 WARN L220 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-11-18 12:16:40,214 WARN L220 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 == \old(s))) || !(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-11-18 12:16:40,215 WARN L220 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-11-18 12:16:40,215 WARN L220 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-11-18 12:16:40,215 WARN L220 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))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((((((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(IPC)) [2018-11-18 12:16:40,215 WARN L220 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) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(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)) || !(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-11-18 12:16:40,215 WARN L220 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) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(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)) || !(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-11-18 12:16:40,215 WARN L220 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-11-18 12:16:40,216 WARN L220 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-11-18 12:16:40,216 WARN L220 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-11-18 12:16:40,216 WARN L220 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-11-18 12:16:40,216 WARN L220 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-11-18 12:16:40,217 WARN L220 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-11-18 12:16:40,217 WARN L220 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-11-18 12:16:40,217 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || customIrp == 0) || !(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))) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 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))) || !(2 == DC)) || !(UNLOADED == 0)) || (((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1)) || !(7 == IPC)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) [2018-11-18 12:16:40,223 WARN L220 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-11-18 12:16:40,223 WARN L220 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-11-18 12:16:40,223 WARN L220 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-11-18 12:16:40,223 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((customIrp == 0 || !(2 == DC)) || !(UNLOADED == 0)) || !(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))) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 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))) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(5 == MPR1)) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) [2018-11-18 12:16:40,246 WARN L220 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)) || (((0 <= status + 1073741670 && s == NP && 0 == pended) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) [2018-11-18 12:16:40,249 WARN L220 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)) || ((customIrp == 0 && myStatus + 1073741637 == 0) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) [2018-11-18 12:16:40,249 WARN L220 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-11-18 12:16:40,269 WARN L220 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-11-18 12:16:40,271 WARN L220 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-11-18 12:16:40,271 WARN L220 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-11-18 12:16:40,271 WARN L220 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-11-18 12:16:40,271 WARN L220 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-11-18 12:16:40,279 WARN L220 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-11-18 12:16:40,280 WARN L220 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-11-18 12:16:40,280 WARN L220 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-11-18 12:16:40,280 WARN L220 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-11-18 12:16:40,280 WARN L220 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-11-18 12:16:40,280 WARN L220 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-11-18 12:16:40,301 WARN L220 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-11-18 12:16:40,301 WARN L220 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-11-18 12:16:40,301 WARN L220 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-11-18 12:16:40,301 WARN L220 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-11-18 12:16:40,301 WARN L220 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-11-18 12:16:40,301 WARN L220 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-11-18 12:16:40,322 WARN L220 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-11-18 12:16:40,322 WARN L220 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-11-18 12:16:40,442 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_323f49d4-eeba-49df-903a-0dcbb0a627ad/bin-2019/utaipan/witness.graphml [2018-11-18 12:16:40,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:16:40,443 INFO L168 Benchmark]: Toolchain (without parser) took 60034.52 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 969.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:16:40,443 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:16:40,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:16:40,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:16:40,444 INFO L168 Benchmark]: Boogie Preprocessor took 53.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:16:40,444 INFO L168 Benchmark]: RCFGBuilder took 966.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 139.0 MB). Peak memory consumption was 139.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:16:40,444 INFO L168 Benchmark]: TraceAbstraction took 58228.06 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 976.4 MB in the beginning and 1.2 GB in the end (delta: -215.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 12:16:40,444 INFO L168 Benchmark]: Witness Printer took 306.58 ms. Allocated memory is still 2.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:16:40,446 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 452.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 966.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 139.0 MB). Peak memory consumption was 139.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58228.06 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 976.4 MB in the beginning and 1.2 GB in the end (delta: -215.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 306.58 ms. Allocated memory is still 2.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.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))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(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) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(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)) || !(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: (((((customIrp == 0 && s == NP) || (((((((((((!(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)) && (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))) && ((((((((((((((!(\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)) || customIrp == 0)) && ((\old(s) == s && 1 == setEventCalled) || (((((((((((((((!(\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))) && (((((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) - 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) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(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)) || !(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: (((((((((((customIrp == 0 || !(2 == DC)) || !(UNLOADED == 0)) || !(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))) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 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))) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(5 == MPR1)) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 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: 171]: Loop Invariant Derived loop invariant: (((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || customIrp == 0) || !(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))) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 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))) || !(2 == DC)) || !(UNLOADED == 0)) || (((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1)) || !(7 == IPC)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) - 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) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(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)) || !(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: (((((customIrp == 0 && s == NP) || (((((((((((!(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)) && (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))) && ((((((((((((((!(\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)) || customIrp == 0)) && ((\old(s) == s && 1 == setEventCalled) || (((((((((((((((!(\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))) && (((((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) - 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(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))) || (((((((((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(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 == \old(s))) || !(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))) || ((((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(compRegistered) == 0)) || !(\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) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(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)) || !(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: (((((((((!(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)) || ((customIrp == 0 && myStatus + 1073741637 == 0) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) - 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: ((((((((((((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)) || (((0 <= status + 1073741670 && s == NP && 0 == pended) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) - 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, 535 locations, 1 error locations. SAFE Result, 58.0s OverallTime, 96 OverallIterations, 2 TraceHistogramMax, 18.2s AutomataDifference, 0.0s DeadEndRemovalTime, 29.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 50117 SDtfs, 19996 SDslu, 225590 SDs, 0 SdLazy, 21348 SolverSat, 3265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1173 GetRequests, 422 SyntacticMatches, 8 SemanticMatches, 743 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=948occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9796444154520454 AbsIntWeakeningRatio, 1.7699115044247788 AbsIntAvgWeakeningVarsNumRemoved, 6.3584070796460175 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 96 MinimizatonAttempts, 2765 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1815 PreInvPairs, 2176 NumberOfFragments, 25761 HoareAnnotationTreeSize, 1815 FomulaSimplifications, 62252743 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 171 FomulaSimplificationsInter, 1782309 FormulaSimplificationTreeSizeReductionInter, 26.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 6408 NumberOfCodeBlocks, 6408 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 6312 ConstructedInterpolants, 0 QuantifiedInterpolants, 898454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 96 InterpolantComputations, 94 PerfectInterpolantSequences, 75/89 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...