./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/config/AutomizerReach.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_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d647228c0dc0174eb229424fd194f0e34ba347e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:36:40,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:36:40,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:36:40,033 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:36:40,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:36:40,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:36:40,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:36:40,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:36:40,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:36:40,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:36:40,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:36:40,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:36:40,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:36:40,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:36:40,040 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:36:40,040 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:36:40,041 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:36:40,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:36:40,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:36:40,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:36:40,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:36:40,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:36:40,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:36:40,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:36:40,046 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:36:40,047 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:36:40,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:36:40,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:36:40,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:36:40,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:36:40,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:36:40,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:36:40,050 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:36:40,050 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:36:40,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:36:40,051 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:36:40,051 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:36:40,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:36:40,059 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:36:40,060 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:36:40,060 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:36:40,060 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:36:40,060 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:36:40,061 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:36:40,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:36:40,061 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:36:40,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:36:40,061 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:36:40,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:36:40,061 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:36:40,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:36:40,062 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:36:40,062 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:36:40,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:36:40,062 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:36:40,062 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:36:40,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:36:40,063 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:36:40,063 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:36:40,063 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:36:40,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:36:40,063 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:36:40,063 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:36:40,063 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:36:40,063 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:36:40,064 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:36:40,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:36:40,064 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d647228c0dc0174eb229424fd194f0e34ba347e1 [2018-11-23 12:36:40,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:36:40,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:36:40,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:36:40,099 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:36:40,100 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:36:40,100 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 12:36:40,146 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/data/1db70da97/1435d07de8f84cd2a6a9d140e883330e/FLAGfd58bc1ca [2018-11-23 12:36:40,521 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:36:40,521 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 12:36:40,532 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/data/1db70da97/1435d07de8f84cd2a6a9d140e883330e/FLAGfd58bc1ca [2018-11-23 12:36:40,542 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/data/1db70da97/1435d07de8f84cd2a6a9d140e883330e [2018-11-23 12:36:40,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:36:40,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:36:40,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:36:40,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:36:40,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:36:40,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:36:40" (1/1) ... [2018-11-23 12:36:40,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32768438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:40, skipping insertion in model container [2018-11-23 12:36:40,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:36:40" (1/1) ... [2018-11-23 12:36:40,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:36:40,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:36:40,856 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:36:40,860 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:36:40,997 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:36:41,014 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:36:41,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41 WrapperNode [2018-11-23 12:36:41,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:36:41,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:36:41,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:36:41,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:36:41,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:36:41,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:36:41,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:36:41,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:36:41,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... [2018-11-23 12:36:41,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:36:41,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:36:41,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:36:41,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:36:41,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:36:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-23 12:36:41,164 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-23 12:36:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-23 12:36:41,164 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-23 12:36:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-23 12:36:41,164 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-23 12:36:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-23 12:36:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-23 12:36:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:36:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:36:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 12:36:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 12:36:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-23 12:36:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-23 12:36:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-23 12:36:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-23 12:36:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 12:36:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 12:36:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-23 12:36:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-23 12:36:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 12:36:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 12:36:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-23 12:36:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-23 12:36:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-23 12:36:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-23 12:36:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-23 12:36:41,167 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-23 12:36:41,167 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 12:36:41,167 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 12:36:41,167 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 12:36:41,167 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 12:36:41,167 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-23 12:36:41,167 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-23 12:36:41,167 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-23 12:36:41,167 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-23 12:36:41,167 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-23 12:36:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-23 12:36:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-23 12:36:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-23 12:36:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 12:36:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 12:36:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-23 12:36:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-23 12:36:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:36:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:36:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-23 12:36:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-23 12:36:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-23 12:36:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-23 12:36:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:36:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:36:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-23 12:36:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-23 12:36:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-23 12:36:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-23 12:36:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-23 12:36:41,170 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-23 12:36:41,170 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-23 12:36:41,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-23 12:36:41,504 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:41,504 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:41,575 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:41,575 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:41,624 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:41,624 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:41,683 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:41,684 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:41,746 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:41,747 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:41,943 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:41,943 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:41,986 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:41,986 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:41,999 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:42,000 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:42,142 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:36:42,142 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:36:42,157 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:36:42,157 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:36:42,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:36:42 BoogieIcfgContainer [2018-11-23 12:36:42,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:36:42,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:36:42,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:36:42,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:36:42,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:36:40" (1/3) ... [2018-11-23 12:36:42,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba49e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:36:42, skipping insertion in model container [2018-11-23 12:36:42,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:41" (2/3) ... [2018-11-23 12:36:42,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba49e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:36:42, skipping insertion in model container [2018-11-23 12:36:42,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:36:42" (3/3) ... [2018-11-23 12:36:42,163 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 12:36:42,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:36:42,176 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:36:42,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:36:42,214 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:36:42,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:36:42,215 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:36:42,215 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:36:42,215 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:36:42,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:36:42,215 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:36:42,215 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:36:42,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:36:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2018-11-23 12:36:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:36:42,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:42,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:42,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:42,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:42,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2018-11-23 12:36:42,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:42,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:42,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:42,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:42,443 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-23 12:36:42,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:42,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:42,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:42,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:42,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:42,460 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2018-11-23 12:36:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:42,605 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2018-11-23 12:36:42,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:42,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:36:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:42,616 INFO L225 Difference]: With dead ends: 887 [2018-11-23 12:36:42,617 INFO L226 Difference]: Without dead ends: 507 [2018-11-23 12:36:42,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-11-23 12:36:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-11-23 12:36:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-11-23 12:36:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2018-11-23 12:36:42,688 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2018-11-23 12:36:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:42,688 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2018-11-23 12:36:42,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2018-11-23 12:36:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:36:42,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:42,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:42,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:42,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2018-11-23 12:36:42,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:42,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:42,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:42,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-23 12:36:42,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:42,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:42,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:42,830 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2018-11-23 12:36:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:43,076 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2018-11-23 12:36:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:43,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:36:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:43,082 INFO L225 Difference]: With dead ends: 789 [2018-11-23 12:36:43,083 INFO L226 Difference]: Without dead ends: 670 [2018-11-23 12:36:43,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-23 12:36:43,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2018-11-23 12:36:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-23 12:36:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2018-11-23 12:36:43,116 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2018-11-23 12:36:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:43,117 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2018-11-23 12:36:43,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2018-11-23 12:36:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:36:43,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:43,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:43,119 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:43,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1491411356, now seen corresponding path program 1 times [2018-11-23 12:36:43,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:43,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:43,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:43,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:43,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:43,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-23 12:36:43,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:43,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:43,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:43,189 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2018-11-23 12:36:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:43,226 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2018-11-23 12:36:43,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:43,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:36:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:43,233 INFO L225 Difference]: With dead ends: 995 [2018-11-23 12:36:43,233 INFO L226 Difference]: Without dead ends: 819 [2018-11-23 12:36:43,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-23 12:36:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2018-11-23 12:36:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-11-23 12:36:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2018-11-23 12:36:43,269 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2018-11-23 12:36:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:43,269 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2018-11-23 12:36:43,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2018-11-23 12:36:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:36:43,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:43,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:43,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:43,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1315443348, now seen corresponding path program 1 times [2018-11-23 12:36:43,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:43,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:43,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:43,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:43,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:43,312 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-23 12:36:43,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:43,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:43,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:43,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:43,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:43,313 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2018-11-23 12:36:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:43,481 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2018-11-23 12:36:43,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:43,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:36:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:43,486 INFO L225 Difference]: With dead ends: 1424 [2018-11-23 12:36:43,487 INFO L226 Difference]: Without dead ends: 1160 [2018-11-23 12:36:43,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-11-23 12:36:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2018-11-23 12:36:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-11-23 12:36:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2018-11-23 12:36:43,535 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2018-11-23 12:36:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:43,536 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2018-11-23 12:36:43,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2018-11-23 12:36:43,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:36:43,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:43,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:43,537 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:43,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:43,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1932537431, now seen corresponding path program 1 times [2018-11-23 12:36:43,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:43,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:43,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:43,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:43,600 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-23 12:36:43,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:43,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:43,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:43,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:43,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:43,602 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2018-11-23 12:36:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:44,398 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2018-11-23 12:36:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:36:44,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:36:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:44,404 INFO L225 Difference]: With dead ends: 1562 [2018-11-23 12:36:44,404 INFO L226 Difference]: Without dead ends: 984 [2018-11-23 12:36:44,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:36:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-11-23 12:36:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2018-11-23 12:36:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-11-23 12:36:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2018-11-23 12:36:44,469 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2018-11-23 12:36:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:44,470 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2018-11-23 12:36:44,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2018-11-23 12:36:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:36:44,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:44,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:44,473 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:44,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash -487494679, now seen corresponding path program 1 times [2018-11-23 12:36:44,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:44,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:44,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:44,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:44,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:44,517 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-23 12:36:44,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:44,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:44,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:44,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:44,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:44,518 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2018-11-23 12:36:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:44,593 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2018-11-23 12:36:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:44,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 12:36:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:44,598 INFO L225 Difference]: With dead ends: 890 [2018-11-23 12:36:44,598 INFO L226 Difference]: Without dead ends: 886 [2018-11-23 12:36:44,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-23 12:36:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-11-23 12:36:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-11-23 12:36:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2018-11-23 12:36:44,644 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2018-11-23 12:36:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:44,644 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2018-11-23 12:36:44,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2018-11-23 12:36:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:36:44,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:44,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:44,646 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:44,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1261036943, now seen corresponding path program 1 times [2018-11-23 12:36:44,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:44,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:44,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:44,683 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-23 12:36:44,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:44,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:44,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:44,684 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2018-11-23 12:36:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:44,733 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2018-11-23 12:36:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:44,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:36:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:44,737 INFO L225 Difference]: With dead ends: 1274 [2018-11-23 12:36:44,737 INFO L226 Difference]: Without dead ends: 1015 [2018-11-23 12:36:44,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-11-23 12:36:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2018-11-23 12:36:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-23 12:36:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2018-11-23 12:36:44,782 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2018-11-23 12:36:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:44,783 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2018-11-23 12:36:44,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2018-11-23 12:36:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:36:44,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:44,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:44,784 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:44,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2018-11-23 12:36:44,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:44,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:44,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:44,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:44,821 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-23 12:36:44,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:44,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:44,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:44,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:44,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:44,822 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2018-11-23 12:36:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:44,872 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2018-11-23 12:36:44,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:44,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:36:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:44,876 INFO L225 Difference]: With dead ends: 972 [2018-11-23 12:36:44,876 INFO L226 Difference]: Without dead ends: 954 [2018-11-23 12:36:44,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-11-23 12:36:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2018-11-23 12:36:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-23 12:36:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2018-11-23 12:36:44,923 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2018-11-23 12:36:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:44,923 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2018-11-23 12:36:44,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2018-11-23 12:36:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:36:44,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:44,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:44,926 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:44,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1159920127, now seen corresponding path program 1 times [2018-11-23 12:36:44,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:44,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:44,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:44,980 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-23 12:36:44,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:44,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:44,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:44,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:44,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:44,981 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2018-11-23 12:36:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:45,045 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2018-11-23 12:36:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:45,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-23 12:36:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:45,049 INFO L225 Difference]: With dead ends: 1167 [2018-11-23 12:36:45,049 INFO L226 Difference]: Without dead ends: 925 [2018-11-23 12:36:45,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-23 12:36:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2018-11-23 12:36:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-23 12:36:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2018-11-23 12:36:45,095 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2018-11-23 12:36:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:45,096 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2018-11-23 12:36:45,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2018-11-23 12:36:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:36:45,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:45,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:45,098 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:45,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash -256141125, now seen corresponding path program 1 times [2018-11-23 12:36:45,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:45,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:45,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:45,133 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-23 12:36:45,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:45,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:36:45,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:36:45,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:36:45,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:36:45,134 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2018-11-23 12:36:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:45,447 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2018-11-23 12:36:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:36:45,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-23 12:36:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:45,452 INFO L225 Difference]: With dead ends: 1014 [2018-11-23 12:36:45,452 INFO L226 Difference]: Without dead ends: 785 [2018-11-23 12:36:45,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:36:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-23 12:36:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2018-11-23 12:36:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-11-23 12:36:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2018-11-23 12:36:45,500 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2018-11-23 12:36:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:45,500 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2018-11-23 12:36:45,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:36:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2018-11-23 12:36:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:36:45,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:45,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:45,503 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:45,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2018-11-23 12:36:45,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:45,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:45,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:45,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:45,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:45,535 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-23 12:36:45,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:45,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:45,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:45,536 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2018-11-23 12:36:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:45,597 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2018-11-23 12:36:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:45,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-23 12:36:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:45,600 INFO L225 Difference]: With dead ends: 871 [2018-11-23 12:36:45,600 INFO L226 Difference]: Without dead ends: 775 [2018-11-23 12:36:45,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-11-23 12:36:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2018-11-23 12:36:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-11-23 12:36:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2018-11-23 12:36:45,639 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2018-11-23 12:36:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:45,639 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2018-11-23 12:36:45,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2018-11-23 12:36:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:36:45,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:45,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:45,641 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:45,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:45,641 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2018-11-23 12:36:45,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:45,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:45,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:45,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:45,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:45,669 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-23 12:36:45,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:45,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:45,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:45,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:45,670 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2018-11-23 12:36:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:45,766 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2018-11-23 12:36:45,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:45,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 12:36:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:45,770 INFO L225 Difference]: With dead ends: 938 [2018-11-23 12:36:45,770 INFO L226 Difference]: Without dead ends: 928 [2018-11-23 12:36:45,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-11-23 12:36:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2018-11-23 12:36:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-11-23 12:36:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2018-11-23 12:36:45,814 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2018-11-23 12:36:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:45,814 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2018-11-23 12:36:45,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2018-11-23 12:36:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:36:45,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:45,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:45,816 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:45,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:45,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2018-11-23 12:36:45,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:45,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:45,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:45,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:45,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:45,886 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-23 12:36:45,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:45,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:36:45,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:36:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:36:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:36:45,887 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2018-11-23 12:36:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:46,014 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2018-11-23 12:36:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:36:46,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:36:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:46,018 INFO L225 Difference]: With dead ends: 851 [2018-11-23 12:36:46,018 INFO L226 Difference]: Without dead ends: 847 [2018-11-23 12:36:46,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:36:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-11-23 12:36:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2018-11-23 12:36:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-23 12:36:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2018-11-23 12:36:46,064 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2018-11-23 12:36:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:46,064 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2018-11-23 12:36:46,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:36:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2018-11-23 12:36:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:36:46,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:46,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:46,066 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:46,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2018-11-23 12:36:46,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:46,131 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-23 12:36:46,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:46,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:36:46,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:36:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:36:46,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:36:46,132 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2018-11-23 12:36:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:46,237 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2018-11-23 12:36:46,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:36:46,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:36:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:46,241 INFO L225 Difference]: With dead ends: 886 [2018-11-23 12:36:46,241 INFO L226 Difference]: Without dead ends: 865 [2018-11-23 12:36:46,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:36:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-23 12:36:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2018-11-23 12:36:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-11-23 12:36:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2018-11-23 12:36:46,289 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2018-11-23 12:36:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:46,289 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2018-11-23 12:36:46,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:36:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2018-11-23 12:36:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:36:46,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:46,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:46,291 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:46,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:46,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2018-11-23 12:36:46,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:46,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:46,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:46,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:46,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:46,321 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-23 12:36:46,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:46,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:46,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:46,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:46,322 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2018-11-23 12:36:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:46,435 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2018-11-23 12:36:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:46,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-23 12:36:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:46,440 INFO L225 Difference]: With dead ends: 1081 [2018-11-23 12:36:46,440 INFO L226 Difference]: Without dead ends: 1049 [2018-11-23 12:36:46,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-11-23 12:36:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2018-11-23 12:36:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-11-23 12:36:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2018-11-23 12:36:46,500 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2018-11-23 12:36:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:46,500 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2018-11-23 12:36:46,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2018-11-23 12:36:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:36:46,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:46,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:46,503 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:46,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2018-11-23 12:36:46,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:46,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:46,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:46,532 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-23 12:36:46,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:46,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:36:46,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:36:46,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:36:46,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:36:46,533 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2018-11-23 12:36:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:46,595 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2018-11-23 12:36:46,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:36:46,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-23 12:36:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:46,599 INFO L225 Difference]: With dead ends: 966 [2018-11-23 12:36:46,599 INFO L226 Difference]: Without dead ends: 944 [2018-11-23 12:36:46,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-11-23 12:36:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2018-11-23 12:36:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-11-23 12:36:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2018-11-23 12:36:46,668 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2018-11-23 12:36:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:46,669 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2018-11-23 12:36:46,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:36:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2018-11-23 12:36:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:36:46,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:46,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:46,671 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:46,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2018-11-23 12:36:46,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:46,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:46,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:46,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:46,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:46,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-23 12:36:46,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:46,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:36:46,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:36:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:36:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:36:46,748 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2018-11-23 12:36:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:47,370 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2018-11-23 12:36:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:36:47,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-23 12:36:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:47,373 INFO L225 Difference]: With dead ends: 1110 [2018-11-23 12:36:47,373 INFO L226 Difference]: Without dead ends: 1016 [2018-11-23 12:36:47,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:36:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-11-23 12:36:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2018-11-23 12:36:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-23 12:36:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2018-11-23 12:36:47,409 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2018-11-23 12:36:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:47,409 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2018-11-23 12:36:47,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:36:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2018-11-23 12:36:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:36:47,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:47,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:47,412 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:47,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2018-11-23 12:36:47,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:47,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:47,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:47,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:47,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:47,477 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-23 12:36:47,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:47,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 12:36:47,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:36:47,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:36:47,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:36:47,478 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 9 states. [2018-11-23 12:36:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:48,804 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2018-11-23 12:36:48,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:36:48,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-23 12:36:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:48,807 INFO L225 Difference]: With dead ends: 1188 [2018-11-23 12:36:48,807 INFO L226 Difference]: Without dead ends: 1119 [2018-11-23 12:36:48,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:36:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-11-23 12:36:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 887. [2018-11-23 12:36:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-11-23 12:36:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1205 transitions. [2018-11-23 12:36:48,842 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1205 transitions. Word has length 50 [2018-11-23 12:36:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:48,842 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1205 transitions. [2018-11-23 12:36:48,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:36:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1205 transitions. [2018-11-23 12:36:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:36:48,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:48,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:48,844 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:48,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:48,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2018-11-23 12:36:48,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:48,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:48,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:48,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:48,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:48,871 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-23 12:36:48,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:48,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:48,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:48,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:48,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:48,872 INFO L87 Difference]: Start difference. First operand 887 states and 1205 transitions. Second operand 3 states. [2018-11-23 12:36:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:48,933 INFO L93 Difference]: Finished difference Result 912 states and 1233 transitions. [2018-11-23 12:36:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:48,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-23 12:36:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:48,936 INFO L225 Difference]: With dead ends: 912 [2018-11-23 12:36:48,936 INFO L226 Difference]: Without dead ends: 907 [2018-11-23 12:36:48,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-23 12:36:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 903. [2018-11-23 12:36:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-11-23 12:36:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2018-11-23 12:36:48,969 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 52 [2018-11-23 12:36:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:48,970 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2018-11-23 12:36:48,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2018-11-23 12:36:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:36:48,973 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:48,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:48,973 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:48,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2018-11-23 12:36:48,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:48,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:48,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:48,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:49,003 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-23 12:36:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:49,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:49,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:49,004 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand 3 states. [2018-11-23 12:36:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:49,064 INFO L93 Difference]: Finished difference Result 1116 states and 1511 transitions. [2018-11-23 12:36:49,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:49,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-23 12:36:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:49,067 INFO L225 Difference]: With dead ends: 1116 [2018-11-23 12:36:49,067 INFO L226 Difference]: Without dead ends: 875 [2018-11-23 12:36:49,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-11-23 12:36:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2018-11-23 12:36:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-23 12:36:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1187 transitions. [2018-11-23 12:36:49,099 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1187 transitions. Word has length 54 [2018-11-23 12:36:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:49,099 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1187 transitions. [2018-11-23 12:36:49,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1187 transitions. [2018-11-23 12:36:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:36:49,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:49,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:49,101 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:49,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2018-11-23 12:36:49,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:49,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:49,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:49,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:36:49,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:49,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:49,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:49,153 INFO L87 Difference]: Start difference. First operand 875 states and 1187 transitions. Second operand 5 states. [2018-11-23 12:36:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:49,461 INFO L93 Difference]: Finished difference Result 885 states and 1195 transitions. [2018-11-23 12:36:49,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:49,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-23 12:36:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:49,464 INFO L225 Difference]: With dead ends: 885 [2018-11-23 12:36:49,464 INFO L226 Difference]: Without dead ends: 879 [2018-11-23 12:36:49,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-23 12:36:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 875. [2018-11-23 12:36:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-23 12:36:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1186 transitions. [2018-11-23 12:36:49,497 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1186 transitions. Word has length 53 [2018-11-23 12:36:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:49,498 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1186 transitions. [2018-11-23 12:36:49,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1186 transitions. [2018-11-23 12:36:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:36:49,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:49,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:49,500 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:49,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2018-11-23 12:36:49,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:49,548 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-23 12:36:49,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:49,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:49,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:49,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:49,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:49,549 INFO L87 Difference]: Start difference. First operand 875 states and 1186 transitions. Second operand 5 states. [2018-11-23 12:36:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:49,854 INFO L93 Difference]: Finished difference Result 887 states and 1197 transitions. [2018-11-23 12:36:49,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:49,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-23 12:36:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:49,858 INFO L225 Difference]: With dead ends: 887 [2018-11-23 12:36:49,858 INFO L226 Difference]: Without dead ends: 851 [2018-11-23 12:36:49,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-23 12:36:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 847. [2018-11-23 12:36:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-11-23 12:36:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1154 transitions. [2018-11-23 12:36:49,894 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1154 transitions. Word has length 52 [2018-11-23 12:36:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:49,894 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1154 transitions. [2018-11-23 12:36:49,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1154 transitions. [2018-11-23 12:36:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:36:49,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:49,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:49,896 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:49,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2018-11-23 12:36:49,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:49,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:49,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:49,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:49,929 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-23 12:36:49,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:49,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:49,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:49,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:49,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:49,930 INFO L87 Difference]: Start difference. First operand 847 states and 1154 transitions. Second operand 5 states. [2018-11-23 12:36:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:50,288 INFO L93 Difference]: Finished difference Result 855 states and 1160 transitions. [2018-11-23 12:36:50,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:50,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-23 12:36:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:50,291 INFO L225 Difference]: With dead ends: 855 [2018-11-23 12:36:50,291 INFO L226 Difference]: Without dead ends: 849 [2018-11-23 12:36:50,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-23 12:36:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2018-11-23 12:36:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-11-23 12:36:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2018-11-23 12:36:50,346 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2018-11-23 12:36:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:50,346 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2018-11-23 12:36:50,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2018-11-23 12:36:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:36:50,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:50,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:50,348 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:50,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:50,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2018-11-23 12:36:50,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:50,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:50,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:50,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:50,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:50,413 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-23 12:36:50,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:50,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:36:50,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:36:50,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:36:50,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:36:50,414 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 4 states. [2018-11-23 12:36:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:50,579 INFO L93 Difference]: Finished difference Result 886 states and 1194 transitions. [2018-11-23 12:36:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:36:50,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-23 12:36:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:50,583 INFO L225 Difference]: With dead ends: 886 [2018-11-23 12:36:50,583 INFO L226 Difference]: Without dead ends: 854 [2018-11-23 12:36:50,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-23 12:36:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 849. [2018-11-23 12:36:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-23 12:36:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1155 transitions. [2018-11-23 12:36:50,651 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1155 transitions. Word has length 55 [2018-11-23 12:36:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:50,651 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1155 transitions. [2018-11-23 12:36:50,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:36:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1155 transitions. [2018-11-23 12:36:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:36:50,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:50,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:50,655 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:50,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1261798154, now seen corresponding path program 1 times [2018-11-23 12:36:50,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:50,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:50,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:50,745 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-23 12:36:50,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:50,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 12:36:50,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:36:50,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:36:50,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:36:50,746 INFO L87 Difference]: Start difference. First operand 849 states and 1155 transitions. Second operand 9 states. [2018-11-23 12:36:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:51,005 INFO L93 Difference]: Finished difference Result 876 states and 1185 transitions. [2018-11-23 12:36:51,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:36:51,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-23 12:36:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:51,009 INFO L225 Difference]: With dead ends: 876 [2018-11-23 12:36:51,009 INFO L226 Difference]: Without dead ends: 838 [2018-11-23 12:36:51,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-23 12:36:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-11-23 12:36:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-23 12:36:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2018-11-23 12:36:51,065 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2018-11-23 12:36:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:51,066 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2018-11-23 12:36:51,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:36:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2018-11-23 12:36:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:36:51,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:51,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:51,068 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:51,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -405944758, now seen corresponding path program 1 times [2018-11-23 12:36:51,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:51,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:51,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:36:51,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:51,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:36:51,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:36:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:36:51,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:36:51,171 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2018-11-23 12:36:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:51,379 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2018-11-23 12:36:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:36:51,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-23 12:36:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:51,383 INFO L225 Difference]: With dead ends: 854 [2018-11-23 12:36:51,383 INFO L226 Difference]: Without dead ends: 836 [2018-11-23 12:36:51,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-11-23 12:36:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2018-11-23 12:36:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-11-23 12:36:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2018-11-23 12:36:51,440 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 56 [2018-11-23 12:36:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:51,441 INFO L480 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2018-11-23 12:36:51,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:36:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2018-11-23 12:36:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:36:51,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:51,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:51,445 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:51,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:51,445 INFO L82 PathProgramCache]: Analyzing trace with hash 64942578, now seen corresponding path program 1 times [2018-11-23 12:36:51,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:51,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:51,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:51,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-23 12:36:51,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:51,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:36:51,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:36:51,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:36:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:36:51,547 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2018-11-23 12:36:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:51,784 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2018-11-23 12:36:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:36:51,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-23 12:36:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:51,788 INFO L225 Difference]: With dead ends: 849 [2018-11-23 12:36:51,788 INFO L226 Difference]: Without dead ends: 831 [2018-11-23 12:36:51,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-23 12:36:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-11-23 12:36:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-11-23 12:36:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2018-11-23 12:36:51,844 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 55 [2018-11-23 12:36:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:51,844 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2018-11-23 12:36:51,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:36:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2018-11-23 12:36:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:36:51,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:51,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:51,847 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:51,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:51,847 INFO L82 PathProgramCache]: Analyzing trace with hash 804739700, now seen corresponding path program 1 times [2018-11-23 12:36:51,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:51,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:51,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:51,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:51,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:51,902 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-23 12:36:51,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:51,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:51,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:51,903 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 5 states. [2018-11-23 12:36:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:52,507 INFO L93 Difference]: Finished difference Result 1378 states and 1925 transitions. [2018-11-23 12:36:52,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:36:52,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 12:36:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:52,513 INFO L225 Difference]: With dead ends: 1378 [2018-11-23 12:36:52,513 INFO L226 Difference]: Without dead ends: 1214 [2018-11-23 12:36:52,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:36:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-11-23 12:36:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 869. [2018-11-23 12:36:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-23 12:36:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1173 transitions. [2018-11-23 12:36:52,600 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1173 transitions. Word has length 61 [2018-11-23 12:36:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:52,600 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1173 transitions. [2018-11-23 12:36:52,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1173 transitions. [2018-11-23 12:36:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:36:52,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:52,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:52,603 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:52,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2018-11-23 12:36:52,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:52,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:52,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:52,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-23 12:36:52,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:52,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:36:52,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:36:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:36:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:52,797 INFO L87 Difference]: Start difference. First operand 869 states and 1173 transitions. Second operand 11 states. [2018-11-23 12:36:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:52,993 INFO L93 Difference]: Finished difference Result 886 states and 1191 transitions. [2018-11-23 12:36:52,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:36:52,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-23 12:36:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:52,998 INFO L225 Difference]: With dead ends: 886 [2018-11-23 12:36:52,998 INFO L226 Difference]: Without dead ends: 866 [2018-11-23 12:36:52,999 INFO L631 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-23 12:36:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-11-23 12:36:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2018-11-23 12:36:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-11-23 12:36:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1168 transitions. [2018-11-23 12:36:53,060 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1168 transitions. Word has length 58 [2018-11-23 12:36:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:53,061 INFO L480 AbstractCegarLoop]: Abstraction has 866 states and 1168 transitions. [2018-11-23 12:36:53,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:36:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1168 transitions. [2018-11-23 12:36:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:36:53,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:53,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:53,066 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:53,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1661318765, now seen corresponding path program 1 times [2018-11-23 12:36:53,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:53,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:53,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:53,154 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-23 12:36:53,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:53,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:53,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:53,155 INFO L87 Difference]: Start difference. First operand 866 states and 1168 transitions. Second operand 5 states. [2018-11-23 12:36:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:53,353 INFO L93 Difference]: Finished difference Result 901 states and 1210 transitions. [2018-11-23 12:36:53,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:53,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-23 12:36:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:53,357 INFO L225 Difference]: With dead ends: 901 [2018-11-23 12:36:53,357 INFO L226 Difference]: Without dead ends: 873 [2018-11-23 12:36:53,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-11-23 12:36:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 871. [2018-11-23 12:36:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-11-23 12:36:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1177 transitions. [2018-11-23 12:36:53,427 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1177 transitions. Word has length 62 [2018-11-23 12:36:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:53,427 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1177 transitions. [2018-11-23 12:36:53,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1177 transitions. [2018-11-23 12:36:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:36:53,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:53,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:53,429 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:53,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash -894292447, now seen corresponding path program 1 times [2018-11-23 12:36:53,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:53,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:53,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:53,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-23 12:36:53,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:53,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 12:36:53,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:36:53,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:36:53,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:36:53,547 INFO L87 Difference]: Start difference. First operand 871 states and 1177 transitions. Second operand 12 states. [2018-11-23 12:36:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:53,730 INFO L93 Difference]: Finished difference Result 897 states and 1206 transitions. [2018-11-23 12:36:53,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:36:53,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-23 12:36:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:53,733 INFO L225 Difference]: With dead ends: 897 [2018-11-23 12:36:53,733 INFO L226 Difference]: Without dead ends: 872 [2018-11-23 12:36:53,733 INFO L631 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-23 12:36:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-11-23 12:36:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-11-23 12:36:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-23 12:36:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1166 transitions. [2018-11-23 12:36:53,768 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1166 transitions. Word has length 59 [2018-11-23 12:36:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:53,769 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1166 transitions. [2018-11-23 12:36:53,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:36:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1166 transitions. [2018-11-23 12:36:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:36:53,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:53,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:53,771 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:53,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2018-11-23 12:36:53,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:53,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:53,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:53,824 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-23 12:36:53,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:53,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:53,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:53,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:53,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:53,825 INFO L87 Difference]: Start difference. First operand 870 states and 1166 transitions. Second operand 3 states. [2018-11-23 12:36:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:53,855 INFO L93 Difference]: Finished difference Result 904 states and 1200 transitions. [2018-11-23 12:36:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:53,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-23 12:36:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:53,858 INFO L225 Difference]: With dead ends: 904 [2018-11-23 12:36:53,859 INFO L226 Difference]: Without dead ends: 872 [2018-11-23 12:36:53,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-11-23 12:36:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-11-23 12:36:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-23 12:36:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1165 transitions. [2018-11-23 12:36:53,894 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1165 transitions. Word has length 59 [2018-11-23 12:36:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:53,894 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1165 transitions. [2018-11-23 12:36:53,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1165 transitions. [2018-11-23 12:36:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:36:53,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:53,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:53,896 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:53,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:53,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1685241316, now seen corresponding path program 1 times [2018-11-23 12:36:53,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:53,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:53,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:53,954 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-23 12:36:53,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:53,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 12:36:53,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:36:53,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:36:53,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:36:53,955 INFO L87 Difference]: Start difference. First operand 870 states and 1165 transitions. Second operand 9 states. [2018-11-23 12:36:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:54,067 INFO L93 Difference]: Finished difference Result 892 states and 1188 transitions. [2018-11-23 12:36:54,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:36:54,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-23 12:36:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:54,070 INFO L225 Difference]: With dead ends: 892 [2018-11-23 12:36:54,071 INFO L226 Difference]: Without dead ends: 858 [2018-11-23 12:36:54,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-23 12:36:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2018-11-23 12:36:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-11-23 12:36:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1145 transitions. [2018-11-23 12:36:54,109 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1145 transitions. Word has length 59 [2018-11-23 12:36:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:54,110 INFO L480 AbstractCegarLoop]: Abstraction has 858 states and 1145 transitions. [2018-11-23 12:36:54,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:36:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1145 transitions. [2018-11-23 12:36:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:36:54,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:54,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:54,112 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:54,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2018-11-23 12:36:54,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:54,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:54,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:54,155 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-23 12:36:54,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:54,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:36:54,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:36:54,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:36:54,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:36:54,156 INFO L87 Difference]: Start difference. First operand 858 states and 1145 transitions. Second operand 4 states. [2018-11-23 12:36:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:54,280 INFO L93 Difference]: Finished difference Result 1019 states and 1374 transitions. [2018-11-23 12:36:54,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:36:54,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-23 12:36:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:54,283 INFO L225 Difference]: With dead ends: 1019 [2018-11-23 12:36:54,283 INFO L226 Difference]: Without dead ends: 903 [2018-11-23 12:36:54,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-11-23 12:36:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 865. [2018-11-23 12:36:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-23 12:36:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1161 transitions. [2018-11-23 12:36:54,316 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1161 transitions. Word has length 60 [2018-11-23 12:36:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:54,317 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1161 transitions. [2018-11-23 12:36:54,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:36:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1161 transitions. [2018-11-23 12:36:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:36:54,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:54,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:54,319 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:54,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2018-11-23 12:36:54,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:54,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:54,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:54,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:54,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:54,376 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-23 12:36:54,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:54,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:36:54,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:36:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:36:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:54,377 INFO L87 Difference]: Start difference. First operand 865 states and 1161 transitions. Second operand 11 states. [2018-11-23 12:36:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:54,465 INFO L93 Difference]: Finished difference Result 934 states and 1254 transitions. [2018-11-23 12:36:54,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:36:54,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-23 12:36:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:54,468 INFO L225 Difference]: With dead ends: 934 [2018-11-23 12:36:54,468 INFO L226 Difference]: Without dead ends: 879 [2018-11-23 12:36:54,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:36:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-23 12:36:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 869. [2018-11-23 12:36:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-23 12:36:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1179 transitions. [2018-11-23 12:36:54,502 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1179 transitions. Word has length 60 [2018-11-23 12:36:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:54,502 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1179 transitions. [2018-11-23 12:36:54,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:36:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1179 transitions. [2018-11-23 12:36:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:36:54,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:54,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:54,504 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:54,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:54,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2018-11-23 12:36:54,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:54,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:54,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:54,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:54,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:54,555 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-23 12:36:54,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:54,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 12:36:54,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:36:54,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:36:54,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:36:54,556 INFO L87 Difference]: Start difference. First operand 869 states and 1179 transitions. Second operand 9 states. [2018-11-23 12:36:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:54,670 INFO L93 Difference]: Finished difference Result 900 states and 1216 transitions. [2018-11-23 12:36:54,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:36:54,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-23 12:36:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:54,673 INFO L225 Difference]: With dead ends: 900 [2018-11-23 12:36:54,673 INFO L226 Difference]: Without dead ends: 861 [2018-11-23 12:36:54,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-11-23 12:36:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2018-11-23 12:36:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-11-23 12:36:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1163 transitions. [2018-11-23 12:36:54,707 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1163 transitions. Word has length 60 [2018-11-23 12:36:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:54,707 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1163 transitions. [2018-11-23 12:36:54,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:36:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1163 transitions. [2018-11-23 12:36:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:36:54,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:54,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:54,709 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:54,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2018-11-23 12:36:54,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:54,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:54,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:54,818 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-23 12:36:54,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:54,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 12:36:54,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:36:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:36:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:36:54,819 INFO L87 Difference]: Start difference. First operand 861 states and 1163 transitions. Second operand 13 states. [2018-11-23 12:36:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:55,004 INFO L93 Difference]: Finished difference Result 878 states and 1181 transitions. [2018-11-23 12:36:55,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:36:55,005 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 12:36:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:55,007 INFO L225 Difference]: With dead ends: 878 [2018-11-23 12:36:55,007 INFO L226 Difference]: Without dead ends: 856 [2018-11-23 12:36:55,008 INFO L631 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-23 12:36:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-23 12:36:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-23 12:36:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-23 12:36:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1156 transitions. [2018-11-23 12:36:55,041 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1156 transitions. Word has length 62 [2018-11-23 12:36:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:55,041 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1156 transitions. [2018-11-23 12:36:55,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:36:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1156 transitions. [2018-11-23 12:36:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:36:55,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:55,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:55,044 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:55,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2018-11-23 12:36:55,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:55,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:55,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:55,067 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-23 12:36:55,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:55,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:55,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:55,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:55,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:55,068 INFO L87 Difference]: Start difference. First operand 856 states and 1156 transitions. Second operand 3 states. [2018-11-23 12:36:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:55,096 INFO L93 Difference]: Finished difference Result 1134 states and 1533 transitions. [2018-11-23 12:36:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:55,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-23 12:36:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:55,099 INFO L225 Difference]: With dead ends: 1134 [2018-11-23 12:36:55,099 INFO L226 Difference]: Without dead ends: 795 [2018-11-23 12:36:55,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-11-23 12:36:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 746. [2018-11-23 12:36:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-11-23 12:36:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 973 transitions. [2018-11-23 12:36:55,129 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 973 transitions. Word has length 62 [2018-11-23 12:36:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:55,129 INFO L480 AbstractCegarLoop]: Abstraction has 746 states and 973 transitions. [2018-11-23 12:36:55,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 973 transitions. [2018-11-23 12:36:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:36:55,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:55,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:55,131 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:55,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash -930632011, now seen corresponding path program 1 times [2018-11-23 12:36:55,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:55,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:55,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:55,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:55,211 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-23 12:36:55,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:55,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 12:36:55,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:36:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:36:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:36:55,212 INFO L87 Difference]: Start difference. First operand 746 states and 973 transitions. Second operand 12 states. [2018-11-23 12:36:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:55,351 INFO L93 Difference]: Finished difference Result 768 states and 996 transitions. [2018-11-23 12:36:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:36:55,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-23 12:36:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:55,354 INFO L225 Difference]: With dead ends: 768 [2018-11-23 12:36:55,354 INFO L226 Difference]: Without dead ends: 744 [2018-11-23 12:36:55,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:36:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-11-23 12:36:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-11-23 12:36:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-23 12:36:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 968 transitions. [2018-11-23 12:36:55,402 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 968 transitions. Word has length 63 [2018-11-23 12:36:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:55,402 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 968 transitions. [2018-11-23 12:36:55,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:36:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 968 transitions. [2018-11-23 12:36:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:36:55,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:55,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:55,404 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:55,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:55,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1932048657, now seen corresponding path program 1 times [2018-11-23 12:36:55,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:55,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:55,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:55,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:36:55,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:55,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 12:36:55,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:36:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:36:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:36:55,476 INFO L87 Difference]: Start difference. First operand 744 states and 968 transitions. Second operand 12 states. [2018-11-23 12:36:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:55,613 INFO L93 Difference]: Finished difference Result 768 states and 993 transitions. [2018-11-23 12:36:55,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:36:55,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-23 12:36:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:55,616 INFO L225 Difference]: With dead ends: 768 [2018-11-23 12:36:55,616 INFO L226 Difference]: Without dead ends: 744 [2018-11-23 12:36:55,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:36:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-11-23 12:36:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2018-11-23 12:36:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-11-23 12:36:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 964 transitions. [2018-11-23 12:36:55,646 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 964 transitions. Word has length 62 [2018-11-23 12:36:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:55,646 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 964 transitions. [2018-11-23 12:36:55,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:36:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 964 transitions. [2018-11-23 12:36:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:36:55,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:55,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:55,648 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:55,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:55,649 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2018-11-23 12:36:55,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:55,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:55,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:55,749 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-23 12:36:55,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:55,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 12:36:55,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:36:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:36:55,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:36:55,750 INFO L87 Difference]: Start difference. First operand 742 states and 964 transitions. Second operand 13 states. [2018-11-23 12:36:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:55,913 INFO L93 Difference]: Finished difference Result 759 states and 982 transitions. [2018-11-23 12:36:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:36:55,914 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-23 12:36:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:55,915 INFO L225 Difference]: With dead ends: 759 [2018-11-23 12:36:55,915 INFO L226 Difference]: Without dead ends: 737 [2018-11-23 12:36:55,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:36:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-23 12:36:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2018-11-23 12:36:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-23 12:36:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 957 transitions. [2018-11-23 12:36:55,944 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 957 transitions. Word has length 63 [2018-11-23 12:36:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:55,945 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 957 transitions. [2018-11-23 12:36:55,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:36:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 957 transitions. [2018-11-23 12:36:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:36:55,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:55,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:55,947 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:55,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:55,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1755012540, now seen corresponding path program 1 times [2018-11-23 12:36:55,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:55,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:55,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:55,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:55,968 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-23 12:36:55,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:55,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:55,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:55,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:55,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:55,969 INFO L87 Difference]: Start difference. First operand 737 states and 957 transitions. Second operand 3 states. [2018-11-23 12:36:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:56,000 INFO L93 Difference]: Finished difference Result 867 states and 1130 transitions. [2018-11-23 12:36:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:56,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-23 12:36:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:56,003 INFO L225 Difference]: With dead ends: 867 [2018-11-23 12:36:56,003 INFO L226 Difference]: Without dead ends: 737 [2018-11-23 12:36:56,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-23 12:36:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2018-11-23 12:36:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-23 12:36:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 954 transitions. [2018-11-23 12:36:56,032 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 954 transitions. Word has length 66 [2018-11-23 12:36:56,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:56,032 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 954 transitions. [2018-11-23 12:36:56,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 954 transitions. [2018-11-23 12:36:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 12:36:56,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:56,034 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:56,034 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:56,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 500473129, now seen corresponding path program 1 times [2018-11-23 12:36:56,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:56,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:56,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:56,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:56,069 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-23 12:36:56,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:56,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:56,070 INFO L87 Difference]: Start difference. First operand 737 states and 954 transitions. Second operand 3 states. [2018-11-23 12:36:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:56,113 INFO L93 Difference]: Finished difference Result 946 states and 1222 transitions. [2018-11-23 12:36:56,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:56,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-23 12:36:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:56,115 INFO L225 Difference]: With dead ends: 946 [2018-11-23 12:36:56,115 INFO L226 Difference]: Without dead ends: 809 [2018-11-23 12:36:56,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-23 12:36:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 778. [2018-11-23 12:36:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-11-23 12:36:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1005 transitions. [2018-11-23 12:36:56,148 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1005 transitions. Word has length 80 [2018-11-23 12:36:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:56,148 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 1005 transitions. [2018-11-23 12:36:56,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1005 transitions. [2018-11-23 12:36:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:36:56,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:56,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:56,150 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:56,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2018-11-23 12:36:56,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:56,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:56,183 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-23 12:36:56,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:56,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:56,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:56,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:56,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:56,184 INFO L87 Difference]: Start difference. First operand 778 states and 1005 transitions. Second operand 5 states. [2018-11-23 12:36:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:56,252 INFO L93 Difference]: Finished difference Result 832 states and 1064 transitions. [2018-11-23 12:36:56,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:56,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-23 12:36:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:56,253 INFO L225 Difference]: With dead ends: 832 [2018-11-23 12:36:56,253 INFO L226 Difference]: Without dead ends: 780 [2018-11-23 12:36:56,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-11-23 12:36:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 778. [2018-11-23 12:36:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-11-23 12:36:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1004 transitions. [2018-11-23 12:36:56,285 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1004 transitions. Word has length 65 [2018-11-23 12:36:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:56,285 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 1004 transitions. [2018-11-23 12:36:56,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1004 transitions. [2018-11-23 12:36:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:36:56,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:56,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:56,287 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:56,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash 21902732, now seen corresponding path program 1 times [2018-11-23 12:36:56,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:56,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:56,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:56,337 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-23 12:36:56,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:56,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:56,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:56,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:56,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:56,338 INFO L87 Difference]: Start difference. First operand 778 states and 1004 transitions. Second operand 5 states. [2018-11-23 12:36:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:56,442 INFO L93 Difference]: Finished difference Result 842 states and 1079 transitions. [2018-11-23 12:36:56,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:36:56,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-23 12:36:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:56,445 INFO L225 Difference]: With dead ends: 842 [2018-11-23 12:36:56,445 INFO L226 Difference]: Without dead ends: 809 [2018-11-23 12:36:56,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:36:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-23 12:36:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 784. [2018-11-23 12:36:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-11-23 12:36:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1011 transitions. [2018-11-23 12:36:56,483 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1011 transitions. Word has length 65 [2018-11-23 12:36:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:56,483 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 1011 transitions. [2018-11-23 12:36:56,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1011 transitions. [2018-11-23 12:36:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:36:56,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:56,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:56,485 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:56,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash -900473525, now seen corresponding path program 1 times [2018-11-23 12:36:56,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:56,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:56,583 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-23 12:36:56,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:56,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 12:36:56,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:36:56,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:36:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:36:56,584 INFO L87 Difference]: Start difference. First operand 784 states and 1011 transitions. Second operand 12 states. [2018-11-23 12:36:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:56,723 INFO L93 Difference]: Finished difference Result 807 states and 1035 transitions. [2018-11-23 12:36:56,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:36:56,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:36:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:56,725 INFO L225 Difference]: With dead ends: 807 [2018-11-23 12:36:56,725 INFO L226 Difference]: Without dead ends: 784 [2018-11-23 12:36:56,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:36:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-11-23 12:36:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2018-11-23 12:36:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-11-23 12:36:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1010 transitions. [2018-11-23 12:36:56,791 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1010 transitions. Word has length 70 [2018-11-23 12:36:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:56,791 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 1010 transitions. [2018-11-23 12:36:56,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:36:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1010 transitions. [2018-11-23 12:36:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:36:56,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:56,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:56,793 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:56,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:56,793 INFO L82 PathProgramCache]: Analyzing trace with hash 813191735, now seen corresponding path program 1 times [2018-11-23 12:36:56,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:56,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:56,919 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-23 12:36:56,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:56,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 12:36:56,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:36:56,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:36:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:36:56,920 INFO L87 Difference]: Start difference. First operand 784 states and 1010 transitions. Second operand 12 states. [2018-11-23 12:36:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:57,099 INFO L93 Difference]: Finished difference Result 808 states and 1035 transitions. [2018-11-23 12:36:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:36:57,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-23 12:36:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:57,101 INFO L225 Difference]: With dead ends: 808 [2018-11-23 12:36:57,101 INFO L226 Difference]: Without dead ends: 784 [2018-11-23 12:36:57,102 INFO L631 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-23 12:36:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-11-23 12:36:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2018-11-23 12:36:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-11-23 12:36:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1006 transitions. [2018-11-23 12:36:57,135 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1006 transitions. Word has length 67 [2018-11-23 12:36:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:57,135 INFO L480 AbstractCegarLoop]: Abstraction has 782 states and 1006 transitions. [2018-11-23 12:36:57,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:36:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1006 transitions. [2018-11-23 12:36:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:36:57,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:57,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:57,137 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:57,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1253285750, now seen corresponding path program 1 times [2018-11-23 12:36:57,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:57,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:57,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:57,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:36:57,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:57,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 12:36:57,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:36:57,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:36:57,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:36:57,217 INFO L87 Difference]: Start difference. First operand 782 states and 1006 transitions. Second operand 12 states. [2018-11-23 12:36:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:57,342 INFO L93 Difference]: Finished difference Result 804 states and 1029 transitions. [2018-11-23 12:36:57,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:36:57,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-23 12:36:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:57,345 INFO L225 Difference]: With dead ends: 804 [2018-11-23 12:36:57,345 INFO L226 Difference]: Without dead ends: 780 [2018-11-23 12:36:57,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:36:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-11-23 12:36:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2018-11-23 12:36:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-11-23 12:36:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1002 transitions. [2018-11-23 12:36:57,379 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1002 transitions. Word has length 66 [2018-11-23 12:36:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:57,379 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 1002 transitions. [2018-11-23 12:36:57,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:36:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1002 transitions. [2018-11-23 12:36:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:36:57,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:57,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:57,381 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:57,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash 544587914, now seen corresponding path program 1 times [2018-11-23 12:36:57,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:57,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:57,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:57,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:57,451 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-23 12:36:57,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:57,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:36:57,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:36:57,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:36:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:57,452 INFO L87 Difference]: Start difference. First operand 780 states and 1002 transitions. Second operand 11 states. [2018-11-23 12:36:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:57,555 INFO L93 Difference]: Finished difference Result 802 states and 1025 transitions. [2018-11-23 12:36:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:36:57,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-23 12:36:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:57,559 INFO L225 Difference]: With dead ends: 802 [2018-11-23 12:36:57,559 INFO L226 Difference]: Without dead ends: 776 [2018-11-23 12:36:57,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:36:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-11-23 12:36:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 770. [2018-11-23 12:36:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-11-23 12:36:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 988 transitions. [2018-11-23 12:36:57,591 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 988 transitions. Word has length 66 [2018-11-23 12:36:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:57,591 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 988 transitions. [2018-11-23 12:36:57,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:36:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 988 transitions. [2018-11-23 12:36:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:36:57,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:57,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:57,593 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:57,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2018-11-23 12:36:57,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:57,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:57,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:57,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:57,623 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-23 12:36:57,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:57,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:57,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:57,624 INFO L87 Difference]: Start difference. First operand 770 states and 988 transitions. Second operand 5 states. [2018-11-23 12:36:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:57,700 INFO L93 Difference]: Finished difference Result 811 states and 1032 transitions. [2018-11-23 12:36:57,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:57,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-23 12:36:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:57,703 INFO L225 Difference]: With dead ends: 811 [2018-11-23 12:36:57,703 INFO L226 Difference]: Without dead ends: 777 [2018-11-23 12:36:57,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-11-23 12:36:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 770. [2018-11-23 12:36:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-11-23 12:36:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 987 transitions. [2018-11-23 12:36:57,735 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 987 transitions. Word has length 67 [2018-11-23 12:36:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:57,735 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 987 transitions. [2018-11-23 12:36:57,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 987 transitions. [2018-11-23 12:36:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:36:57,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:57,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:57,737 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:57,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1319946579, now seen corresponding path program 1 times [2018-11-23 12:36:57,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:57,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:57,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:57,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:57,787 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-23 12:36:57,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:57,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:36:57,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:36:57,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:36:57,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:57,788 INFO L87 Difference]: Start difference. First operand 770 states and 987 transitions. Second operand 6 states. [2018-11-23 12:36:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:57,864 INFO L93 Difference]: Finished difference Result 809 states and 1028 transitions. [2018-11-23 12:36:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:36:57,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 12:36:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:57,867 INFO L225 Difference]: With dead ends: 809 [2018-11-23 12:36:57,867 INFO L226 Difference]: Without dead ends: 777 [2018-11-23 12:36:57,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:36:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-11-23 12:36:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 772. [2018-11-23 12:36:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-11-23 12:36:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 989 transitions. [2018-11-23 12:36:57,899 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 989 transitions. Word has length 68 [2018-11-23 12:36:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:57,900 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 989 transitions. [2018-11-23 12:36:57,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:36:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 989 transitions. [2018-11-23 12:36:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:36:57,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:57,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:57,901 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:57,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash 810473489, now seen corresponding path program 1 times [2018-11-23 12:36:57,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:57,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:57,974 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-23 12:36:57,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:57,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:36:57,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:36:57,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:36:57,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:57,975 INFO L87 Difference]: Start difference. First operand 772 states and 989 transitions. Second operand 11 states. [2018-11-23 12:36:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:58,066 INFO L93 Difference]: Finished difference Result 797 states and 1016 transitions. [2018-11-23 12:36:58,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:36:58,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:36:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:58,067 INFO L225 Difference]: With dead ends: 797 [2018-11-23 12:36:58,067 INFO L226 Difference]: Without dead ends: 764 [2018-11-23 12:36:58,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:36:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-11-23 12:36:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2018-11-23 12:36:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-11-23 12:36:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 979 transitions. [2018-11-23 12:36:58,101 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 979 transitions. Word has length 68 [2018-11-23 12:36:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:58,101 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 979 transitions. [2018-11-23 12:36:58,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:36:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 979 transitions. [2018-11-23 12:36:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:36:58,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:58,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:58,103 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:58,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2018-11-23 12:36:58,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:58,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:58,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:58,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:58,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:58,182 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-23 12:36:58,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:58,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:36:58,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:36:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:36:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:58,183 INFO L87 Difference]: Start difference. First operand 764 states and 979 transitions. Second operand 6 states. [2018-11-23 12:36:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:58,310 INFO L93 Difference]: Finished difference Result 811 states and 1027 transitions. [2018-11-23 12:36:58,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:36:58,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 12:36:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:58,312 INFO L225 Difference]: With dead ends: 811 [2018-11-23 12:36:58,312 INFO L226 Difference]: Without dead ends: 759 [2018-11-23 12:36:58,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:36:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-23 12:36:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2018-11-23 12:36:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-11-23 12:36:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 966 transitions. [2018-11-23 12:36:58,362 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 966 transitions. Word has length 68 [2018-11-23 12:36:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:58,362 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 966 transitions. [2018-11-23 12:36:58,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:36:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 966 transitions. [2018-11-23 12:36:58,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:36:58,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:58,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:58,364 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:58,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash 631462302, now seen corresponding path program 1 times [2018-11-23 12:36:58,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:58,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:58,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:58,473 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-23 12:36:58,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:58,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:36:58,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:36:58,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:36:58,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:58,475 INFO L87 Difference]: Start difference. First operand 757 states and 966 transitions. Second operand 11 states. [2018-11-23 12:36:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:58,593 INFO L93 Difference]: Finished difference Result 779 states and 989 transitions. [2018-11-23 12:36:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:36:58,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:36:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:58,595 INFO L225 Difference]: With dead ends: 779 [2018-11-23 12:36:58,595 INFO L226 Difference]: Without dead ends: 747 [2018-11-23 12:36:58,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:36:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-11-23 12:36:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2018-11-23 12:36:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-11-23 12:36:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 952 transitions. [2018-11-23 12:36:58,646 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 952 transitions. Word has length 68 [2018-11-23 12:36:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:58,646 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 952 transitions. [2018-11-23 12:36:58,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:36:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 952 transitions. [2018-11-23 12:36:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:36:58,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:58,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:58,650 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:58,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:58,650 INFO L82 PathProgramCache]: Analyzing trace with hash -715584647, now seen corresponding path program 1 times [2018-11-23 12:36:58,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:58,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:58,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:58,684 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-23 12:36:58,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:58,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:58,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:58,685 INFO L87 Difference]: Start difference. First operand 747 states and 952 transitions. Second operand 5 states. [2018-11-23 12:36:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:58,911 INFO L93 Difference]: Finished difference Result 808 states and 1031 transitions. [2018-11-23 12:36:58,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:58,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-23 12:36:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:58,913 INFO L225 Difference]: With dead ends: 808 [2018-11-23 12:36:58,913 INFO L226 Difference]: Without dead ends: 802 [2018-11-23 12:36:58,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-11-23 12:36:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 747. [2018-11-23 12:36:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-11-23 12:36:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 951 transitions. [2018-11-23 12:36:58,946 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 951 transitions. Word has length 68 [2018-11-23 12:36:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:58,946 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 951 transitions. [2018-11-23 12:36:58,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 951 transitions. [2018-11-23 12:36:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:36:58,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:58,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:58,947 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:58,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2018-11-23 12:36:58,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:58,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:58,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:58,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:36:58,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:58,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:36:58,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:36:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:36:58,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:58,997 INFO L87 Difference]: Start difference. First operand 747 states and 951 transitions. Second operand 5 states. [2018-11-23 12:36:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:59,088 INFO L93 Difference]: Finished difference Result 788 states and 995 transitions. [2018-11-23 12:36:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:59,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-23 12:36:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:59,089 INFO L225 Difference]: With dead ends: 788 [2018-11-23 12:36:59,089 INFO L226 Difference]: Without dead ends: 754 [2018-11-23 12:36:59,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-11-23 12:36:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 747. [2018-11-23 12:36:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-11-23 12:36:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 950 transitions. [2018-11-23 12:36:59,147 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 950 transitions. Word has length 69 [2018-11-23 12:36:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:59,147 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 950 transitions. [2018-11-23 12:36:59,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:36:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 950 transitions. [2018-11-23 12:36:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:36:59,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:59,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:59,149 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:59,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1543083174, now seen corresponding path program 1 times [2018-11-23 12:36:59,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:59,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:59,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:59,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:59,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:59,211 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-23 12:36:59,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:59,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:36:59,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:36:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:36:59,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:59,212 INFO L87 Difference]: Start difference. First operand 747 states and 950 transitions. Second operand 6 states. [2018-11-23 12:36:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:59,274 INFO L93 Difference]: Finished difference Result 786 states and 991 transitions. [2018-11-23 12:36:59,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:36:59,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 12:36:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:59,276 INFO L225 Difference]: With dead ends: 786 [2018-11-23 12:36:59,276 INFO L226 Difference]: Without dead ends: 754 [2018-11-23 12:36:59,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:36:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-11-23 12:36:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 749. [2018-11-23 12:36:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-11-23 12:36:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 952 transitions. [2018-11-23 12:36:59,307 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 952 transitions. Word has length 69 [2018-11-23 12:36:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:59,308 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 952 transitions. [2018-11-23 12:36:59,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:36:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 952 transitions. [2018-11-23 12:36:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:36:59,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:59,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:59,309 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:59,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2052556264, now seen corresponding path program 1 times [2018-11-23 12:36:59,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:59,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:59,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:59,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:59,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:59,391 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-23 12:36:59,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:59,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:36:59,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:36:59,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:36:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:59,392 INFO L87 Difference]: Start difference. First operand 749 states and 952 transitions. Second operand 11 states. [2018-11-23 12:36:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:59,538 INFO L93 Difference]: Finished difference Result 774 states and 979 transitions. [2018-11-23 12:36:59,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:36:59,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-23 12:36:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:59,542 INFO L225 Difference]: With dead ends: 774 [2018-11-23 12:36:59,542 INFO L226 Difference]: Without dead ends: 742 [2018-11-23 12:36:59,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:36:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-11-23 12:36:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2018-11-23 12:36:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-11-23 12:36:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 943 transitions. [2018-11-23 12:36:59,601 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 943 transitions. Word has length 69 [2018-11-23 12:36:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:59,602 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 943 transitions. [2018-11-23 12:36:59,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:36:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 943 transitions. [2018-11-23 12:36:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:36:59,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:59,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:59,606 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:59,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2018-11-23 12:36:59,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:59,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:59,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:59,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:59,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:59,708 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-23 12:36:59,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:59,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:36:59,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:36:59,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:36:59,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:36:59,709 INFO L87 Difference]: Start difference. First operand 742 states and 943 transitions. Second operand 6 states. [2018-11-23 12:36:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:59,762 INFO L93 Difference]: Finished difference Result 781 states and 984 transitions. [2018-11-23 12:36:59,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:36:59,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 12:36:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:59,763 INFO L225 Difference]: With dead ends: 781 [2018-11-23 12:36:59,763 INFO L226 Difference]: Without dead ends: 749 [2018-11-23 12:36:59,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:36:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-11-23 12:36:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 744. [2018-11-23 12:36:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-23 12:36:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 945 transitions. [2018-11-23 12:36:59,804 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 945 transitions. Word has length 69 [2018-11-23 12:36:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:59,804 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 945 transitions. [2018-11-23 12:36:59,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:36:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 945 transitions. [2018-11-23 12:36:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:36:59,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:59,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:59,805 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:36:59,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1860763099, now seen corresponding path program 1 times [2018-11-23 12:36:59,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:36:59,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:36:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:59,879 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-23 12:36:59,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:59,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:36:59,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:36:59,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:36:59,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:36:59,880 INFO L87 Difference]: Start difference. First operand 744 states and 945 transitions. Second operand 11 states. [2018-11-23 12:36:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:59,965 INFO L93 Difference]: Finished difference Result 769 states and 972 transitions. [2018-11-23 12:36:59,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:36:59,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-23 12:36:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:59,967 INFO L225 Difference]: With dead ends: 769 [2018-11-23 12:36:59,967 INFO L226 Difference]: Without dead ends: 739 [2018-11-23 12:36:59,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:36:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-11-23 12:37:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2018-11-23 12:37:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-11-23 12:37:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 938 transitions. [2018-11-23 12:37:00,006 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 938 transitions. Word has length 69 [2018-11-23 12:37:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:00,006 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 938 transitions. [2018-11-23 12:37:00,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:37:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 938 transitions. [2018-11-23 12:37:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:37:00,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:00,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 12:37:00,008 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:00,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2018-11-23 12:37:00,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:00,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:00,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:00,104 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-23 12:37:00,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:00,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:37:00,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:37:00,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:37:00,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:37:00,105 INFO L87 Difference]: Start difference. First operand 739 states and 938 transitions. Second operand 11 states. [2018-11-23 12:37:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:00,249 INFO L93 Difference]: Finished difference Result 749 states and 947 transitions. [2018-11-23 12:37:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:37:00,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-23 12:37:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:00,252 INFO L225 Difference]: With dead ends: 749 [2018-11-23 12:37:00,252 INFO L226 Difference]: Without dead ends: 743 [2018-11-23 12:37:00,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-11-23 12:37:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2018-11-23 12:37:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-23 12:37:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 934 transitions. [2018-11-23 12:37:00,284 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 934 transitions. Word has length 69 [2018-11-23 12:37:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:00,284 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 934 transitions. [2018-11-23 12:37:00,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:37:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 934 transitions. [2018-11-23 12:37:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:37:00,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:00,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:00,286 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:00,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1348884900, now seen corresponding path program 1 times [2018-11-23 12:37:00,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:00,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:00,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:37:00,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:00,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:37:00,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:37:00,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:37:00,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:37:00,323 INFO L87 Difference]: Start difference. First operand 737 states and 934 transitions. Second operand 5 states. [2018-11-23 12:37:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:00,536 INFO L93 Difference]: Finished difference Result 794 states and 1009 transitions. [2018-11-23 12:37:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:37:00,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-23 12:37:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:00,538 INFO L225 Difference]: With dead ends: 794 [2018-11-23 12:37:00,538 INFO L226 Difference]: Without dead ends: 732 [2018-11-23 12:37:00,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:37:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-11-23 12:37:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 681. [2018-11-23 12:37:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-23 12:37:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 863 transitions. [2018-11-23 12:37:00,574 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 863 transitions. Word has length 69 [2018-11-23 12:37:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:00,574 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 863 transitions. [2018-11-23 12:37:00,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:37:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 863 transitions. [2018-11-23 12:37:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:37:00,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:00,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:00,575 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:00,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:00,575 INFO L82 PathProgramCache]: Analyzing trace with hash 459038371, now seen corresponding path program 1 times [2018-11-23 12:37:00,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:00,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:00,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:37:00,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:00,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:37:00,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:37:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:37:00,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:37:00,623 INFO L87 Difference]: Start difference. First operand 681 states and 863 transitions. Second operand 7 states. [2018-11-23 12:37:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:00,700 INFO L93 Difference]: Finished difference Result 727 states and 910 transitions. [2018-11-23 12:37:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:37:00,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-23 12:37:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:00,701 INFO L225 Difference]: With dead ends: 727 [2018-11-23 12:37:00,701 INFO L226 Difference]: Without dead ends: 682 [2018-11-23 12:37:00,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:37:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-11-23 12:37:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-11-23 12:37:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-11-23 12:37:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 859 transitions. [2018-11-23 12:37:00,736 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 859 transitions. Word has length 74 [2018-11-23 12:37:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:00,736 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 859 transitions. [2018-11-23 12:37:00,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:37:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 859 transitions. [2018-11-23 12:37:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:37:00,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:00,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:00,737 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:00,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash -198873651, now seen corresponding path program 1 times [2018-11-23 12:37:00,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:00,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:00,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:00,831 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-23 12:37:00,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:00,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:37:00,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:37:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:37:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:37:00,832 INFO L87 Difference]: Start difference. First operand 680 states and 859 transitions. Second operand 14 states. [2018-11-23 12:37:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:00,973 INFO L93 Difference]: Finished difference Result 704 states and 885 transitions. [2018-11-23 12:37:00,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:37:00,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-23 12:37:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:00,975 INFO L225 Difference]: With dead ends: 704 [2018-11-23 12:37:00,975 INFO L226 Difference]: Without dead ends: 677 [2018-11-23 12:37:00,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:37:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-11-23 12:37:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2018-11-23 12:37:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-11-23 12:37:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 854 transitions. [2018-11-23 12:37:01,010 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 854 transitions. Word has length 70 [2018-11-23 12:37:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:01,010 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 854 transitions. [2018-11-23 12:37:01,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:37:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 854 transitions. [2018-11-23 12:37:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:37:01,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:01,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:01,012 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:01,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2018-11-23 12:37:01,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:01,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:01,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-23 12:37:01,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:01,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 12:37:01,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:37:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:37:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:01,119 INFO L87 Difference]: Start difference. First operand 677 states and 854 transitions. Second operand 13 states. [2018-11-23 12:37:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:01,277 INFO L93 Difference]: Finished difference Result 697 states and 875 transitions. [2018-11-23 12:37:01,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:37:01,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-23 12:37:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:01,279 INFO L225 Difference]: With dead ends: 697 [2018-11-23 12:37:01,279 INFO L226 Difference]: Without dead ends: 675 [2018-11-23 12:37:01,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:37:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-11-23 12:37:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2018-11-23 12:37:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-11-23 12:37:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 850 transitions. [2018-11-23 12:37:01,313 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 850 transitions. Word has length 72 [2018-11-23 12:37:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:01,313 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 850 transitions. [2018-11-23 12:37:01,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:37:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 850 transitions. [2018-11-23 12:37:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:37:01,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:01,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:01,314 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:01,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2018-11-23 12:37:01,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:01,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:01,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:01,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:37:01,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:01,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 12:37:01,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:37:01,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:37:01,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:01,404 INFO L87 Difference]: Start difference. First operand 675 states and 850 transitions. Second operand 13 states. [2018-11-23 12:37:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:01,543 INFO L93 Difference]: Finished difference Result 692 states and 868 transitions. [2018-11-23 12:37:01,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:37:01,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-23 12:37:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:01,544 INFO L225 Difference]: With dead ends: 692 [2018-11-23 12:37:01,544 INFO L226 Difference]: Without dead ends: 663 [2018-11-23 12:37:01,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:37:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-11-23 12:37:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2018-11-23 12:37:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-11-23 12:37:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 834 transitions. [2018-11-23 12:37:01,573 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 834 transitions. Word has length 69 [2018-11-23 12:37:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:01,573 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 834 transitions. [2018-11-23 12:37:01,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:37:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 834 transitions. [2018-11-23 12:37:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:37:01,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:01,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:01,574 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:01,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1712334254, now seen corresponding path program 1 times [2018-11-23 12:37:01,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:01,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:01,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:01,602 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-23 12:37:01,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:01,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:37:01,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:37:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:37:01,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:37:01,603 INFO L87 Difference]: Start difference. First operand 663 states and 834 transitions. Second operand 5 states. [2018-11-23 12:37:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:01,655 INFO L93 Difference]: Finished difference Result 710 states and 883 transitions. [2018-11-23 12:37:01,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:37:01,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-23 12:37:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:01,656 INFO L225 Difference]: With dead ends: 710 [2018-11-23 12:37:01,656 INFO L226 Difference]: Without dead ends: 667 [2018-11-23 12:37:01,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:37:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-23 12:37:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 663. [2018-11-23 12:37:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-11-23 12:37:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 833 transitions. [2018-11-23 12:37:01,684 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 833 transitions. Word has length 71 [2018-11-23 12:37:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:01,684 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 833 transitions. [2018-11-23 12:37:01,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:37:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 833 transitions. [2018-11-23 12:37:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:37:01,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:01,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:01,685 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:01,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1160638245, now seen corresponding path program 1 times [2018-11-23 12:37:01,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:01,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:01,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:01,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:01,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-23 12:37:01,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:01,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:37:01,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:37:01,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:37:01,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:37:01,771 INFO L87 Difference]: Start difference. First operand 663 states and 833 transitions. Second operand 14 states. [2018-11-23 12:37:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:01,881 INFO L93 Difference]: Finished difference Result 685 states and 856 transitions. [2018-11-23 12:37:01,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:37:01,881 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-23 12:37:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:01,882 INFO L225 Difference]: With dead ends: 685 [2018-11-23 12:37:01,882 INFO L226 Difference]: Without dead ends: 653 [2018-11-23 12:37:01,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:37:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-23 12:37:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2018-11-23 12:37:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-11-23 12:37:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 818 transitions. [2018-11-23 12:37:01,911 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 818 transitions. Word has length 74 [2018-11-23 12:37:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:01,911 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 818 transitions. [2018-11-23 12:37:01,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:37:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 818 transitions. [2018-11-23 12:37:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:37:01,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:01,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:01,912 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:01,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash -531649044, now seen corresponding path program 1 times [2018-11-23 12:37:01,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:01,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:01,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:01,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:02,045 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-23 12:37:02,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:02,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:37:02,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:37:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:37:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:37:02,046 INFO L87 Difference]: Start difference. First operand 653 states and 818 transitions. Second operand 14 states. [2018-11-23 12:37:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:02,182 INFO L93 Difference]: Finished difference Result 677 states and 844 transitions. [2018-11-23 12:37:02,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:37:02,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 12:37:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:02,183 INFO L225 Difference]: With dead ends: 677 [2018-11-23 12:37:02,184 INFO L226 Difference]: Without dead ends: 646 [2018-11-23 12:37:02,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:37:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-11-23 12:37:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2018-11-23 12:37:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-23 12:37:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 808 transitions. [2018-11-23 12:37:02,213 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 808 transitions. Word has length 71 [2018-11-23 12:37:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:02,213 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 808 transitions. [2018-11-23 12:37:02,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:37:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 808 transitions. [2018-11-23 12:37:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:37:02,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:02,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:02,214 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:02,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:02,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906513, now seen corresponding path program 1 times [2018-11-23 12:37:02,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:02,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:02,289 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-23 12:37:02,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:02,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:37:02,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:37:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:37:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:37:02,290 INFO L87 Difference]: Start difference. First operand 646 states and 808 transitions. Second operand 14 states. [2018-11-23 12:37:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:02,395 INFO L93 Difference]: Finished difference Result 710 states and 876 transitions. [2018-11-23 12:37:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:37:02,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 12:37:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:02,397 INFO L225 Difference]: With dead ends: 710 [2018-11-23 12:37:02,397 INFO L226 Difference]: Without dead ends: 640 [2018-11-23 12:37:02,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:37:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-11-23 12:37:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2018-11-23 12:37:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-23 12:37:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 799 transitions. [2018-11-23 12:37:02,424 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 799 transitions. Word has length 71 [2018-11-23 12:37:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:02,424 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 799 transitions. [2018-11-23 12:37:02,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:37:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 799 transitions. [2018-11-23 12:37:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:37:02,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:02,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:02,426 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:02,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2018-11-23 12:37:02,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:02,470 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-23 12:37:02,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:02,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:37:02,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:37:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:37:02,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:37:02,471 INFO L87 Difference]: Start difference. First operand 640 states and 799 transitions. Second operand 11 states. [2018-11-23 12:37:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:02,555 INFO L93 Difference]: Finished difference Result 667 states and 829 transitions. [2018-11-23 12:37:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:37:02,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-23 12:37:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:02,557 INFO L225 Difference]: With dead ends: 667 [2018-11-23 12:37:02,557 INFO L226 Difference]: Without dead ends: 622 [2018-11-23 12:37:02,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-11-23 12:37:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2018-11-23 12:37:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-23 12:37:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 771 transitions. [2018-11-23 12:37:02,584 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 771 transitions. Word has length 72 [2018-11-23 12:37:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:02,584 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 771 transitions. [2018-11-23 12:37:02,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:37:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 771 transitions. [2018-11-23 12:37:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:37:02,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:02,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:02,586 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:02,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2018-11-23 12:37:02,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:02,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:02,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:02,629 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-23 12:37:02,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:02,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:37:02,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:37:02,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:37:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:37:02,630 INFO L87 Difference]: Start difference. First operand 622 states and 771 transitions. Second operand 6 states. [2018-11-23 12:37:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:02,677 INFO L93 Difference]: Finished difference Result 663 states and 815 transitions. [2018-11-23 12:37:02,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:37:02,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-23 12:37:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:02,678 INFO L225 Difference]: With dead ends: 663 [2018-11-23 12:37:02,678 INFO L226 Difference]: Without dead ends: 627 [2018-11-23 12:37:02,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:37:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-23 12:37:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 622. [2018-11-23 12:37:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-23 12:37:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 769 transitions. [2018-11-23 12:37:02,704 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 769 transitions. Word has length 71 [2018-11-23 12:37:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:02,704 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 769 transitions. [2018-11-23 12:37:02,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:37:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 769 transitions. [2018-11-23 12:37:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:37:02,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:02,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:02,705 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:02,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash 792976728, now seen corresponding path program 1 times [2018-11-23 12:37:02,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:37:02,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:02,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:37:02,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:37:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:37:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:37:02,770 INFO L87 Difference]: Start difference. First operand 622 states and 769 transitions. Second operand 11 states. [2018-11-23 12:37:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:02,848 INFO L93 Difference]: Finished difference Result 647 states and 796 transitions. [2018-11-23 12:37:02,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:37:02,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-23 12:37:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:02,849 INFO L225 Difference]: With dead ends: 647 [2018-11-23 12:37:02,849 INFO L226 Difference]: Without dead ends: 614 [2018-11-23 12:37:02,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-23 12:37:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2018-11-23 12:37:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-23 12:37:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 758 transitions. [2018-11-23 12:37:02,876 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 758 transitions. Word has length 71 [2018-11-23 12:37:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:02,876 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 758 transitions. [2018-11-23 12:37:02,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:37:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 758 transitions. [2018-11-23 12:37:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:37:02,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:02,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:02,877 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:02,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1953714458, now seen corresponding path program 1 times [2018-11-23 12:37:02,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:02,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:02,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:02,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:02,947 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-23 12:37:02,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:02,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:37:02,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:37:02,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:37:02,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:37:02,948 INFO L87 Difference]: Start difference. First operand 614 states and 758 transitions. Second operand 7 states. [2018-11-23 12:37:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:03,019 INFO L93 Difference]: Finished difference Result 668 states and 819 transitions. [2018-11-23 12:37:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:37:03,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-23 12:37:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:03,021 INFO L225 Difference]: With dead ends: 668 [2018-11-23 12:37:03,021 INFO L226 Difference]: Without dead ends: 612 [2018-11-23 12:37:03,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:37:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-23 12:37:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2018-11-23 12:37:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-23 12:37:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 748 transitions. [2018-11-23 12:37:03,049 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 748 transitions. Word has length 77 [2018-11-23 12:37:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:03,049 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 748 transitions. [2018-11-23 12:37:03,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:37:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 748 transitions. [2018-11-23 12:37:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:37:03,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:03,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:03,051 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:03,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1252114584, now seen corresponding path program 1 times [2018-11-23 12:37:03,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:03,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:03,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:03,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:03,126 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-23 12:37:03,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:03,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:37:03,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:37:03,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:37:03,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:37:03,127 INFO L87 Difference]: Start difference. First operand 608 states and 748 transitions. Second operand 14 states. [2018-11-23 12:37:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:03,240 INFO L93 Difference]: Finished difference Result 634 states and 776 transitions. [2018-11-23 12:37:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:37:03,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-23 12:37:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:03,242 INFO L225 Difference]: With dead ends: 634 [2018-11-23 12:37:03,242 INFO L226 Difference]: Without dead ends: 610 [2018-11-23 12:37:03,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:37:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-11-23 12:37:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 606. [2018-11-23 12:37:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-23 12:37:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 744 transitions. [2018-11-23 12:37:03,276 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 744 transitions. Word has length 77 [2018-11-23 12:37:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:03,277 INFO L480 AbstractCegarLoop]: Abstraction has 606 states and 744 transitions. [2018-11-23 12:37:03,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:37:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 744 transitions. [2018-11-23 12:37:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:37:03,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:03,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:03,278 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:03,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1353976224, now seen corresponding path program 1 times [2018-11-23 12:37:03,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:03,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:03,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:03,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:03,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:03,364 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-23 12:37:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:37:03,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:37:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:37:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:37:03,365 INFO L87 Difference]: Start difference. First operand 606 states and 744 transitions. Second operand 14 states. [2018-11-23 12:37:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:03,479 INFO L93 Difference]: Finished difference Result 665 states and 806 transitions. [2018-11-23 12:37:03,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:37:03,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-23 12:37:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:03,480 INFO L225 Difference]: With dead ends: 665 [2018-11-23 12:37:03,480 INFO L226 Difference]: Without dead ends: 594 [2018-11-23 12:37:03,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:37:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-23 12:37:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2018-11-23 12:37:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-23 12:37:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 725 transitions. [2018-11-23 12:37:03,523 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 725 transitions. Word has length 72 [2018-11-23 12:37:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:03,523 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 725 transitions. [2018-11-23 12:37:03,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:37:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 725 transitions. [2018-11-23 12:37:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:37:03,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:03,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:03,524 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:03,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2018-11-23 12:37:03,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:03,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:03,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:03,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:03,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:03,576 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-23 12:37:03,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:03,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:37:03,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:37:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:37:03,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:37:03,577 INFO L87 Difference]: Start difference. First operand 594 states and 725 transitions. Second operand 10 states. [2018-11-23 12:37:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:04,475 INFO L93 Difference]: Finished difference Result 1173 states and 1434 transitions. [2018-11-23 12:37:04,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:37:04,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-23 12:37:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:04,478 INFO L225 Difference]: With dead ends: 1173 [2018-11-23 12:37:04,478 INFO L226 Difference]: Without dead ends: 1028 [2018-11-23 12:37:04,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:37:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-11-23 12:37:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 948. [2018-11-23 12:37:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-11-23 12:37:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1182 transitions. [2018-11-23 12:37:04,526 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1182 transitions. Word has length 73 [2018-11-23 12:37:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:04,526 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 1182 transitions. [2018-11-23 12:37:04,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:37:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1182 transitions. [2018-11-23 12:37:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:37:04,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:04,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:04,527 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:04,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1980389399, now seen corresponding path program 1 times [2018-11-23 12:37:04,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:04,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:04,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:04,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:04,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:37:04,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:04,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:37:04,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:37:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:37:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:37:04,565 INFO L87 Difference]: Start difference. First operand 948 states and 1182 transitions. Second operand 6 states. [2018-11-23 12:37:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:04,979 INFO L93 Difference]: Finished difference Result 1175 states and 1431 transitions. [2018-11-23 12:37:04,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:37:04,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-23 12:37:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:04,981 INFO L225 Difference]: With dead ends: 1175 [2018-11-23 12:37:04,981 INFO L226 Difference]: Without dead ends: 1070 [2018-11-23 12:37:04,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:37:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-11-23 12:37:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1011. [2018-11-23 12:37:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-11-23 12:37:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1251 transitions. [2018-11-23 12:37:05,042 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1251 transitions. Word has length 73 [2018-11-23 12:37:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:05,042 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 1251 transitions. [2018-11-23 12:37:05,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:37:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1251 transitions. [2018-11-23 12:37:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:37:05,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:05,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 12:37:05,043 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:05,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1694643791, now seen corresponding path program 1 times [2018-11-23 12:37:05,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:05,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:05,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:05,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:05,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:05,141 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-23 12:37:05,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:05,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:37:05,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:37:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:37:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:37:05,141 INFO L87 Difference]: Start difference. First operand 1011 states and 1251 transitions. Second operand 6 states. [2018-11-23 12:37:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:05,273 INFO L93 Difference]: Finished difference Result 1285 states and 1607 transitions. [2018-11-23 12:37:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:37:05,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 12:37:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:05,277 INFO L225 Difference]: With dead ends: 1285 [2018-11-23 12:37:05,277 INFO L226 Difference]: Without dead ends: 997 [2018-11-23 12:37:05,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:37:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-23 12:37:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-23 12:37:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-23 12:37:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1229 transitions. [2018-11-23 12:37:05,369 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1229 transitions. Word has length 77 [2018-11-23 12:37:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:05,369 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1229 transitions. [2018-11-23 12:37:05,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:37:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1229 transitions. [2018-11-23 12:37:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:37:05,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:05,370 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:05,370 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:05,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:05,371 INFO L82 PathProgramCache]: Analyzing trace with hash -532137541, now seen corresponding path program 1 times [2018-11-23 12:37:05,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:05,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:05,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:05,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:05,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:05,405 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-23 12:37:05,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:05,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:37:05,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:37:05,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:37:05,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:37:05,405 INFO L87 Difference]: Start difference. First operand 997 states and 1229 transitions. Second operand 5 states. [2018-11-23 12:37:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:05,528 INFO L93 Difference]: Finished difference Result 1042 states and 1277 transitions. [2018-11-23 12:37:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:37:05,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-23 12:37:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:05,530 INFO L225 Difference]: With dead ends: 1042 [2018-11-23 12:37:05,530 INFO L226 Difference]: Without dead ends: 997 [2018-11-23 12:37:05,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:37:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-23 12:37:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-23 12:37:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-23 12:37:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1227 transitions. [2018-11-23 12:37:05,587 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1227 transitions. Word has length 75 [2018-11-23 12:37:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:05,587 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1227 transitions. [2018-11-23 12:37:05,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:37:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1227 transitions. [2018-11-23 12:37:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:37:05,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:05,588 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:05,588 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:05,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash -509505287, now seen corresponding path program 1 times [2018-11-23 12:37:05,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:05,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:05,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:05,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:05,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:05,628 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-23 12:37:05,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:05,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:37:05,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:37:05,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:37:05,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:37:05,629 INFO L87 Difference]: Start difference. First operand 997 states and 1227 transitions. Second operand 6 states. [2018-11-23 12:37:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:05,771 INFO L93 Difference]: Finished difference Result 1038 states and 1269 transitions. [2018-11-23 12:37:05,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:37:05,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-23 12:37:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:05,773 INFO L225 Difference]: With dead ends: 1038 [2018-11-23 12:37:05,773 INFO L226 Difference]: Without dead ends: 997 [2018-11-23 12:37:05,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:37:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-23 12:37:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-23 12:37:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-23 12:37:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1225 transitions. [2018-11-23 12:37:05,821 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1225 transitions. Word has length 75 [2018-11-23 12:37:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:05,821 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1225 transitions. [2018-11-23 12:37:05,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:37:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1225 transitions. [2018-11-23 12:37:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:37:05,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:05,822 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:05,823 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:05,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1018978377, now seen corresponding path program 1 times [2018-11-23 12:37:05,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:05,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:05,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:05,892 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-23 12:37:05,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:05,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:37:05,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:37:05,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:37:05,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:37:05,893 INFO L87 Difference]: Start difference. First operand 997 states and 1225 transitions. Second operand 11 states. [2018-11-23 12:37:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:06,005 INFO L93 Difference]: Finished difference Result 1019 states and 1248 transitions. [2018-11-23 12:37:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:37:06,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-23 12:37:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:06,008 INFO L225 Difference]: With dead ends: 1019 [2018-11-23 12:37:06,008 INFO L226 Difference]: Without dead ends: 961 [2018-11-23 12:37:06,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-11-23 12:37:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 955. [2018-11-23 12:37:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-11-23 12:37:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1173 transitions. [2018-11-23 12:37:06,066 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1173 transitions. Word has length 75 [2018-11-23 12:37:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:06,066 INFO L480 AbstractCegarLoop]: Abstraction has 955 states and 1173 transitions. [2018-11-23 12:37:06,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:37:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1173 transitions. [2018-11-23 12:37:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:37:06,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:06,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:06,068 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:06,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash -235814922, now seen corresponding path program 1 times [2018-11-23 12:37:06,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:06,108 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-23 12:37:06,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:06,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:37:06,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:37:06,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:37:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:37:06,109 INFO L87 Difference]: Start difference. First operand 955 states and 1173 transitions. Second operand 5 states. [2018-11-23 12:37:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:06,276 INFO L93 Difference]: Finished difference Result 1197 states and 1491 transitions. [2018-11-23 12:37:06,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:37:06,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-23 12:37:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:06,278 INFO L225 Difference]: With dead ends: 1197 [2018-11-23 12:37:06,278 INFO L226 Difference]: Without dead ends: 923 [2018-11-23 12:37:06,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:37:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-23 12:37:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-11-23 12:37:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-23 12:37:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1133 transitions. [2018-11-23 12:37:06,324 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1133 transitions. Word has length 81 [2018-11-23 12:37:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:06,324 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1133 transitions. [2018-11-23 12:37:06,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:37:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1133 transitions. [2018-11-23 12:37:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:37:06,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:06,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:06,326 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:06,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2018-11-23 12:37:06,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:06,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:06,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:06,401 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-23 12:37:06,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:06,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:37:06,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:37:06,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:37:06,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:37:06,402 INFO L87 Difference]: Start difference. First operand 923 states and 1133 transitions. Second operand 10 states. [2018-11-23 12:37:07,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:07,199 INFO L93 Difference]: Finished difference Result 988 states and 1198 transitions. [2018-11-23 12:37:07,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:37:07,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-23 12:37:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:07,201 INFO L225 Difference]: With dead ends: 988 [2018-11-23 12:37:07,201 INFO L226 Difference]: Without dead ends: 855 [2018-11-23 12:37:07,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:37:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-11-23 12:37:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 429. [2018-11-23 12:37:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-11-23 12:37:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 525 transitions. [2018-11-23 12:37:07,229 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 525 transitions. Word has length 78 [2018-11-23 12:37:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:07,229 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 525 transitions. [2018-11-23 12:37:07,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:37:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 525 transitions. [2018-11-23 12:37:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:37:07,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:07,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:07,229 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:07,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2018-11-23 12:37:07,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:07,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:07,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:07,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:07,311 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-23 12:37:07,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:07,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 12:37:07,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:37:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:37:07,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:07,312 INFO L87 Difference]: Start difference. First operand 429 states and 525 transitions. Second operand 13 states. [2018-11-23 12:37:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:07,441 INFO L93 Difference]: Finished difference Result 431 states and 526 transitions. [2018-11-23 12:37:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:37:07,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-23 12:37:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:07,442 INFO L225 Difference]: With dead ends: 431 [2018-11-23 12:37:07,442 INFO L226 Difference]: Without dead ends: 367 [2018-11-23 12:37:07,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:37:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-23 12:37:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-11-23 12:37:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-23 12:37:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 457 transitions. [2018-11-23 12:37:07,475 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 457 transitions. Word has length 79 [2018-11-23 12:37:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:07,475 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 457 transitions. [2018-11-23 12:37:07,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:37:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 457 transitions. [2018-11-23 12:37:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 12:37:07,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:07,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:07,476 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:07,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922871, now seen corresponding path program 1 times [2018-11-23 12:37:07,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:07,493 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-23 12:37:07,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:07,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:37:07,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:37:07,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:37:07,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:37:07,494 INFO L87 Difference]: Start difference. First operand 367 states and 457 transitions. Second operand 3 states. [2018-11-23 12:37:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:07,536 INFO L93 Difference]: Finished difference Result 410 states and 502 transitions. [2018-11-23 12:37:07,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:37:07,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-23 12:37:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:07,538 INFO L225 Difference]: With dead ends: 410 [2018-11-23 12:37:07,538 INFO L226 Difference]: Without dead ends: 372 [2018-11-23 12:37:07,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:37:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-11-23 12:37:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2018-11-23 12:37:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-23 12:37:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 458 transitions. [2018-11-23 12:37:07,562 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 458 transitions. Word has length 80 [2018-11-23 12:37:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:07,563 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 458 transitions. [2018-11-23 12:37:07,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:37:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 458 transitions. [2018-11-23 12:37:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 12:37:07,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:07,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:07,564 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:07,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:07,564 INFO L82 PathProgramCache]: Analyzing trace with hash 327061127, now seen corresponding path program 1 times [2018-11-23 12:37:07,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:07,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:07,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:07,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:07,648 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-23 12:37:07,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:07,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:37:07,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:37:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:37:07,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:37:07,649 INFO L87 Difference]: Start difference. First operand 368 states and 458 transitions. Second operand 14 states. [2018-11-23 12:37:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:07,732 INFO L93 Difference]: Finished difference Result 383 states and 474 transitions. [2018-11-23 12:37:07,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:37:07,733 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-23 12:37:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:07,733 INFO L225 Difference]: With dead ends: 383 [2018-11-23 12:37:07,734 INFO L226 Difference]: Without dead ends: 310 [2018-11-23 12:37:07,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:37:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-23 12:37:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-11-23 12:37:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-23 12:37:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2018-11-23 12:37:07,755 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 80 [2018-11-23 12:37:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:07,755 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2018-11-23 12:37:07,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:37:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2018-11-23 12:37:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:37:07,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:07,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 12:37:07,756 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:07,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash 121497713, now seen corresponding path program 1 times [2018-11-23 12:37:07,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:07,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:07,786 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-23 12:37:07,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:07,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:37:07,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:37:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:37:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:37:07,787 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2018-11-23 12:37:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:07,901 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2018-11-23 12:37:07,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:37:07,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-23 12:37:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:07,902 INFO L225 Difference]: With dead ends: 445 [2018-11-23 12:37:07,902 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 12:37:07,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:37:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 12:37:07,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2018-11-23 12:37:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-23 12:37:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2018-11-23 12:37:07,918 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2018-11-23 12:37:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:07,918 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2018-11-23 12:37:07,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:37:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2018-11-23 12:37:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 12:37:07,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:07,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:07,919 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:07,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1235629862, now seen corresponding path program 1 times [2018-11-23 12:37:07,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:07,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:07,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:07,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:07,988 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-23 12:37:07,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:07,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 12:37:07,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:37:07,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:37:07,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:07,988 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 13 states. [2018-11-23 12:37:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:08,426 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-11-23 12:37:08,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:37:08,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-23 12:37:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:08,427 INFO L225 Difference]: With dead ends: 289 [2018-11-23 12:37:08,427 INFO L226 Difference]: Without dead ends: 266 [2018-11-23 12:37:08,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:37:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-23 12:37:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2018-11-23 12:37:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-23 12:37:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2018-11-23 12:37:08,443 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2018-11-23 12:37:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:08,443 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2018-11-23 12:37:08,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:37:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2018-11-23 12:37:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 12:37:08,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:08,443 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:08,443 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:08,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:08,444 INFO L82 PathProgramCache]: Analyzing trace with hash 31808508, now seen corresponding path program 1 times [2018-11-23 12:37:08,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:08,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:08,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:08,469 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-23 12:37:08,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:37:08,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:37:08,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:08,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:08,643 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-23 12:37:08,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:37:08,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 12:37:08,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:37:08,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:37:08,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:37:08,661 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 8 states. [2018-11-23 12:37:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:08,822 INFO L93 Difference]: Finished difference Result 410 states and 482 transitions. [2018-11-23 12:37:08,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:37:08,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2018-11-23 12:37:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:08,825 INFO L225 Difference]: With dead ends: 410 [2018-11-23 12:37:08,825 INFO L226 Difference]: Without dead ends: 246 [2018-11-23 12:37:08,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:37:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-23 12:37:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-11-23 12:37:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-23 12:37:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 283 transitions. [2018-11-23 12:37:08,854 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 283 transitions. Word has length 114 [2018-11-23 12:37:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:08,854 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 283 transitions. [2018-11-23 12:37:08,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:37:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 283 transitions. [2018-11-23 12:37:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:37:08,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:08,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:08,856 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:08,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash -642637310, now seen corresponding path program 1 times [2018-11-23 12:37:08,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:08,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:08,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:08,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:08,937 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-23 12:37:08,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:08,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:37:08,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:37:08,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:37:08,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:37:08,938 INFO L87 Difference]: Start difference. First operand 246 states and 283 transitions. Second operand 10 states. [2018-11-23 12:37:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:09,635 INFO L93 Difference]: Finished difference Result 529 states and 607 transitions. [2018-11-23 12:37:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:37:09,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-11-23 12:37:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:09,638 INFO L225 Difference]: With dead ends: 529 [2018-11-23 12:37:09,639 INFO L226 Difference]: Without dead ends: 423 [2018-11-23 12:37:09,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:37:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-11-23 12:37:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 365. [2018-11-23 12:37:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-23 12:37:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 416 transitions. [2018-11-23 12:37:09,682 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 416 transitions. Word has length 101 [2018-11-23 12:37:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:09,682 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 416 transitions. [2018-11-23 12:37:09,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:37:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 416 transitions. [2018-11-23 12:37:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:37:09,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:09,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:09,683 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:09,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1234425920, now seen corresponding path program 1 times [2018-11-23 12:37:09,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:09,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:09,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:09,727 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-23 12:37:09,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:09,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:37:09,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:37:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:37:09,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:37:09,728 INFO L87 Difference]: Start difference. First operand 365 states and 416 transitions. Second operand 8 states. [2018-11-23 12:37:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:09,783 INFO L93 Difference]: Finished difference Result 383 states and 435 transitions. [2018-11-23 12:37:09,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:37:09,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-23 12:37:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:09,786 INFO L225 Difference]: With dead ends: 383 [2018-11-23 12:37:09,786 INFO L226 Difference]: Without dead ends: 277 [2018-11-23 12:37:09,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:37:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-23 12:37:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 147. [2018-11-23 12:37:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:37:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-11-23 12:37:09,806 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 101 [2018-11-23 12:37:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:09,806 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-11-23 12:37:09,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:37:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-11-23 12:37:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:37:09,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:09,807 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:09,807 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:09,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:09,807 INFO L82 PathProgramCache]: Analyzing trace with hash -906281704, now seen corresponding path program 1 times [2018-11-23 12:37:09,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:09,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:09,890 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-23 12:37:09,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:09,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:37:09,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:37:09,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:37:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:37:09,891 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 11 states. [2018-11-23 12:37:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:10,192 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-11-23 12:37:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:37:10,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-11-23 12:37:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:10,194 INFO L225 Difference]: With dead ends: 169 [2018-11-23 12:37:10,194 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:37:10,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:37:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:37:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-23 12:37:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:37:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-11-23 12:37:10,211 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-11-23 12:37:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:10,211 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-11-23 12:37:10,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:37:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-11-23 12:37:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 12:37:10,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:10,212 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:10,212 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:10,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:10,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1647320713, now seen corresponding path program 1 times [2018-11-23 12:37:10,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:10,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:10,272 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-23 12:37:10,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:10,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 12:37:10,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:37:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:37:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:37:10,273 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-11-23 12:37:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:10,584 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-11-23 12:37:10,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:37:10,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-11-23 12:37:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:10,587 INFO L225 Difference]: With dead ends: 280 [2018-11-23 12:37:10,587 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:37:10,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:37:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:37:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-23 12:37:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:37:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-11-23 12:37:10,601 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-11-23 12:37:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:10,601 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-11-23 12:37:10,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:37:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-11-23 12:37:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 12:37:10,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:10,602 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:10,602 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:10,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1528879239, now seen corresponding path program 1 times [2018-11-23 12:37:10,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:10,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:10,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:10,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:10,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:10,630 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-23 12:37:10,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:10,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:37:10,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:37:10,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:37:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:37:10,631 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-11-23 12:37:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:10,651 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-11-23 12:37:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:37:10,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-23 12:37:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:10,653 INFO L225 Difference]: With dead ends: 192 [2018-11-23 12:37:10,653 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 12:37:10,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:37:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 12:37:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-23 12:37:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 12:37:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-11-23 12:37:10,669 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-11-23 12:37:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:10,670 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-11-23 12:37:10,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:37:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-11-23 12:37:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 12:37:10,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:10,670 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:10,671 INFO L423 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:10,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash -142675845, now seen corresponding path program 1 times [2018-11-23 12:37:10,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:10,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:10,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:10,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:10,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:10,742 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-23 12:37:10,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:10,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 12:37:10,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:37:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:37:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:37:10,743 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 11 states. [2018-11-23 12:37:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:11,046 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-11-23 12:37:11,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:37:11,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-11-23 12:37:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:11,049 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:37:11,049 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:37:11,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:37:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:37:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:37:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:37:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:37:11,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-11-23 12:37:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:11,050 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:37:11,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:37:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:37:11,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:11,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:37:11,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:11,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:12,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:37:13,009 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 1 [2018-11-23 12:37:13,114 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-11-23 12:37:13,372 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 65 [2018-11-23 12:37:13,719 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2018-11-23 12:37:14,068 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 98 [2018-11-23 12:37:14,427 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-11-23 12:37:14,735 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 97 [2018-11-23 12:37:15,453 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 102 [2018-11-23 12:37:15,746 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 59 [2018-11-23 12:37:16,298 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 93 [2018-11-23 12:37:16,493 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 62 [2018-11-23 12:37:16,624 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-11-23 12:37:16,881 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2018-11-23 12:37:17,091 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-11-23 12:37:17,808 WARN L180 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 98 [2018-11-23 12:37:18,037 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2018-11-23 12:37:18,344 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 72 [2018-11-23 12:37:19,004 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 102 [2018-11-23 12:37:19,737 WARN L180 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 100 [2018-11-23 12:37:19,939 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 68 [2018-11-23 12:37:20,340 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 85 [2018-11-23 12:37:20,548 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 72 [2018-11-23 12:37:20,676 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2018-11-23 12:37:20,933 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2018-11-23 12:37:21,102 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2018-11-23 12:37:21,621 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-11-23 12:37:21,812 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 72 [2018-11-23 12:37:22,319 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 102 [2018-11-23 12:37:22,892 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2018-11-23 12:37:23,014 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2018-11-23 12:37:23,188 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2018-11-23 12:37:23,666 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-11-23 12:37:23,793 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-23 12:37:23,992 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-11-23 12:37:24,172 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2018-11-23 12:37:24,473 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-11-23 12:37:24,788 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2018-11-23 12:37:25,045 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2018-11-23 12:37:25,512 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 81 [2018-11-23 12:37:25,702 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 1 [2018-11-23 12:37:25,913 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 79 [2018-11-23 12:37:26,029 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2018-11-23 12:37:26,472 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 97 [2018-11-23 12:37:26,677 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2018-11-23 12:37:27,639 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 102 [2018-11-23 12:37:27,763 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-23 12:37:28,504 WARN L180 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 100 [2018-11-23 12:37:28,642 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2018-11-23 12:37:28,854 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-23 12:37:29,211 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-11-23 12:37:29,438 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2018-11-23 12:37:29,558 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2018-11-23 12:37:29,895 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 72 [2018-11-23 12:37:30,073 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-11-23 12:37:30,380 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2018-11-23 12:37:30,778 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2018-11-23 12:37:31,149 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 65 [2018-11-23 12:37:31,619 WARN L180 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 87 [2018-11-23 12:37:31,737 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2018-11-23 12:37:31,874 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-11-23 12:37:32,482 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 97 [2018-11-23 12:37:32,803 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 77 [2018-11-23 12:37:33,131 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 89 [2018-11-23 12:37:33,298 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-11-23 12:37:33,781 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2018-11-23 12:37:34,019 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 80 [2018-11-23 12:37:34,149 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2018-11-23 12:37:34,355 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-23 12:37:34,625 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72 [2018-11-23 12:37:34,818 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2018-11-23 12:37:34,993 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2018-11-23 12:37:35,517 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2018-11-23 12:37:35,696 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-11-23 12:37:36,051 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 73 [2018-11-23 12:37:36,262 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-11-23 12:37:36,476 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2018-11-23 12:37:36,804 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 90 [2018-11-23 12:37:36,967 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-11-23 12:37:37,364 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 81 [2018-11-23 12:37:37,635 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-11-23 12:37:37,635 INFO L444 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5))) (or (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5 .cse6) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0))) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 12:37:37,635 INFO L448 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-11-23 12:37:37,635 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-11-23 12:37:37,635 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-11-23 12:37:37,636 INFO L444 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse0 (= |old(~s~0)| ~s~0)) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (and .cse0 (= |old(~customIrp~0)| ~customIrp~0)) (or (or .cse1 (or .cse2 .cse3 .cse4 .cse5 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse6 .cse7) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0))) (not (= |old(~customIrp~0)| 0))) (or .cse0 (or .cse1 (or .cse2 .cse3 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse4 .cse5 .cse6 .cse7 (< ~IPC~0 (+ ~DC~0 5)))))) [2018-11-23 12:37:37,636 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-11-23 12:37:37,636 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-11-23 12:37:37,636 INFO L448 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-11-23 12:37:37,636 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-11-23 12:37:37,636 INFO L444 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)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~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)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,636 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-11-23 12:37:37,636 INFO L448 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-11-23 12:37:37,636 INFO L444 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or .cse0 (= |old(~s~0)| ~s~0)) (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)))))) [2018-11-23 12:37:37,636 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-11-23 12:37:37,636 INFO L444 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse3 (+ (div AG_SetStatusAndReturn_~__cil_tmp4~0 4294967296) 1))) (let ((.cse0 (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) (<= .cse3 0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (let ((.cse1 (or (< 0 .cse3) (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)))) (or (and .cse0 .cse1) .cse2 (and (<= 2147483670 |AG_SetStatusAndReturn_#in~status|) .cse1 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|)))) (or .cse2 (< ~IPC~0 (+ ~SKIP2~0 3)) .cse0) (or .cse2 (and (= |old(~s~0)| ~s~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)))))) [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-11-23 12:37:37,637 INFO L444 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse10))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 0) .cse11 .cse12 .cse13) (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse2))))) [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-11-23 12:37:37,637 INFO L444 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) 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 |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 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-11-23 12:37:37,637 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-11-23 12:37:37,638 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-11-23 12:37:37,638 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-11-23 12:37:37,638 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-23 12:37:37,638 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-11-23 12:37:37,638 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-11-23 12:37:37,638 INFO L444 ceAbstractionStarter]: At program point L207-2(lines 207 209) 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 |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 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~myStatus~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,638 INFO L444 ceAbstractionStarter]: At program point L154(line 154) 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 |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 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,638 INFO L448 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-11-23 12:37:37,638 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-23 12:37:37,638 INFO L444 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse10))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 0) .cse11 .cse12 .cse13) (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (and (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse1) (or .cse0 .cse2 .cse1))))) [2018-11-23 12:37:37,639 INFO L444 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse10))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 0) .cse11 .cse12 .cse13) (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (and (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse1) (or .cse0 .cse2 .cse1))))) [2018-11-23 12:37:37,639 INFO L444 ceAbstractionStarter]: At program point L1786(lines 1785 1816) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (= |old(~customIrp~0)| ~customIrp~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 (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,639 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-11-23 12:37:37,639 INFO L448 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-11-23 12:37:37,639 INFO L444 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and (= 0 ~pended~0) .cse13))) (let ((.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (= ~IPC~0 ~s~0)) (.cse8 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (and .cse0 .cse3 .cse7)) (.cse12 (= 0 main_~status~9)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse10) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse12 .cse4 .cse5 .cse7) (and .cse0 (= ~routine~0 0) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 ~compRegistered~0) .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (and .cse8 .cse9 .cse2 .cse6 .cse10) (not (= 259 main_~status~9))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse12 .cse11 .cse4 .cse7) (not (= |old(~customIrp~0)| 0)))))) [2018-11-23 12:37:37,639 INFO L444 ceAbstractionStarter]: At program point L1754(line 1754) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,639 INFO L448 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-11-23 12:37:37,639 INFO L448 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-11-23 12:37:37,640 INFO L444 ceAbstractionStarter]: At program point L1846(line 1846) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,640 INFO L444 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and (= 0 ~pended~0) .cse13))) (let ((.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (= ~IPC~0 ~s~0)) (.cse8 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (and .cse0 .cse3 .cse7)) (.cse12 (= 0 main_~status~9)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse10) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse12 .cse4 .cse5 .cse7) (and .cse0 (= ~routine~0 0) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 ~compRegistered~0) .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (and .cse8 .cse9 .cse2 .cse6 .cse10) (not (= 259 main_~status~9))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse12 .cse11 .cse4 .cse7) (not (= |old(~customIrp~0)| 0)))))) [2018-11-23 12:37:37,640 INFO L448 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-11-23 12:37:37,640 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-11-23 12:37:37,640 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-11-23 12:37:37,640 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-11-23 12:37:37,640 INFO L448 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-11-23 12:37:37,640 INFO L444 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse4 (= ~lowerDriverReturn~0 main_~status~9)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse1 (<= ~s~0 ~DC~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (and (let ((.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse5 .cse6 (and .cse3 .cse4)) (and (and .cse5 .cse6 .cse3) (= ~DC~0 ~s~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (and .cse1 .cse2 .cse0 (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~9))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~9) .cse3 .cse4) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse0 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 12:37:37,641 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 1716 1878) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (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)|)) (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)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~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)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,641 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-11-23 12:37:37,641 INFO L444 ceAbstractionStarter]: At program point L1781(lines 1780 1817) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0) .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)) (let ((.cse10 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse10) .cse6 .cse7 .cse8 (<= .cse10 0) .cse9)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,641 INFO L444 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (= 0 main_~status~9)) (.cse4 (= ~DC~0 ~s~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (and .cse10 .cse11 .cse2)) (.cse3 (= ~IPC~0 ~s~0)) (.cse8 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse4 (not (= 259 main_~status~9)) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse5 .cse6 (<= (+ main_~status~9 1073741789) 0) .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse10 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 .cse11 .cse1 .cse2 .cse3 .cse8) (and .cse10 .cse6 .cse9 .cse11 .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 12:37:37,641 INFO L448 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-11-23 12:37:37,641 INFO L444 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (and .cse13 (= 0 ~pended~0))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse2 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse9 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (= ~DC~0 ~s~0)) (.cse11 (and .cse4 .cse1 .cse7)) (.cse12 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (= 0 main_~status~9)) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse8 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~myStatus~0)| 0)) (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)|)) (not (= |old(~customIrp~0)| 0)))))) [2018-11-23 12:37:37,641 INFO L448 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-11-23 12:37:37,641 INFO L448 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-11-23 12:37:37,642 INFO L448 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-11-23 12:37:37,642 INFO L448 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-11-23 12:37:37,642 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (= |old(~customIrp~0)| ~customIrp~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 (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,642 INFO L448 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-11-23 12:37:37,642 INFO L444 ceAbstractionStarter]: At program point L1791(lines 1790 1815) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,642 INFO L448 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-11-23 12:37:37,642 INFO L444 ceAbstractionStarter]: At program point L1866(line 1866) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,642 INFO L448 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-11-23 12:37:37,642 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-11-23 12:37:37,642 INFO L448 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-11-23 12:37:37,642 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-11-23 12:37:37,643 INFO L451 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-11-23 12:37:37,643 INFO L448 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-11-23 12:37:37,643 INFO L448 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-11-23 12:37:37,643 INFO L448 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-11-23 12:37:37,643 INFO L444 ceAbstractionStarter]: At program point L1860(line 1860) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,643 INFO L444 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (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 (= ~customIrp~0 0))) [2018-11-23 12:37:37,643 INFO L448 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-11-23 12:37:37,643 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (or (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 (= ~customIrp~0 0))) (= ~s~0 |old(~s~0)|)) [2018-11-23 12:37:37,643 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-11-23 12:37:37,643 INFO L448 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L444 ceAbstractionStarter]: At program point L2075(lines 2074 2097) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0))) [2018-11-23 12:37:37,644 INFO L444 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L444 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L444 ceAbstractionStarter]: At program point L2080(lines 2079 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-11-23 12:37:37,644 INFO L448 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-11-23 12:37:37,645 INFO L448 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-11-23 12:37:37,645 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-11-23 12:37:37,645 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-11-23 12:37:37,645 INFO L444 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2018-11-23 12:37:37,645 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-11-23 12:37:37,645 INFO L448 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-11-23 12:37:37,645 INFO L448 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-11-23 12:37:37,645 INFO L444 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,645 INFO L444 ceAbstractionStarter]: At program point L2082(lines 2081 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,645 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-11-23 12:37:37,645 INFO L444 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,645 INFO L448 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L444 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-11-23 12:37:37,646 INFO L448 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-11-23 12:37:37,647 INFO L444 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 0 .cse20)) (.cse5 (< .cse20 0)) (.cse3 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~myStatus~0 0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse10 (< ~MPR3~0 (+ ~NP~0 5))) (.cse18 (not (= |old(~s~0)| ~NP~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse15 (let ((.cse19 (or .cse1 (or .cse10 .cse18 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse2 .cse11 .cse6 .cse7 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse3 .cse4 .cse5 .cse19) (or .cse3 .cse9 .cse19)))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse12 (< ~compRegistered~0 1)) (.cse13 (not (= 1 ~routine~0))) (.cse16 (= |old(~customIrp~0)| ~customIrp~0)) (.cse14 (not (= |old(~customIrp~0)| 0)))) (and (or (let ((.cse8 (or .cse10 .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7 .cse8))) (not (= |old(~s~0)| ~MPR3~0)) .cse14) (or (= |old(~s~0)| ~s~0) .cse15) (or .cse16 (or .cse15 .cse14)) (or (let ((.cse17 (or .cse2 .cse11 .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse10 .cse18) .cse12 .cse7 .cse13))) (and (or .cse0 .cse3 .cse4 .cse5 .cse17) (or .cse0 .cse3 .cse9 .cse17))) (and (= 1 ~setEventCalled~0) (= ~s~0 |old(~s~0)|) .cse16) .cse14))))) [2018-11-23 12:37:37,647 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-11-23 12:37:37,647 INFO L448 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-11-23 12:37:37,647 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-11-23 12:37:37,647 INFO L444 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 0 .cse21)) (.cse5 (< .cse21 0)) (.cse3 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~myStatus~0 0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse10 (< ~MPR3~0 (+ ~NP~0 5))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse15 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse12 (< ~compRegistered~0 1)) (.cse13 (not (= 1 ~routine~0))) (.cse16 (not (= |old(~customIrp~0)| 0))) (.cse17 (let ((.cse20 (or .cse1 (or .cse10 .cse19 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse2 .cse11 .cse6 .cse7 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse3 .cse4 .cse5 .cse20) (or .cse3 .cse9 .cse20)))) (.cse14 (= ~s~0 ~NP~0))) (and (or (let ((.cse8 (or .cse10 .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7 .cse8))) (and .cse14 .cse15) (not (= |old(~s~0)| ~MPR3~0)) .cse16) (or .cse15 (or .cse17 .cse16)) (or (and .cse15 (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0))) (or (let ((.cse18 (or .cse2 .cse11 .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse10 .cse19) .cse12 .cse7 .cse13))) (and (or .cse0 .cse3 .cse4 .cse5 .cse18) (or .cse0 .cse3 .cse9 .cse18))) .cse16)) (or .cse17 .cse14))))) [2018-11-23 12:37:37,647 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-11-23 12:37:37,647 INFO L444 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 0 .cse21)) (.cse5 (< .cse21 0)) (.cse3 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~myStatus~0 0))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse10 (< ~MPR3~0 (+ ~NP~0 5))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse15 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse12 (< ~compRegistered~0 1)) (.cse13 (not (= 1 ~routine~0))) (.cse16 (not (= |old(~customIrp~0)| 0))) (.cse17 (let ((.cse20 (or .cse1 (or .cse10 .cse19 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse2 .cse11 .cse6 .cse7 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse3 .cse4 .cse5 .cse20) (or .cse3 .cse9 .cse20)))) (.cse14 (= ~s~0 ~NP~0))) (and (or (let ((.cse8 (or .cse10 .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7 .cse8))) (and .cse14 .cse15) (not (= |old(~s~0)| ~MPR3~0)) .cse16) (or .cse15 (or .cse17 .cse16)) (or (and .cse15 (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0))) (or (let ((.cse18 (or .cse2 .cse11 .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse10 .cse19) .cse12 .cse7 .cse13))) (and (or .cse0 .cse3 .cse4 .cse5 .cse18) (or .cse0 .cse3 .cse9 .cse18))) .cse16)) (or .cse17 .cse14))))) [2018-11-23 12:37:37,648 INFO L444 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= 0 ~pended~0))) (.cse8 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~myStatus~0 0))) (.cse13 (< ~compRegistered~0 1)) (.cse14 (not (= 1 ~routine~0))) (.cse15 (not (= |old(~customIrp~0)| 0))) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (< 0 .cse18)) (.cse7 (< .cse18 0)) (.cse2 (or .cse4 (or .cse11 .cse17 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse5 .cse12 .cse8 .cse9 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse0 .cse1 .cse2) (or (let ((.cse10 (or .cse11 .cse12 .cse13 .cse14))) (and (or .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse4 .cse5 .cse0 .cse1 .cse8 .cse9 .cse10))) (not (= |old(~s~0)| ~MPR3~0)) .cse15) (or (let ((.cse16 (or .cse5 .cse12 .cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse11 .cse17) .cse13 .cse9 .cse14))) (and (or .cse3 .cse0 .cse6 .cse7 .cse16) (or .cse3 .cse0 .cse1 .cse16))) .cse15) (or .cse0 .cse6 .cse7 .cse2)))) [2018-11-23 12:37:37,648 INFO L448 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-11-23 12:37:37,648 INFO L448 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-11-23 12:37:37,648 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-11-23 12:37:37,648 INFO L448 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-11-23 12:37:37,648 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-11-23 12:37:37,648 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (< 0 .cse21)) (.cse6 (< .cse21 0)) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~myStatus~0 0))) (.cse18 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 ~pended~0))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse15 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse0 (let ((.cse20 (or .cse18 (or .cse12 .cse13 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse9 .cse10 .cse11 .cse15 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse4 .cse5 .cse6 .cse20) (or .cse4 .cse8 .cse20)))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse14 (< ~compRegistered~0 1)) (.cse16 (not (= 1 ~routine~0))) (.cse17 (and (= 1 ~setEventCalled~0) (= ~s~0 |old(~s~0)|) .cse1)) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or (= |old(~s~0)| ~s~0) .cse0) (or .cse1 (or .cse0 .cse2)) (or (or (let ((.cse7 (or .cse9 .cse10 .cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse12 .cse13) .cse14 .cse15 .cse16))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse3 .cse4 .cse8 .cse7))) .cse2) .cse17) (or (let ((.cse19 (or .cse12 .cse10 .cse14 .cse16))) (and (or .cse3 .cse18 .cse9 .cse4 .cse5 .cse6 .cse11 .cse15 .cse19) (or .cse3 .cse18 .cse9 .cse4 .cse8 .cse11 .cse15 .cse19))) .cse17 (not (= |old(~s~0)| ~MPR3~0)) .cse2))))) [2018-11-23 12:37:37,648 INFO L444 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (< ~SKIP2~0 .cse14)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-23 12:37:37,648 INFO L448 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-11-23 12:37:37,649 INFO L444 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,649 INFO L448 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-11-23 12:37:37,649 INFO L444 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-11-23 12:37:37,649 INFO L444 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-11-23 12:37:37,649 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-11-23 12:37:37,649 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-11-23 12:37:37,649 INFO L448 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-11-23 12:37:37,649 INFO L444 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-11-23 12:37:37,649 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-11-23 12:37:37,649 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-11-23 12:37:37,650 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-11-23 12:37:37,650 INFO L448 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-11-23 12:37:37,650 INFO L448 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-11-23 12:37:37,650 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (= |old(~s~0)| ~s~0)) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse5) (< ~IPC~0 (+ ~SKIP2~0 3))) .cse6) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-11-23 12:37:37,650 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-11-23 12:37:37,650 INFO L444 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 (< ~IPC~0 (+ ~DC~0 5)) (or .cse5 (not (= ~compRegistered~0 0)))) (or (or (or (or .cse1 .cse5) .cse0 .cse2 .cse3 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse4) (< ~IPC~0 (+ ~SKIP2~0 3))))) [2018-11-23 12:37:37,650 INFO L444 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,650 INFO L448 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-11-23 12:37:37,650 INFO L444 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,650 INFO L444 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 12:37:37,650 INFO L448 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-11-23 12:37:37,651 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-11-23 12:37:37,651 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-11-23 12:37:37,651 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-11-23 12:37:37,651 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-11-23 12:37:37,651 INFO L444 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (= 0 ~pended~0)) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse11) .cse3 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,651 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-11-23 12:37:37,651 INFO L444 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< 0 .cse0) (< ~SKIP1~0 (+ ~s~0 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (< .cse0 0) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1))) [2018-11-23 12:37:37,651 INFO L448 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-11-23 12:37:37,651 INFO L444 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ ~s~0 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse1 0) .cse8 .cse9 .cse10)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-11-23 12:37:37,651 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-11-23 12:37:37,651 INFO L448 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-11-23 12:37:37,652 INFO L448 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-11-23 12:37:37,652 INFO L451 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-11-23 12:37:37,652 INFO L448 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-11-23 12:37:37,652 INFO L448 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-11-23 12:37:37,656 INFO L448 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-11-23 12:37:37,656 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-11-23 12:37:37,656 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-11-23 12:37:37,656 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-11-23 12:37:37,656 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-11-23 12:37:37,656 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)) (= |old(~customIrp~0)| ~customIrp~0)) (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 (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,656 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-11-23 12:37:37,656 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-11-23 12:37:37,656 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (or (or (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 (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-23 12:37:37,656 INFO L448 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-11-23 12:37:37,657 INFO L444 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (and (and (= |old(~customIrp~0)| ~customIrp~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)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,657 INFO L448 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-11-23 12:37:37,665 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-23 12:37:37,665 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-11-23 12:37:37,665 INFO L448 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-11-23 12:37:37,665 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-11-23 12:37:37,665 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (and (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,665 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-11-23 12:37:37,665 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-11-23 12:37:37,665 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-11-23 12:37:37,665 INFO L444 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (and (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,666 INFO L444 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (and (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,666 INFO L444 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,669 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-11-23 12:37:37,670 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-11-23 12:37:37,670 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-23 12:37:37,670 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-23 12:37:37,670 INFO L444 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (and (<= (+ |old(~myStatus~0)| 1) 0) (= |old(~myStatus~0)| ~myStatus~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,670 INFO L448 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-11-23 12:37:37,670 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-11-23 12:37:37,670 INFO L444 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~s~0 |old(~s~0)|) (<= (+ ~myStatus~0 1073741637) 0) (= |old(~customIrp~0)| ~customIrp~0)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,670 INFO L444 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,674 INFO L444 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (and (and (= |old(~customIrp~0)| ~customIrp~0) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= 1 ~setEventCalled~0) (= ~myStatus~0 |old(~myStatus~0)|))) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (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 (= |old(~customIrp~0)| 0)))) [2018-11-23 12:37:37,674 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-23 12:37:37,674 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-11-23 12:37:37,674 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-23 12:37:37,674 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-11-23 12:37:37,674 INFO L448 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-11-23 12:37:37,674 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-11-23 12:37:37,674 INFO L444 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (or (or (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 (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-23 12:37:37,674 INFO L451 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-11-23 12:37:37,674 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-11-23 12:37:37,675 INFO L451 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-11-23 12:37:37,675 INFO L448 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-11-23 12:37:37,679 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-11-23 12:37:37,679 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-11-23 12:37:37,679 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-11-23 12:37:37,679 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-11-23 12:37:37,679 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-11-23 12:37:37,679 INFO L444 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,679 INFO L448 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-11-23 12:37:37,679 INFO L444 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-11-23 12:37:37,680 INFO L448 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-11-23 12:37:37,680 INFO L444 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,680 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-11-23 12:37:37,680 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-11-23 12:37:37,680 INFO L448 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-11-23 12:37:37,680 INFO L444 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,683 INFO L444 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0))) [2018-11-23 12:37:37,683 INFO L448 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-11-23 12:37:37,683 INFO L448 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-11-23 12:37:37,684 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-11-23 12:37:37,684 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-11-23 12:37:37,684 INFO L444 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,684 INFO L444 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) [2018-11-23 12:37:37,684 INFO L444 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,688 INFO L448 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-11-23 12:37:37,688 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-11-23 12:37:37,689 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-11-23 12:37:37,689 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-11-23 12:37:37,689 INFO L444 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,689 INFO L448 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-11-23 12:37:37,689 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-11-23 12:37:37,689 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-11-23 12:37:37,689 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-11-23 12:37:37,689 INFO L444 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-11-23 12:37:37,689 INFO L448 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-11-23 12:37:37,689 INFO L444 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,701 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-11-23 12:37:37,701 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-11-23 12:37:37,701 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-11-23 12:37:37,701 INFO L444 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,701 INFO L448 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-11-23 12:37:37,702 INFO L444 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-11-23 12:37:37,702 INFO L448 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-11-23 12:37:37,702 INFO L448 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-11-23 12:37:37,702 INFO L444 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,702 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-11-23 12:37:37,712 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-11-23 12:37:37,712 INFO L448 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-11-23 12:37:37,712 INFO L444 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-23 12:37:37,712 INFO L444 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-11-23 12:37:37,713 INFO L444 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-23 12:37:37,713 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-11-23 12:37:37,728 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-11-23 12:37:37,728 INFO L444 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse11) (<= .cse11 0)))) [2018-11-23 12:37:37,728 INFO L448 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-11-23 12:37:37,728 INFO L444 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,728 INFO L448 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-11-23 12:37:37,728 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-11-23 12:37:37,728 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-11-23 12:37:37,728 INFO L444 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,729 INFO L448 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-11-23 12:37:37,729 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-11-23 12:37:37,729 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-11-23 12:37:37,729 INFO L444 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) [2018-11-23 12:37:37,737 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-11-23 12:37:37,737 INFO L444 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-11-23 12:37:37,738 INFO L448 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-11-23 12:37:37,738 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-11-23 12:37:37,738 INFO L444 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,738 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-11-23 12:37:37,738 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-11-23 12:37:37,738 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-11-23 12:37:37,738 INFO L444 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-11-23 12:37:37,738 INFO L448 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-11-23 12:37:37,740 INFO L448 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-11-23 12:37:37,741 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-11-23 12:37:37,741 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-11-23 12:37:37,741 INFO L448 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-11-23 12:37:37,741 INFO L444 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,741 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-11-23 12:37:37,741 INFO L448 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-11-23 12:37:37,741 INFO L444 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse26 (+ ~MPR3~0 1)) (.cse22 (+ ~SKIP2~0 3)) (.cse23 (+ ~SKIP1~0 2)) (.cse25 (+ ~DC~0 2)) (.cse24 (+ ~NP~0 5)) (.cse27 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse27)) (.cse8 (< .cse27 0)) (.cse13 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse24)) (.cse18 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse25)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse23)) (.cse7 (< ~IPC~0 .cse22)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse26)) (.cse11 (and (<= .cse22 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse23 ~MPR1~0) (= ~routine~0 0) (<= .cse24 ~MPR3~0) (<= .cse25 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse26 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (and .cse13 (= ~s~0 ~SKIP1~0)) (let ((.cse14 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse15 (< ~SKIP1~0 |old(~s~0)|)) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0)))) (and (or .cse14 .cse0 .cse1 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse17 .cse9 .cse10) (or .cse14 .cse0 .cse18 .cse3 .cse15 .cse4 .cse6 .cse7 .cse16 .cse17 .cse9 .cse10)))) (or (or (let ((.cse19 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 .cse12))) (and (or .cse7 .cse18 .cse19) (or .cse7 .cse1 .cse8 .cse19))) (not (= ~customIrp~0 0))) (let ((.cse20 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse21 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse20 0) .cse13 (<= 0 .cse20) (= 1 ~setEventCalled~0) (<= 0 .cse21) (= ~MPR1~0 ~s~0) (<= .cse21 0)))) (or .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-11-23 12:37:37,742 INFO L444 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse26 (+ ~MPR3~0 1)) (.cse22 (+ ~SKIP2~0 3)) (.cse23 (+ ~SKIP1~0 2)) (.cse25 (+ ~DC~0 2)) (.cse24 (+ ~NP~0 5)) (.cse27 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse27)) (.cse8 (< .cse27 0)) (.cse13 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse24)) (.cse18 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse25)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse23)) (.cse7 (< ~IPC~0 .cse22)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse26)) (.cse11 (and (<= .cse22 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse23 ~MPR1~0) (= ~routine~0 0) (<= .cse24 ~MPR3~0) (<= .cse25 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse26 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (and .cse13 (= ~s~0 ~SKIP1~0)) (let ((.cse14 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse15 (< ~SKIP1~0 |old(~s~0)|)) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0)))) (and (or .cse14 .cse0 .cse1 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse17 .cse9 .cse10) (or .cse14 .cse0 .cse18 .cse3 .cse15 .cse4 .cse6 .cse7 .cse16 .cse17 .cse9 .cse10)))) (or (or (let ((.cse19 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 .cse12))) (and (or .cse7 .cse18 .cse19) (or .cse7 .cse1 .cse8 .cse19))) (not (= ~customIrp~0 0))) (let ((.cse20 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse21 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse20 0) .cse13 (<= 0 .cse20) (= 1 ~setEventCalled~0) (<= 0 .cse21) (= ~MPR1~0 ~s~0) (<= .cse21 0)))) (or .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-11-23 12:37:37,746 INFO L448 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-11-23 12:37:37,746 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-11-23 12:37:37,746 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-11-23 12:37:37,746 INFO L448 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-11-23 12:37:37,746 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-11-23 12:37:37,747 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse15 (= 0 ~pended~0)) (.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse20)) (.cse9 (< .cse20 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 (or (let ((.cse14 (or .cse0 .cse3 .cse4 (not (= 1 ~routine~0)) .cse6 .cse7 .cse10 .cse11 .cse12))) (and (or .cse8 .cse13 .cse14) (or .cse8 .cse1 .cse9 .cse14))) (not (= ~customIrp~0 0))) (and .cse15 (= ~s~0 |old(~s~0)|))) (or (and .cse15 (= ~s~0 ~SKIP1~0)) (let ((.cse16 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse17 (< ~SKIP1~0 |old(~s~0)|)) (.cse18 (< |old(~s~0)| ~SKIP1~0)) (.cse19 (not (= ~compRegistered~0 0)))) (and (or .cse16 .cse0 .cse1 .cse4 .cse17 .cse5 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11) (or .cse16 .cse0 .cse13 .cse4 .cse17 .cse5 .cse7 .cse8 .cse18 .cse19 .cse10 .cse11)))) (or .cse0 .cse13 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2018-11-23 12:37:37,747 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-11-23 12:37:37,752 INFO L448 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-11-23 12:37:37,752 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-11-23 12:37:37,752 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-11-23 12:37:37,752 INFO L444 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse26 (+ ~MPR3~0 1)) (.cse22 (+ ~SKIP2~0 3)) (.cse23 (+ ~SKIP1~0 2)) (.cse25 (+ ~DC~0 2)) (.cse24 (+ ~NP~0 5)) (.cse27 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse27)) (.cse8 (< .cse27 0)) (.cse13 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse24)) (.cse18 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse25)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse23)) (.cse7 (< ~IPC~0 .cse22)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse26)) (.cse11 (and (<= .cse22 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse23 ~MPR1~0) (= ~routine~0 0) (<= .cse24 ~MPR3~0) (<= .cse25 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse26 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (and .cse13 (= ~s~0 ~SKIP1~0)) (let ((.cse14 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse15 (< ~SKIP1~0 |old(~s~0)|)) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0)))) (and (or .cse14 .cse0 .cse1 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse17 .cse9 .cse10) (or .cse14 .cse0 .cse18 .cse3 .cse15 .cse4 .cse6 .cse7 .cse16 .cse17 .cse9 .cse10)))) (or (or (let ((.cse19 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 .cse12))) (and (or .cse7 .cse18 .cse19) (or .cse7 .cse1 .cse8 .cse19))) (not (= ~customIrp~0 0))) (let ((.cse20 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse21 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse20 0) .cse13 (<= 0 .cse20) (= 1 ~setEventCalled~0) (<= 0 .cse21) (= ~MPR1~0 ~s~0) (<= .cse21 0)))) (or .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-11-23 12:37:37,752 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-11-23 12:37:37,752 INFO L448 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-11-23 12:37:37,752 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-11-23 12:37:37,753 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-11-23 12:37:37,753 INFO L444 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse3 (< 0 .cse18)) (.cse4 (< .cse18 0)) (.cse13 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~SKIP1~0 |old(~s~0)|)) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (not (= ~myStatus~0 0))) (.cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (not (= 0 ~routine~0))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or (let ((.cse2 (or .cse5 .cse6 .cse7 (not (= 1 ~routine~0)) .cse8 .cse9 .cse10 .cse11 .cse12))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse4 .cse2))) (not (= ~customIrp~0 0))) (or .cse13 .cse5 .cse3 .cse7 .cse14 .cse15 .cse9 .cse0 .cse4 .cse16 .cse17 .cse10 .cse11) (or .cse5 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse0 .cse4 .cse10 .cse11 .cse12) (or .cse13 .cse5 .cse1 .cse7 .cse14 .cse15 .cse9 .cse0 .cse16 .cse17 .cse10 .cse11) (or .cse5 .cse1 .cse6 .cse7 .cse15 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12)))) [2018-11-23 12:37:37,761 INFO L448 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-11-23 12:37:37,762 INFO L444 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse19 (+ ~myStatus~0 1073741637))) (let ((.cse3 (< 0 .cse19)) (.cse4 (< .cse19 0)) (.cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse13 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~compRegistered~0 1)) (.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (not (= ~myStatus~0 0))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (< ~SKIP1~0 |old(~s~0)|)) (.cse14 (not (= 0 ~routine~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (< |old(~s~0)| ~SKIP1~0)) (.cse18 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or (let ((.cse2 (or .cse5 .cse6 .cse7 (not (= 1 ~routine~0)) .cse8 .cse9 .cse10 .cse11 .cse12))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse4 .cse2))) (not (= ~customIrp~0 0))) (or .cse5 .cse3 .cse13 .cse6 .cse7 .cse14 .cse8 .cse9 .cse0 .cse4 .cse10 .cse11 .cse12) (or .cse15 .cse5 .cse3 .cse7 .cse16 .cse14 .cse9 .cse0 .cse4 .cse17 .cse18 .cse10 .cse11) (or .cse5 .cse1 .cse6 .cse7 .cse13 .cse14 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12) (or .cse15 .cse5 .cse1 .cse7 .cse16 .cse14 .cse9 .cse0 .cse17 .cse18 .cse10 .cse11)))) [2018-11-23 12:37:37,762 INFO L448 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-11-23 12:37:37,762 INFO L444 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse26 (+ ~MPR3~0 1)) (.cse22 (+ ~SKIP2~0 3)) (.cse23 (+ ~SKIP1~0 2)) (.cse25 (+ ~DC~0 2)) (.cse24 (+ ~NP~0 5)) (.cse27 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse27)) (.cse8 (< .cse27 0)) (.cse13 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse24)) (.cse18 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse25)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse23)) (.cse7 (< ~IPC~0 .cse22)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse26)) (.cse11 (and (<= .cse22 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse23 ~MPR1~0) (= ~routine~0 0) (<= .cse24 ~MPR3~0) (<= .cse25 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse26 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (and .cse13 (= ~s~0 ~SKIP1~0)) (let ((.cse14 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse15 (< ~SKIP1~0 |old(~s~0)|)) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0)))) (and (or .cse14 .cse0 .cse1 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse17 .cse9 .cse10) (or .cse14 .cse0 .cse18 .cse3 .cse15 .cse4 .cse6 .cse7 .cse16 .cse17 .cse9 .cse10)))) (or (or (let ((.cse19 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 .cse12))) (and (or .cse7 .cse18 .cse19) (or .cse7 .cse1 .cse8 .cse19))) (not (= ~customIrp~0 0))) (let ((.cse20 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse21 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse20 0) .cse13 (<= 0 .cse20) (= 1 ~setEventCalled~0) (<= 0 .cse21) (= ~MPR1~0 ~s~0) (<= .cse21 0)))) (or .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-11-23 12:37:37,774 INFO L444 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse22 (+ ~myStatus~0 1073741637))) (let ((.cse20 (not (= ~myStatus~0 0))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (< 0 .cse22)) (.cse12 (< .cse22 0)) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse18 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 |old(~pended~0)|))) (.cse16 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse19 (< ~compRegistered~0 1))) (let ((.cse2 (let ((.cse21 (or .cse5 .cse17 .cse7 (not (= 1 ~routine~0)) .cse18 .cse10 .cse15 .cse16 .cse19))) (and (or .cse11 .cse20 .cse21) (or .cse11 .cse6 .cse12 .cse21)))) (.cse3 (not (= ~customIrp~0 0))) (.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (< ~SKIP1~0 |old(~s~0)|)) (.cse13 (< |old(~s~0)| ~SKIP1~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 ~routine~0)))) (and (or (let ((.cse0 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse0 0) (= 0 ~pended~0) (<= 0 .cse0) (<= .cse1 0) (= 1 ~setEventCalled~0) (<= 0 .cse1))) (or .cse2 .cse3)) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse5 .cse6 .cse17 .cse7 .cse9 .cse18 .cse10 .cse11 .cse12 .cse15 .cse16 .cse19) (or .cse2 .cse3 (= ~s~0 |old(~s~0)|)) (or .cse4 .cse5 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (or .cse5 .cse20 .cse17 .cse7 .cse9 .cse18 .cse10 .cse11 .cse15 .cse16 .cse19))))) [2018-11-23 12:37:37,775 INFO L444 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse3 (< 0 .cse18)) (.cse4 (< .cse18 0)) (.cse13 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~SKIP1~0 |old(~s~0)|)) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (not (= ~myStatus~0 0))) (.cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (not (= 0 ~routine~0))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or (or (let ((.cse2 (or .cse5 .cse6 .cse7 (not (= 1 ~routine~0)) .cse8 .cse9 .cse10 .cse11 .cse12))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse4 .cse2))) (not (= ~customIrp~0 0))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|))) (or .cse13 .cse5 .cse3 .cse7 .cse14 .cse15 .cse9 .cse0 .cse4 .cse16 .cse17 .cse10 .cse11) (or .cse5 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse0 .cse4 .cse10 .cse11 .cse12) (or .cse13 .cse5 .cse1 .cse7 .cse14 .cse15 .cse9 .cse0 .cse16 .cse17 .cse10 .cse11) (or .cse5 .cse1 .cse6 .cse7 .cse15 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12)))) [2018-11-23 12:37:37,785 INFO L448 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-11-23 12:37:37,785 INFO L448 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-11-23 12:37:37,785 INFO L448 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-11-23 12:37:37,786 INFO L444 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-23 12:37:37,786 INFO L444 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-23 12:37:37,786 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-23 12:37:37,786 INFO L444 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-23 12:37:37,786 INFO L448 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-11-23 12:37:37,786 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-11-23 12:37:37,786 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-11-23 12:37:37,786 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-11-23 12:37:37,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:37:37,786 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-23 12:37:37,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:37:37,795 INFO L444 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-23 12:37:37,795 INFO L448 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-11-23 12:37:37,795 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-11-23 12:37:37,795 INFO L444 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-23 12:37:37,795 INFO L448 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-11-23 12:37:37,795 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-11-23 12:37:37,796 INFO L448 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-11-23 12:37:37,796 INFO L444 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-23 12:37:37,796 INFO L448 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-11-23 12:37:37,796 INFO L444 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-23 12:37:37,796 INFO L448 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-11-23 12:37:37,796 INFO L444 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-23 12:37:37,796 INFO L448 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-11-23 12:37:37,796 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-11-23 12:37:37,796 INFO L444 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,804 INFO L444 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~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-23 12:37:37,805 INFO L448 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-11-23 12:37:37,805 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-11-23 12:37:37,805 INFO L448 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-11-23 12:37:37,805 INFO L448 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-11-23 12:37:37,805 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-11-23 12:37:37,805 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-11-23 12:37:37,805 INFO L444 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse11 (+ ~NP~0 5))) (let ((.cse12 (and (= 0 ~pended~0) (<= .cse11 ~MPR3~0))) (.cse14 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse13 (= ~routine~0 0)) (.cse15 (= ~IPC~0 ~s~0))) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 .cse11)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (not (= 259 CdAudioDeviceControl_~status~3)) (= ~DC~0 ~s~0) (and .cse12 .cse13)) (and .cse14 (<= 1 ~compRegistered~0) .cse15 .cse13) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse12 .cse13 (= ~SKIP2~0 ~s~0)) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (and .cse12 .cse14 .cse13 .cse15)))) [2018-11-23 12:37:37,805 INFO L444 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,813 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-11-23 12:37:37,813 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-11-23 12:37:37,813 INFO L444 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,813 INFO L448 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-11-23 12:37:37,813 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-11-23 12:37:37,813 INFO L444 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,814 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-23 12:37:37,814 INFO L444 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,814 INFO L444 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 12:37:37,824 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-11-23 12:37:37,824 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-11-23 12:37:37,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:37:37,824 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0)) [2018-11-23 12:37:37,824 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:37:37,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:37:37,825 INFO L444 ceAbstractionStarter]: At program point L1225(line 1225) 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 (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,825 INFO L448 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-11-23 12:37:37,825 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1474) 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) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,831 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-11-23 12:37:37,832 INFO L444 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp106~1 1073741670)) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp106~1 4294967296) 1) 0)) (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-23 12:37:37,832 INFO L448 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-11-23 12:37:37,832 INFO L448 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-11-23 12:37:37,832 INFO L444 ceAbstractionStarter]: At program point L1143(line 1143) 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 (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-23 12:37:37,832 INFO L448 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-11-23 12:37:37,832 INFO L448 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-11-23 12:37:37,832 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-11-23 12:37:37,832 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-11-23 12:37:37,832 INFO L444 ceAbstractionStarter]: At program point L1309(line 1309) 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 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse11 0) (<= 0 .cse11) (<= (+ (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-23 12:37:37,841 INFO L448 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-11-23 12:37:37,841 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-11-23 12:37:37,841 INFO L444 ceAbstractionStarter]: At program point L1078(lines 1077 1470) 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) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,841 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-11-23 12:37:37,842 INFO L444 ceAbstractionStarter]: At program point L1442(line 1442) 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 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-23 12:37:37,842 INFO L448 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-11-23 12:37:37,842 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-11-23 12:37:37,842 INFO L444 ceAbstractionStarter]: At program point L1393(line 1393) 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) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-11-23 12:37:37,850 INFO L448 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-11-23 12:37:37,850 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-11-23 12:37:37,850 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-11-23 12:37:37,851 INFO L448 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-11-23 12:37:37,851 INFO L444 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse15 (+ ~NP~0 2)) (.cse14 (+ ~NP~0 5)) (.cse12 (+ ~SKIP1~0 2)) (.cse11 (+ ~MPR3~0 1))) (let ((.cse16 (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse13 ~SKIP2~0) (and (<= .cse15 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse14 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse12 ~MPR1~0)) (<= .cse11 ~IPC~0)))) (or (let ((.cse0 (< ~SKIP1~0 .cse15)) (.cse1 (< ~MPR3~0 .cse14)) (.cse3 (< ~SKIP2~0 .cse13)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse12)) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~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))) (and (= 0 CdAudio435DeviceControl_~status~6) .cse16) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse16)))) [2018-11-23 12:37:37,851 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-11-23 12:37:37,851 INFO L448 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-11-23 12:37:37,851 INFO L444 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (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-23 12:37:37,851 INFO L448 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-11-23 12:37:37,851 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-11-23 12:37:37,851 INFO L444 ceAbstractionStarter]: At program point L1114(lines 1113 1462) 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) (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-23 12:37:37,862 INFO L444 ceAbstractionStarter]: At program point L1015(lines 1014 1484) 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-23 12:37:37,862 INFO L444 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse15 (+ ~NP~0 2)) (.cse14 (+ ~NP~0 5)) (.cse12 (+ ~SKIP1~0 2)) (.cse11 (+ ~MPR3~0 1))) (let ((.cse16 (and (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse13 ~SKIP2~0) (and (<= .cse15 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse14 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse12 ~MPR1~0))) (<= .cse11 ~IPC~0)))) (or (let ((.cse0 (< ~SKIP1~0 .cse15)) (.cse1 (< ~MPR3~0 .cse14)) (.cse3 (< ~SKIP2~0 .cse13)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse12)) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~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))) (and (= 0 CdAudio435DeviceControl_~status~6) .cse16) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse16)))) [2018-11-23 12:37:37,862 INFO L448 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-11-23 12:37:37,863 INFO L448 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-11-23 12:37:37,863 INFO L444 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (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-23 12:37:37,863 INFO L444 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (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-23 12:37:37,874 INFO L448 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-11-23 12:37:37,874 INFO L448 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-11-23 12:37:37,874 INFO L448 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-11-23 12:37:37,874 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-11-23 12:37:37,874 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-11-23 12:37:37,874 INFO L444 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~myStatus~0) (and (let ((.cse11 (= 0 ~pended~0)) (.cse12 (= |old(~s~0)| ~s~0))) (or (and .cse11 .cse12 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse11 .cse12 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (= ~myStatus~0 |old(~myStatus~0)|)))) [2018-11-23 12:37:37,875 INFO L444 ceAbstractionStarter]: At program point L1347(line 1347) 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) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-11-23 12:37:37,875 INFO L448 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-11-23 12:37:37,875 INFO L448 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-11-23 12:37:37,875 INFO L444 ceAbstractionStarter]: At program point L1116(lines 1115 1462) 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) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,884 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-11-23 12:37:37,884 INFO L448 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-11-23 12:37:37,884 INFO L448 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-11-23 12:37:37,884 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-11-23 12:37:37,884 INFO L444 ceAbstractionStarter]: At program point L1150(lines 1150 1151) 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-23 12:37:37,884 INFO L448 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-11-23 12:37:37,885 INFO L444 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (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-23 12:37:37,885 INFO L448 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-11-23 12:37:37,885 INFO L444 ceAbstractionStarter]: At program point L1448(line 1448) 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)) (= ~myStatus~0 |old(~myStatus~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,892 INFO L448 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-11-23 12:37:37,892 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-11-23 12:37:37,892 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-11-23 12:37:37,892 INFO L448 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-11-23 12:37:37,892 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-11-23 12:37:37,892 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-11-23 12:37:37,892 INFO L444 ceAbstractionStarter]: At program point L1069(lines 1068 1472) 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) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,892 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-11-23 12:37:37,892 INFO L444 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (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-23 12:37:37,893 INFO L448 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-11-23 12:37:37,893 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-11-23 12:37:37,893 INFO L444 ceAbstractionStarter]: At program point L1400(lines 1400 1401) 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) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,898 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-11-23 12:37:37,898 INFO L448 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-11-23 12:37:37,898 INFO L444 ceAbstractionStarter]: At program point L1169(line 1169) 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 (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-23 12:37:37,898 INFO L448 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-11-23 12:37:37,898 INFO L444 ceAbstractionStarter]: At program point L1417(line 1417) 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) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,898 INFO L448 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-11-23 12:37:37,899 INFO L444 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (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-23 12:37:37,905 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-11-23 12:37:37,905 INFO L448 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L444 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) 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-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-11-23 12:37:37,906 INFO L444 ceAbstractionStarter]: At program point L1237(line 1237) 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 (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (= 0 ~myStatus~0))) [2018-11-23 12:37:37,909 INFO L448 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L448 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L444 ceAbstractionStarter]: At program point L1105(lines 1086 1468) 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))) [2018-11-23 12:37:37,910 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L448 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L448 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L448 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-11-23 12:37:37,910 INFO L444 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~myStatus~0) (and (let ((.cse11 (= 0 ~pended~0)) (.cse12 (= |old(~s~0)| ~s~0))) (or (and .cse11 .cse12 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse11 .cse12 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (= ~myStatus~0 |old(~myStatus~0)|)))) [2018-11-23 12:37:37,912 INFO L448 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-11-23 12:37:37,912 INFO L448 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-11-23 12:37:37,913 INFO L444 ceAbstractionStarter]: At program point L1354(line 1354) 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) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 12:37:37,913 INFO L448 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-11-23 12:37:37,913 INFO L448 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-11-23 12:37:37,913 INFO L448 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-11-23 12:37:37,913 INFO L448 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-11-23 12:37:37,913 INFO L448 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-11-23 12:37:37,913 INFO L448 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-11-23 12:37:37,913 INFO L444 ceAbstractionStarter]: At program point L1289(line 1289) 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) (= 0 CdAudio435DeviceControl_~status~6))) [2018-11-23 12:37:37,913 INFO L448 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L444 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (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-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-11-23 12:37:37,923 INFO L448 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-11-23 12:37:37,924 INFO L448 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-11-23 12:37:37,924 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-11-23 12:37:37,924 INFO L448 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-11-23 12:37:37,924 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-11-23 12:37:37,924 INFO L448 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-11-23 12:37:37,924 INFO L444 ceAbstractionStarter]: At program point L1125(line 1125) 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-23 12:37:37,924 INFO L448 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-11-23 12:37:37,924 INFO L448 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-11-23 12:37:37,937 INFO L451 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-11-23 12:37:37,937 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-11-23 12:37:37,937 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-11-23 12:37:37,937 INFO L448 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-11-23 12:37:37,937 INFO L448 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-11-23 12:37:37,937 INFO L448 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-11-23 12:37:37,937 INFO L444 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (or (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 (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,938 INFO L448 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-11-23 12:37:37,938 INFO L448 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-11-23 12:37:37,938 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-11-23 12:37:37,938 INFO L444 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (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 (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,938 INFO L448 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-11-23 12:37:37,938 INFO L444 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= |old(~customIrp~0)| ~customIrp~0)) (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 (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,938 INFO L444 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (or (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 (= |old(~customIrp~0)| 0))) [2018-11-23 12:37:37,945 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-11-23 12:37:37,945 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-11-23 12:37:37,945 INFO L444 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse3 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse4 (= 0 ~pended~0)) (.cse5 (<= 1 ~compRegistered~0)) (.cse7 (= ~routine~0 1)) (.cse6 (= 1 ~setEventCalled~0)) (.cse8 (= |old(~customIrp~0)| ~customIrp~0))) (or (or (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 (= |old(~customIrp~0)| 0))) (and (and .cse3 .cse4 (= |old(~s~0)| ~s~0) .cse5 .cse6 .cse7) .cse8) (and (and .cse3 .cse4 .cse5 .cse7 .cse6) (= ~s~0 ~MPR3~0) .cse8))) [2018-11-23 12:37:37,945 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-11-23 12:37:37,945 INFO L451 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-11-23 12:37:37,945 INFO L451 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-11-23 12:37:37,945 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-11-23 12:37:37,945 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-11-23 12:37:37,945 INFO L448 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-11-23 12:37:37,945 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-11-23 12:37:37,945 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-11-23 12:37:38,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:37:38 BoogieIcfgContainer [2018-11-23 12:37:38,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:37:38,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:37:38,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:37:38,025 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:37:38,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:36:42" (3/4) ... [2018-11-23 12:37:38,029 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:37:38,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-11-23 12:37:38,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-23 12:37:38,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-11-23 12:37:38,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-11-23 12:37:38,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-23 12:37:38,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-11-23 12:37:38,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 12:37:38,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-11-23 12:37:38,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:37:38,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-11-23 12:37:38,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-11-23 12:37:38,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-11-23 12:37:38,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-11-23 12:37:38,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-11-23 12:37:38,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-23 12:37:38,057 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2018-11-23 12:37:38,059 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-23 12:37:38,060 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 12:37:38,088 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || (((((((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))) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,088 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,089 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,090 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && ((0 == pended && s == SKIP1) || (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || 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)))) && (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) || !(customIrp == 0)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0))) && (((((((((((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-23 12:37:38,090 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || (s == NP && \old(customIrp) == customIrp)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (\old(customIrp) == customIrp || ((((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)) || !(\old(customIrp) == 0))) && ((\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled) || (((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && (((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || !(\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-23 12:37:38,090 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || (s == NP && \old(customIrp) == customIrp)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (\old(customIrp) == customIrp || ((((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)) || !(\old(customIrp) == 0))) && ((\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled) || (((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && (((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || !(\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-23 12:37:38,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) [2018-11-23 12:37:38,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\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(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 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)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) [2018-11-23 12:37:38,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && ((0 == pended && s == SKIP1) || (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || 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)))) && (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) || !(customIrp == 0)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0))) && (((((((((((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-23 12:37:38,092 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,092 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s) [2018-11-23 12:37:38,092 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (\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)))) && (\old(customIrp) == customIrp || ((((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)) || !(\old(customIrp) == 0))) && (((((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && (((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || ((1 == setEventCalled && s == \old(s)) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) [2018-11-23 12:37:38,093 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-11-23 12:37:38,093 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-11-23 12:37:38,093 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (\old(customIrp) == customIrp && ((((((((((((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)))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,093 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && ((0 == pended && s == SKIP1) || (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || 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)))) && (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) || !(customIrp == 0)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0))) && (((((((((((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-23 12:37:38,093 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && ((0 == pended && s == SKIP1) || (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || 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)))) && (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) || !(customIrp == 0)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0))) && (((((((((((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-23 12:37:38,094 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,094 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && \old(customIrp) == customIrp) && \old(myStatus) == 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)) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,094 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,094 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,095 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) [2018-11-23 12:37:38,095 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,095 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,095 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) && ((((((((((((((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) || !(\old(customIrp) == 0)) [2018-11-23 12:37:38,095 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) [2018-11-23 12:37:38,095 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (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-23 12:37:38,096 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,096 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || 0 < myStatus + 1073741637) || !(\old(customIrp) == 0)) && ((((((((((((((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 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) [2018-11-23 12:37:38,096 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (((0 <= status + 1073741670 && s == NP && 0 == pended) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) [2018-11-23 12:37:38,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && s == \old(s)) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) || ((((((((((((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)) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && \old(customIrp) == customIrp) && \old(myStatus) == 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)) || !(\old(customIrp) == 0) [2018-11-23 12:37:38,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-23 12:37:38,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == myStatus && (((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-23 12:37:38,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 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-23 12:37:38,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 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-23 12:37:38,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-23 12:37:38,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-23 12:37:38,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,156 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-23 12:37:38,156 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,156 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && \old(s) == s) [2018-11-23 12:37:38,157 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,157 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,188 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) [2018-11-23 12:37:38,188 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-23 12:37:38,188 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-23 12:37:38,340 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3a80f82a-bc1d-43c0-93c8-409b14964b1f/bin-2019/uautomizer/witness.graphml [2018-11-23 12:37:38,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:37:38,340 INFO L168 Benchmark]: Toolchain (without parser) took 57795.80 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 910.7 MB). Free memory was 957.6 MB in the beginning and 1.4 GB in the end (delta: -433.4 MB). Peak memory consumption was 477.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:37:38,341 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:37:38,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:37:38,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:37:38,341 INFO L168 Benchmark]: Boogie Preprocessor took 56.45 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-23 12:37:38,342 INFO L168 Benchmark]: RCFGBuilder took 1053.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.4 MB in the end (delta: 150.8 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:37:38,342 INFO L168 Benchmark]: TraceAbstraction took 55866.24 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 764.4 MB). Free memory was 974.4 MB in the beginning and 1.4 GB in the end (delta: -458.7 MB). Peak memory consumption was 974.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:37:38,342 INFO L168 Benchmark]: Witness Printer took 314.73 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:37:38,343 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.45 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 1053.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.4 MB in the end (delta: 150.8 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55866.24 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 764.4 MB). Free memory was 974.4 MB in the beginning and 1.4 GB in the end (delta: -458.7 MB). Peak memory consumption was 974.4 MB. Max. memory is 11.5 GB. * Witness Printer took 314.73 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1756]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) - 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))) || !(\old(customIrp) == 0) - 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) || 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 == 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) || 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 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || (((((((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))) || !(\old(customIrp) == 0) - 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) && ((0 == pended && s == SKIP1) || (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || 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)))) && (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) || !(customIrp == 0)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0))) && (((((((((((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: ((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || (s == NP && \old(customIrp) == customIrp)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (\old(customIrp) == customIrp || ((((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)) || !(\old(customIrp) == 0))) && ((\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled) || (((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && (((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || !(\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) && ((0 == pended && s == SKIP1) || (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || 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)))) && (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) || !(customIrp == 0)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0))) && (((((((((((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) || 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: 161]: Loop Invariant Derived loop invariant: ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || 0 < myStatus + 1073741637) || !(\old(customIrp) == 0)) && ((((((((((((((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 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && ((0 == pended && s == SKIP1) || (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || 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)))) && (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) || !(customIrp == 0)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0))) && (((((((((((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: ((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || (s == NP && \old(customIrp) == customIrp)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (\old(customIrp) == customIrp || ((((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)) || !(\old(customIrp) == 0))) && ((\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled) || (((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && (((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || !(\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: 171]: Loop Invariant Derived loop invariant: ((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) && ((((((((((((((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) || !(\old(customIrp) == 0)) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 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 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (\old(customIrp) == customIrp && ((((((((((((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)))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1086]: 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 == 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) || 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 == 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: (((((((((((((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)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (\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)))) && (\old(customIrp) == customIrp || ((((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)) || !(\old(customIrp) == 0))) && (((((((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && (((!(\old(setEventCalled) == 1) || IPC < SKIP2 + 3) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || !(\old(s) == NP)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine))) || ((1 == setEventCalled && s == \old(s)) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - 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) && ((0 == pended && s == SKIP1) || (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || 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)))) && (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) || !(customIrp == 0)) || ((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0))) && (((((((((((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) || 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: 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) || 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 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((0 == pended && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && s == \old(s)) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) || ((((((((((((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)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: 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 == myStatus && (((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: (((((((((((((!(\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(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 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)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1113]: 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 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) - 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) && 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) || 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: 263]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && \old(customIrp) == customIrp) && \old(myStatus) == 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)) || !(\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))) || !(\old(customIrp) == 0) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && \old(customIrp) == customIrp) && \old(myStatus) == 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)) || !(\old(customIrp) == 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 2050]: Loop Invariant Derived loop invariant: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 534 locations, 1 error locations. SAFE Result, 55.7s OverallTime, 96 OverallIterations, 2 TraceHistogramMax, 18.2s AutomataDifference, 0.0s DeadEndRemovalTime, 26.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 50944 SDtfs, 20266 SDslu, 226721 SDs, 0 SdLazy, 23010 SolverSat, 3461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 332 SyntacticMatches, 8 SemanticMatches, 750 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1011occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 96 MinimizatonAttempts, 2831 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1771 PreInvPairs, 2132 NumberOfFragments, 25919 HoareAnnotationTreeSize, 1771 FomulaSimplifications, 56749776 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 171 FomulaSimplificationsInter, 1443468 FormulaSimplificationTreeSizeReductionInter, 24.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 6443 NumberOfCodeBlocks, 6443 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 6346 ConstructedInterpolants, 0 QuantifiedInterpolants, 897374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 927 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 97 InterpolantComputations, 95 PerfectInterpolantSequences, 65/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...