java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:40:16,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:40:16,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:40:16,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:40:16,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:40:16,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:40:16,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:40:16,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:40:16,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:40:16,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:40:16,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:40:16,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:40:16,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:40:16,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:40:16,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:40:16,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:40:16,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:40:16,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:40:16,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:40:16,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:40:16,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:40:16,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:40:16,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:40:16,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:40:16,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:40:16,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:40:16,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:40:16,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:40:16,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:40:16,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:40:16,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:40:16,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:40:16,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:40:16,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:40:16,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:40:16,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:40:16,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:40:16,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:40:16,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:40:16,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:40:16,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:40:16,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:40:16,155 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:40:16,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:40:16,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:40:16,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:40:16,157 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:40:16,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:40:16,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:40:16,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:40:16,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:40:16,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:40:16,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:40:16,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:40:16,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:40:16,159 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:40:16,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:40:16,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:40:16,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:40:16,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:40:16,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:40:16,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:40:16,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:40:16,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:40:16,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:40:16,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:40:16,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:40:16,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:40:16,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:40:16,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:40:16,162 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:40:16,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:40:16,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:40:16,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:40:16,206 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:40:16,207 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:40:16,207 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-02 11:40:16,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e167fecef/3e424a3b676141cda8fb6c59eb139aea/FLAGfd6f8ba92 [2019-10-02 11:40:16,883 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:40:16,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-02 11:40:16,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e167fecef/3e424a3b676141cda8fb6c59eb139aea/FLAGfd6f8ba92 [2019-10-02 11:40:17,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e167fecef/3e424a3b676141cda8fb6c59eb139aea [2019-10-02 11:40:17,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:40:17,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:40:17,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:40:17,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:40:17,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:40:17,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:17,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5611840f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17, skipping insertion in model container [2019-10-02 11:40:17,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:17,118 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:40:17,204 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:40:17,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:40:17,763 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:40:17,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:40:17,951 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:40:17,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17 WrapperNode [2019-10-02 11:40:17,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:40:17,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:40:17,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:40:17,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:40:17,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:17,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:17,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:17,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:18,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:18,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:18,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (1/1) ... [2019-10-02 11:40:18,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:40:18,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:40:18,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:40:18,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:40:18,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-02 11:40:18,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:40:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:40:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-02 11:40:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-02 11:40:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-02 11:40:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-02 11:40:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-02 11:40:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-02 11:40:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-02 11:40:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-02 11:40:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-02 11:40:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-02 11:40:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-02 11:40:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-02 11:40:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-02 11:40:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-02 11:40:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-02 11:40:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-02 11:40:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-02 11:40:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-02 11:40:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-02 11:40:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-02 11:40:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:40:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-02 11:40:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-02 11:40:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-02 11:40:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-02 11:40:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-02 11:40:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-02 11:40:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-02 11:40:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:40:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 11:40:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:40:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 11:40:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 11:40:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-02 11:40:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-02 11:40:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-02 11:40:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-02 11:40:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-02 11:40:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-02 11:40:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-02 11:40:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-02 11:40:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-02 11:40:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-02 11:40:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-02 11:40:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-02 11:40:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-02 11:40:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-02 11:40:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-02 11:40:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-02 11:40:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-02 11:40:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-02 11:40:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-02 11:40:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-02 11:40:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-02 11:40:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-02 11:40:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-02 11:40:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-02 11:40:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-02 11:40:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-02 11:40:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:40:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-02 11:40:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:40:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:40:18,683 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:18,798 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-02 11:40:18,799 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-02 11:40:18,806 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:18,855 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-02 11:40:18,855 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-02 11:40:18,880 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:18,903 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-02 11:40:18,904 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-02 11:40:18,972 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:19,034 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-02 11:40:19,034 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-02 11:40:19,034 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-02 11:40:19,040 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:19,233 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-02 11:40:19,234 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-02 11:40:19,235 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:19,275 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-02 11:40:19,276 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-02 11:40:19,319 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:19,348 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-02 11:40:19,349 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-02 11:40:19,355 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:19,567 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-02 11:40:19,567 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-02 11:40:19,580 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:40:19,585 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:40:19,585 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:40:19,609 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:40:19,609 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:40:19,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:40:19 BoogieIcfgContainer [2019-10-02 11:40:19,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:40:19,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:40:19,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:40:19,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:40:19,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:40:17" (1/3) ... [2019-10-02 11:40:19,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143fa0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:40:19, skipping insertion in model container [2019-10-02 11:40:19,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:40:17" (2/3) ... [2019-10-02 11:40:19,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143fa0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:40:19, skipping insertion in model container [2019-10-02 11:40:19,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:40:19" (3/3) ... [2019-10-02 11:40:19,620 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-10-02 11:40:19,627 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:40:19,635 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:40:19,651 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:40:19,686 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:40:19,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:40:19,687 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:40:19,688 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:40:19,688 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:40:19,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:40:19,688 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:40:19,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:40:19,688 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:40:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2019-10-02 11:40:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:40:19,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:19,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:19,730 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2019-10-02 11:40:19,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:19,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:19,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:20,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:20,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:20,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:20,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:20,054 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2019-10-02 11:40:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:20,262 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2019-10-02 11:40:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:20,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:40:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:20,284 INFO L225 Difference]: With dead ends: 887 [2019-10-02 11:40:20,284 INFO L226 Difference]: Without dead ends: 507 [2019-10-02 11:40:20,293 INFO L640 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 [2019-10-02 11:40:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-02 11:40:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-10-02 11:40:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-10-02 11:40:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2019-10-02 11:40:20,402 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2019-10-02 11:40:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:20,402 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2019-10-02 11:40:20,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2019-10-02 11:40:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:40:20,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:20,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:20,405 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:20,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2019-10-02 11:40:20,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:20,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:20,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:20,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:20,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:20,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:20,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:20,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:20,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:20,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:20,655 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2019-10-02 11:40:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:20,930 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2019-10-02 11:40:20,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:20,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:40:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:20,944 INFO L225 Difference]: With dead ends: 789 [2019-10-02 11:40:20,945 INFO L226 Difference]: Without dead ends: 670 [2019-10-02 11:40:20,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-02 11:40:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2019-10-02 11:40:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-10-02 11:40:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2019-10-02 11:40:21,019 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2019-10-02 11:40:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:21,019 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2019-10-02 11:40:21,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2019-10-02 11:40:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 11:40:21,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:21,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:21,028 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:21,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1338407833, now seen corresponding path program 1 times [2019-10-02 11:40:21,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:21,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:21,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:21,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:21,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:21,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:21,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:21,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:21,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:21,174 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2019-10-02 11:40:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:21,232 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2019-10-02 11:40:21,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:21,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 11:40:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:21,239 INFO L225 Difference]: With dead ends: 995 [2019-10-02 11:40:21,239 INFO L226 Difference]: Without dead ends: 819 [2019-10-02 11:40:21,240 INFO L640 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 [2019-10-02 11:40:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-10-02 11:40:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2019-10-02 11:40:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-10-02 11:40:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2019-10-02 11:40:21,285 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2019-10-02 11:40:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:21,285 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2019-10-02 11:40:21,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2019-10-02 11:40:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:40:21,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:21,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:21,288 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 817062638, now seen corresponding path program 1 times [2019-10-02 11:40:21,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:21,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:21,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:21,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:21,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:21,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:21,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:21,337 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2019-10-02 11:40:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:21,518 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2019-10-02 11:40:21,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:21,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 11:40:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:21,526 INFO L225 Difference]: With dead ends: 1424 [2019-10-02 11:40:21,526 INFO L226 Difference]: Without dead ends: 1160 [2019-10-02 11:40:21,528 INFO L640 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 [2019-10-02 11:40:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-02 11:40:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2019-10-02 11:40:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-10-02 11:40:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2019-10-02 11:40:21,585 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2019-10-02 11:40:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:21,585 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2019-10-02 11:40:21,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2019-10-02 11:40:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:40:21,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:21,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:21,588 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:21,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:21,588 INFO L82 PathProgramCache]: Analyzing trace with hash -679253739, now seen corresponding path program 1 times [2019-10-02 11:40:21,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:21,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:21,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:21,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:21,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:21,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:40:21,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:40:21,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:40:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:40:21,680 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2019-10-02 11:40:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:22,614 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2019-10-02 11:40:22,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:40:22,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-02 11:40:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:22,622 INFO L225 Difference]: With dead ends: 1562 [2019-10-02 11:40:22,622 INFO L226 Difference]: Without dead ends: 984 [2019-10-02 11:40:22,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:40:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-10-02 11:40:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2019-10-02 11:40:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-10-02 11:40:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2019-10-02 11:40:22,686 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2019-10-02 11:40:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:22,686 INFO L475 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2019-10-02 11:40:22,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:40:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2019-10-02 11:40:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:40:22,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:22,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:22,689 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 891535335, now seen corresponding path program 1 times [2019-10-02 11:40:22,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:22,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:22,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:22,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:22,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:22,836 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2019-10-02 11:40:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:22,933 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2019-10-02 11:40:22,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:22,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-02 11:40:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:22,940 INFO L225 Difference]: With dead ends: 890 [2019-10-02 11:40:22,940 INFO L226 Difference]: Without dead ends: 886 [2019-10-02 11:40:22,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-10-02 11:40:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-10-02 11:40:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-10-02 11:40:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2019-10-02 11:40:22,996 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2019-10-02 11:40:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:22,997 INFO L475 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2019-10-02 11:40:22,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2019-10-02 11:40:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 11:40:22,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:22,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:23,000 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash 975145180, now seen corresponding path program 1 times [2019-10-02 11:40:23,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:23,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:23,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:23,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:23,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:23,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:23,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:23,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:23,067 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2019-10-02 11:40:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:23,126 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2019-10-02 11:40:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:23,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 11:40:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:23,136 INFO L225 Difference]: With dead ends: 1274 [2019-10-02 11:40:23,136 INFO L226 Difference]: Without dead ends: 1015 [2019-10-02 11:40:23,137 INFO L640 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 [2019-10-02 11:40:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-10-02 11:40:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2019-10-02 11:40:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-02 11:40:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2019-10-02 11:40:23,194 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2019-10-02 11:40:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:23,195 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2019-10-02 11:40:23,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2019-10-02 11:40:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 11:40:23,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:23,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:23,198 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:23,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:23,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2019-10-02 11:40:23,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:23,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:23,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:23,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:23,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:23,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:23,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:23,272 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2019-10-02 11:40:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:23,328 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2019-10-02 11:40:23,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:23,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-02 11:40:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:23,342 INFO L225 Difference]: With dead ends: 972 [2019-10-02 11:40:23,344 INFO L226 Difference]: Without dead ends: 954 [2019-10-02 11:40:23,345 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-10-02 11:40:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2019-10-02 11:40:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-10-02 11:40:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2019-10-02 11:40:23,402 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2019-10-02 11:40:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:23,403 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2019-10-02 11:40:23,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2019-10-02 11:40:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:40:23,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:23,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:23,407 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1915119306, now seen corresponding path program 1 times [2019-10-02 11:40:23,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:23,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:23,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:23,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:23,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:23,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:23,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:23,481 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2019-10-02 11:40:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:23,532 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2019-10-02 11:40:23,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:23,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 11:40:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:23,539 INFO L225 Difference]: With dead ends: 1167 [2019-10-02 11:40:23,539 INFO L226 Difference]: Without dead ends: 925 [2019-10-02 11:40:23,540 INFO L640 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 [2019-10-02 11:40:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-10-02 11:40:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2019-10-02 11:40:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-10-02 11:40:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2019-10-02 11:40:23,592 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2019-10-02 11:40:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:23,593 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2019-10-02 11:40:23,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2019-10-02 11:40:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:40:23,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:23,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:23,599 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488102, now seen corresponding path program 1 times [2019-10-02 11:40:23,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:23,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:23,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:23,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:23,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:23,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:23,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:40:23,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:40:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:40:23,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:40:23,661 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2019-10-02 11:40:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:24,094 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2019-10-02 11:40:24,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:40:24,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-02 11:40:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:24,100 INFO L225 Difference]: With dead ends: 1014 [2019-10-02 11:40:24,100 INFO L226 Difference]: Without dead ends: 785 [2019-10-02 11:40:24,101 INFO L640 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 [2019-10-02 11:40:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-10-02 11:40:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2019-10-02 11:40:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-10-02 11:40:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2019-10-02 11:40:24,150 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2019-10-02 11:40:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:24,151 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2019-10-02 11:40:24,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:40:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2019-10-02 11:40:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:40:24,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:24,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:24,155 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2019-10-02 11:40:24,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:24,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:24,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:24,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:24,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:24,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:24,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:24,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:24,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:24,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:24,226 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2019-10-02 11:40:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:24,272 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2019-10-02 11:40:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:24,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-02 11:40:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:24,277 INFO L225 Difference]: With dead ends: 871 [2019-10-02 11:40:24,277 INFO L226 Difference]: Without dead ends: 775 [2019-10-02 11:40:24,279 INFO L640 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 [2019-10-02 11:40:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-02 11:40:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2019-10-02 11:40:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-10-02 11:40:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2019-10-02 11:40:24,322 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2019-10-02 11:40:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:24,323 INFO L475 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2019-10-02 11:40:24,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2019-10-02 11:40:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 11:40:24,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:24,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:24,325 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:24,326 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2019-10-02 11:40:24,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:24,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:24,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:24,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:24,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:24,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:24,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:24,372 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2019-10-02 11:40:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:24,492 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2019-10-02 11:40:24,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:24,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-02 11:40:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:24,499 INFO L225 Difference]: With dead ends: 938 [2019-10-02 11:40:24,499 INFO L226 Difference]: Without dead ends: 928 [2019-10-02 11:40:24,500 INFO L640 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 [2019-10-02 11:40:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-10-02 11:40:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2019-10-02 11:40:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-10-02 11:40:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2019-10-02 11:40:24,547 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2019-10-02 11:40:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:24,548 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2019-10-02 11:40:24,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2019-10-02 11:40:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:40:24,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:24,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:24,551 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2019-10-02 11:40:24,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:24,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:24,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:24,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:24,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:40:24,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:40:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:40:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:40:24,626 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2019-10-02 11:40:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:24,780 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2019-10-02 11:40:24,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:40:24,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-02 11:40:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:24,786 INFO L225 Difference]: With dead ends: 851 [2019-10-02 11:40:24,786 INFO L226 Difference]: Without dead ends: 847 [2019-10-02 11:40:24,787 INFO L640 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 [2019-10-02 11:40:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-10-02 11:40:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2019-10-02 11:40:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-10-02 11:40:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2019-10-02 11:40:24,826 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2019-10-02 11:40:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:24,826 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2019-10-02 11:40:24,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:40:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2019-10-02 11:40:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:40:24,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:24,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:24,830 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:24,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:24,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2019-10-02 11:40:24,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:24,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:24,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:24,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:24,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:24,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:24,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:40:24,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:40:24,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:40:24,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:40:24,898 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2019-10-02 11:40:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:25,024 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2019-10-02 11:40:25,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:40:25,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-02 11:40:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:25,029 INFO L225 Difference]: With dead ends: 886 [2019-10-02 11:40:25,029 INFO L226 Difference]: Without dead ends: 865 [2019-10-02 11:40:25,030 INFO L640 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 [2019-10-02 11:40:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-10-02 11:40:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2019-10-02 11:40:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-10-02 11:40:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2019-10-02 11:40:25,070 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2019-10-02 11:40:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:25,070 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2019-10-02 11:40:25,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:40:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2019-10-02 11:40:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:40:25,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:25,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:25,073 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2019-10-02 11:40:25,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:25,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:25,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:25,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:25,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:25,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:25,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:25,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:25,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:25,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:25,111 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2019-10-02 11:40:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:25,220 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2019-10-02 11:40:25,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:25,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-02 11:40:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:25,226 INFO L225 Difference]: With dead ends: 1081 [2019-10-02 11:40:25,226 INFO L226 Difference]: Without dead ends: 1049 [2019-10-02 11:40:25,227 INFO L640 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 [2019-10-02 11:40:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-10-02 11:40:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2019-10-02 11:40:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-10-02 11:40:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2019-10-02 11:40:25,273 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2019-10-02 11:40:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:25,274 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2019-10-02 11:40:25,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2019-10-02 11:40:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:40:25,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:25,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:25,277 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2019-10-02 11:40:25,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:25,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:25,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:25,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:25,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:25,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:25,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:40:25,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:40:25,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:40:25,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:40:25,327 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2019-10-02 11:40:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:25,397 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2019-10-02 11:40:25,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:40:25,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-10-02 11:40:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:25,404 INFO L225 Difference]: With dead ends: 966 [2019-10-02 11:40:25,405 INFO L226 Difference]: Without dead ends: 944 [2019-10-02 11:40:25,406 INFO L640 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 [2019-10-02 11:40:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-10-02 11:40:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2019-10-02 11:40:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-10-02 11:40:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2019-10-02 11:40:25,470 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2019-10-02 11:40:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:25,471 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2019-10-02 11:40:25,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:40:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2019-10-02 11:40:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:40:25,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:25,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:25,474 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:25,475 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2019-10-02 11:40:25,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:25,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:25,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:25,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:25,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:25,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:25,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:40:25,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:40:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:40:25,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:40:25,570 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2019-10-02 11:40:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:26,881 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2019-10-02 11:40:26,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:40:26,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-02 11:40:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:26,890 INFO L225 Difference]: With dead ends: 1110 [2019-10-02 11:40:26,890 INFO L226 Difference]: Without dead ends: 1016 [2019-10-02 11:40:26,892 INFO L640 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 [2019-10-02 11:40:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-02 11:40:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2019-10-02 11:40:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-10-02 11:40:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2019-10-02 11:40:26,986 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2019-10-02 11:40:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:26,987 INFO L475 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2019-10-02 11:40:26,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:40:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2019-10-02 11:40:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:40:26,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:26,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:26,991 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:26,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:26,992 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2019-10-02 11:40:26,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:26,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:26,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:27,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:27,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 11:40:27,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:40:27,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:40:27,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:40:27,267 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 15 states. [2019-10-02 11:40:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:30,421 INFO L93 Difference]: Finished difference Result 1054 states and 1469 transitions. [2019-10-02 11:40:30,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:40:30,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-10-02 11:40:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:30,428 INFO L225 Difference]: With dead ends: 1054 [2019-10-02 11:40:30,429 INFO L226 Difference]: Without dead ends: 1033 [2019-10-02 11:40:30,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:40:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-10-02 11:40:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 876. [2019-10-02 11:40:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-02 11:40:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1182 transitions. [2019-10-02 11:40:30,477 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1182 transitions. Word has length 50 [2019-10-02 11:40:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:30,477 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1182 transitions. [2019-10-02 11:40:30,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:40:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1182 transitions. [2019-10-02 11:40:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:40:30,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:30,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:30,481 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:30,481 INFO L82 PathProgramCache]: Analyzing trace with hash -594952383, now seen corresponding path program 1 times [2019-10-02 11:40:30,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:30,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:30,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:30,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:30,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:30,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:30,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:40:30,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:40:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:40:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:40:30,589 INFO L87 Difference]: Start difference. First operand 876 states and 1182 transitions. Second operand 10 states. [2019-10-02 11:40:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:32,992 INFO L93 Difference]: Finished difference Result 1142 states and 1589 transitions. [2019-10-02 11:40:32,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:40:32,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-02 11:40:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:33,003 INFO L225 Difference]: With dead ends: 1142 [2019-10-02 11:40:33,003 INFO L226 Difference]: Without dead ends: 1121 [2019-10-02 11:40:33,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:40:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-10-02 11:40:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 880. [2019-10-02 11:40:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-10-02 11:40:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1184 transitions. [2019-10-02 11:40:33,059 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1184 transitions. Word has length 50 [2019-10-02 11:40:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:33,060 INFO L475 AbstractCegarLoop]: Abstraction has 880 states and 1184 transitions. [2019-10-02 11:40:33,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:40:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1184 transitions. [2019-10-02 11:40:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:40:33,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:33,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:33,068 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2019-10-02 11:40:33,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:33,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:33,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:33,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:33,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:33,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:33,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:33,125 INFO L87 Difference]: Start difference. First operand 880 states and 1184 transitions. Second operand 3 states. [2019-10-02 11:40:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:33,214 INFO L93 Difference]: Finished difference Result 905 states and 1212 transitions. [2019-10-02 11:40:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:33,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-02 11:40:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:33,219 INFO L225 Difference]: With dead ends: 905 [2019-10-02 11:40:33,219 INFO L226 Difference]: Without dead ends: 900 [2019-10-02 11:40:33,220 INFO L640 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 [2019-10-02 11:40:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-10-02 11:40:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 896. [2019-10-02 11:40:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-10-02 11:40:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1203 transitions. [2019-10-02 11:40:33,287 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1203 transitions. Word has length 52 [2019-10-02 11:40:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:33,287 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1203 transitions. [2019-10-02 11:40:33,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1203 transitions. [2019-10-02 11:40:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:40:33,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:33,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:33,294 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2019-10-02 11:40:33,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:33,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:33,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:33,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:33,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:33,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:33,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:33,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:33,340 INFO L87 Difference]: Start difference. First operand 896 states and 1203 transitions. Second operand 3 states. [2019-10-02 11:40:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:33,417 INFO L93 Difference]: Finished difference Result 1109 states and 1487 transitions. [2019-10-02 11:40:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:33,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-02 11:40:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:33,422 INFO L225 Difference]: With dead ends: 1109 [2019-10-02 11:40:33,422 INFO L226 Difference]: Without dead ends: 868 [2019-10-02 11:40:33,423 INFO L640 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 [2019-10-02 11:40:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-02 11:40:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2019-10-02 11:40:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-10-02 11:40:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1166 transitions. [2019-10-02 11:40:33,468 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1166 transitions. Word has length 54 [2019-10-02 11:40:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:33,468 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1166 transitions. [2019-10-02 11:40:33,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1166 transitions. [2019-10-02 11:40:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:40:33,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:33,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:33,473 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2019-10-02 11:40:33,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:33,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:33,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:33,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:33,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:33,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:33,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:40:33,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:40:33,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:40:33,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:40:33,628 INFO L87 Difference]: Start difference. First operand 868 states and 1166 transitions. Second operand 13 states. [2019-10-02 11:40:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:35,422 INFO L93 Difference]: Finished difference Result 903 states and 1205 transitions. [2019-10-02 11:40:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:40:35,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-10-02 11:40:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:35,429 INFO L225 Difference]: With dead ends: 903 [2019-10-02 11:40:35,429 INFO L226 Difference]: Without dead ends: 897 [2019-10-02 11:40:35,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:40:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-02 11:40:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 868. [2019-10-02 11:40:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-10-02 11:40:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1165 transitions. [2019-10-02 11:40:35,486 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1165 transitions. Word has length 53 [2019-10-02 11:40:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:35,487 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1165 transitions. [2019-10-02 11:40:35,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:40:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1165 transitions. [2019-10-02 11:40:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:40:35,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:35,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:35,490 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:35,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1608320713, now seen corresponding path program 1 times [2019-10-02 11:40:35,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:35,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:35,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:35,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:35,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:40:35,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:40:35,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:40:35,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:40:35,628 INFO L87 Difference]: Start difference. First operand 868 states and 1165 transitions. Second operand 10 states. [2019-10-02 11:40:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:37,963 INFO L93 Difference]: Finished difference Result 1116 states and 1551 transitions. [2019-10-02 11:40:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:40:37,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-02 11:40:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:37,970 INFO L225 Difference]: With dead ends: 1116 [2019-10-02 11:40:37,970 INFO L226 Difference]: Without dead ends: 1110 [2019-10-02 11:40:37,971 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:40:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-10-02 11:40:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 868. [2019-10-02 11:40:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-10-02 11:40:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1164 transitions. [2019-10-02 11:40:38,030 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1164 transitions. Word has length 53 [2019-10-02 11:40:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:38,031 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1164 transitions. [2019-10-02 11:40:38,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:40:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1164 transitions. [2019-10-02 11:40:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:40:38,033 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:38,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:38,034 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:38,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:38,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2019-10-02 11:40:38,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:38,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:38,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:38,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:38,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:38,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:38,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:38,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:38,159 INFO L87 Difference]: Start difference. First operand 868 states and 1164 transitions. Second operand 11 states. [2019-10-02 11:40:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:39,418 INFO L93 Difference]: Finished difference Result 891 states and 1188 transitions. [2019-10-02 11:40:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:39,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-10-02 11:40:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:39,424 INFO L225 Difference]: With dead ends: 891 [2019-10-02 11:40:39,424 INFO L226 Difference]: Without dead ends: 867 [2019-10-02 11:40:39,425 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:40:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-02 11:40:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2019-10-02 11:40:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-10-02 11:40:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1162 transitions. [2019-10-02 11:40:39,471 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1162 transitions. Word has length 52 [2019-10-02 11:40:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:39,471 INFO L475 AbstractCegarLoop]: Abstraction has 867 states and 1162 transitions. [2019-10-02 11:40:39,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1162 transitions. [2019-10-02 11:40:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:40:39,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:39,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:39,474 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1177776774, now seen corresponding path program 1 times [2019-10-02 11:40:39,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:39,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:39,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:39,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:39,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:40:39,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:40:39,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:40:39,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:40:39,518 INFO L87 Difference]: Start difference. First operand 867 states and 1162 transitions. Second operand 5 states. [2019-10-02 11:40:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:40,015 INFO L93 Difference]: Finished difference Result 879 states and 1173 transitions. [2019-10-02 11:40:40,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:40:40,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-02 11:40:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:40,020 INFO L225 Difference]: With dead ends: 879 [2019-10-02 11:40:40,020 INFO L226 Difference]: Without dead ends: 844 [2019-10-02 11:40:40,021 INFO L640 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 [2019-10-02 11:40:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-10-02 11:40:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 838. [2019-10-02 11:40:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-02 11:40:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1130 transitions. [2019-10-02 11:40:40,065 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1130 transitions. Word has length 52 [2019-10-02 11:40:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:40,066 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1130 transitions. [2019-10-02 11:40:40,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:40:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1130 transitions. [2019-10-02 11:40:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:40:40,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:40,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:40,069 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:40,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:40,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2019-10-02 11:40:40,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:40,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:40,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:40,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:40,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:40:40,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:40:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:40:40,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:40:40,217 INFO L87 Difference]: Start difference. First operand 838 states and 1130 transitions. Second operand 13 states. [2019-10-02 11:40:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:42,011 INFO L93 Difference]: Finished difference Result 871 states and 1166 transitions. [2019-10-02 11:40:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:40:42,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-10-02 11:40:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:42,016 INFO L225 Difference]: With dead ends: 871 [2019-10-02 11:40:42,016 INFO L226 Difference]: Without dead ends: 865 [2019-10-02 11:40:42,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:40:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-10-02 11:40:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 838. [2019-10-02 11:40:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-02 11:40:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-10-02 11:40:42,063 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 54 [2019-10-02 11:40:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:42,063 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-10-02 11:40:42,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:40:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-10-02 11:40:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:40:42,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:42,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:42,067 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:42,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:42,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1041344956, now seen corresponding path program 1 times [2019-10-02 11:40:42,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:42,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:42,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:42,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:42,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:42,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:42,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:40:42,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:40:42,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:40:42,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:40:42,144 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 9 states. [2019-10-02 11:40:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:44,012 INFO L93 Difference]: Finished difference Result 1133 states and 1567 transitions. [2019-10-02 11:40:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:40:44,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-02 11:40:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:44,018 INFO L225 Difference]: With dead ends: 1133 [2019-10-02 11:40:44,018 INFO L226 Difference]: Without dead ends: 1083 [2019-10-02 11:40:44,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:40:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-10-02 11:40:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 847. [2019-10-02 11:40:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-10-02 11:40:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2019-10-02 11:40:44,073 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2019-10-02 11:40:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:44,073 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2019-10-02 11:40:44,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:40:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2019-10-02 11:40:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:40:44,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:44,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:44,076 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2019-10-02 11:40:44,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:44,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:44,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:44,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:44,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:40:44,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:40:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:40:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:40:44,162 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 9 states. [2019-10-02 11:40:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:44,371 INFO L93 Difference]: Finished difference Result 874 states and 1183 transitions. [2019-10-02 11:40:44,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:40:44,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-02 11:40:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:44,375 INFO L225 Difference]: With dead ends: 874 [2019-10-02 11:40:44,375 INFO L226 Difference]: Without dead ends: 838 [2019-10-02 11:40:44,376 INFO L640 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 [2019-10-02 11:40:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-10-02 11:40:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-10-02 11:40:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-02 11:40:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-10-02 11:40:44,423 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2019-10-02 11:40:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:44,423 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-10-02 11:40:44,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:40:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-10-02 11:40:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:40:44,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:44,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:44,427 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash 41202246, now seen corresponding path program 1 times [2019-10-02 11:40:44,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:44,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:44,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:44,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:44,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:44,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:44,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:40:44,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:40:44,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:40:44,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:40:44,580 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2019-10-02 11:40:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:44,865 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2019-10-02 11:40:44,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:40:44,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-02 11:40:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:44,869 INFO L225 Difference]: With dead ends: 854 [2019-10-02 11:40:44,870 INFO L226 Difference]: Without dead ends: 836 [2019-10-02 11:40:44,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-10-02 11:40:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-10-02 11:40:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-02 11:40:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2019-10-02 11:40:44,926 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 56 [2019-10-02 11:40:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:44,926 INFO L475 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2019-10-02 11:40:44,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:40:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2019-10-02 11:40:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:40:44,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:44,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:44,932 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:44,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1300823154, now seen corresponding path program 1 times [2019-10-02 11:40:44,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:44,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:44,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:45,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:40:45,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:40:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:40:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:40:45,151 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2019-10-02 11:40:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:45,443 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2019-10-02 11:40:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:40:45,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-02 11:40:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:45,448 INFO L225 Difference]: With dead ends: 849 [2019-10-02 11:40:45,448 INFO L226 Difference]: Without dead ends: 831 [2019-10-02 11:40:45,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-10-02 11:40:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-10-02 11:40:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-10-02 11:40:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2019-10-02 11:40:45,494 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 55 [2019-10-02 11:40:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:45,494 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2019-10-02 11:40:45,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:40:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2019-10-02 11:40:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 11:40:45,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:45,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:45,497 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2026975246, now seen corresponding path program 1 times [2019-10-02 11:40:45,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:45,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:45,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:45,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:45,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:40:45,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:40:45,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:40:45,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:40:45,564 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 5 states. [2019-10-02 11:40:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:46,429 INFO L93 Difference]: Finished difference Result 1378 states and 1925 transitions. [2019-10-02 11:40:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:40:46,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-02 11:40:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:46,438 INFO L225 Difference]: With dead ends: 1378 [2019-10-02 11:40:46,438 INFO L226 Difference]: Without dead ends: 1214 [2019-10-02 11:40:46,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:40:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-10-02 11:40:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 869. [2019-10-02 11:40:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-10-02 11:40:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1173 transitions. [2019-10-02 11:40:46,494 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1173 transitions. Word has length 61 [2019-10-02 11:40:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:46,495 INFO L475 AbstractCegarLoop]: Abstraction has 869 states and 1173 transitions. [2019-10-02 11:40:46,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:40:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1173 transitions. [2019-10-02 11:40:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 11:40:46,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:46,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:46,498 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:46,499 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2019-10-02 11:40:46,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:46,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:46,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:46,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:46,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:46,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:46,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:46,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:46,686 INFO L87 Difference]: Start difference. First operand 869 states and 1173 transitions. Second operand 11 states. [2019-10-02 11:40:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:47,002 INFO L93 Difference]: Finished difference Result 886 states and 1191 transitions. [2019-10-02 11:40:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:47,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-10-02 11:40:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:47,006 INFO L225 Difference]: With dead ends: 886 [2019-10-02 11:40:47,006 INFO L226 Difference]: Without dead ends: 866 [2019-10-02 11:40:47,013 INFO L640 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 [2019-10-02 11:40:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-10-02 11:40:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2019-10-02 11:40:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-10-02 11:40:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1168 transitions. [2019-10-02 11:40:47,068 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1168 transitions. Word has length 58 [2019-10-02 11:40:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:47,068 INFO L475 AbstractCegarLoop]: Abstraction has 866 states and 1168 transitions. [2019-10-02 11:40:47,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1168 transitions. [2019-10-02 11:40:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 11:40:47,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:47,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:47,072 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:47,072 INFO L82 PathProgramCache]: Analyzing trace with hash 771734352, now seen corresponding path program 1 times [2019-10-02 11:40:47,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:47,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:47,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:47,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:47,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:47,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:40:47,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:40:47,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:40:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:40:47,207 INFO L87 Difference]: Start difference. First operand 866 states and 1168 transitions. Second operand 12 states. [2019-10-02 11:40:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:47,470 INFO L93 Difference]: Finished difference Result 892 states and 1196 transitions. [2019-10-02 11:40:47,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:40:47,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-02 11:40:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:47,475 INFO L225 Difference]: With dead ends: 892 [2019-10-02 11:40:47,475 INFO L226 Difference]: Without dead ends: 867 [2019-10-02 11:40:47,476 INFO L640 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 [2019-10-02 11:40:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-02 11:40:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2019-10-02 11:40:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-10-02 11:40:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1157 transitions. [2019-10-02 11:40:47,524 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1157 transitions. Word has length 59 [2019-10-02 11:40:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:47,525 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1157 transitions. [2019-10-02 11:40:47,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:40:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1157 transitions. [2019-10-02 11:40:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 11:40:47,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:47,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:47,528 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:47,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2019-10-02 11:40:47,528 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:47,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:47,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:47,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:47,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:47,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:47,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:40:47,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:40:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:40:47,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:40:47,620 INFO L87 Difference]: Start difference. First operand 865 states and 1157 transitions. Second operand 9 states. [2019-10-02 11:40:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:47,792 INFO L93 Difference]: Finished difference Result 887 states and 1180 transitions. [2019-10-02 11:40:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:40:47,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-02 11:40:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:47,796 INFO L225 Difference]: With dead ends: 887 [2019-10-02 11:40:47,796 INFO L226 Difference]: Without dead ends: 853 [2019-10-02 11:40:47,797 INFO L640 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 [2019-10-02 11:40:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-10-02 11:40:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2019-10-02 11:40:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-10-02 11:40:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1136 transitions. [2019-10-02 11:40:47,846 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1136 transitions. Word has length 59 [2019-10-02 11:40:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:47,846 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1136 transitions. [2019-10-02 11:40:47,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:40:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1136 transitions. [2019-10-02 11:40:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 11:40:47,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:47,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:47,849 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2019-10-02 11:40:47,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:47,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:47,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:47,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:47,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:47,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:47,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:40:47,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:40:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:40:47,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:40:47,892 INFO L87 Difference]: Start difference. First operand 853 states and 1136 transitions. Second operand 4 states. [2019-10-02 11:40:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:48,104 INFO L93 Difference]: Finished difference Result 1009 states and 1359 transitions. [2019-10-02 11:40:48,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:40:48,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-02 11:40:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:48,110 INFO L225 Difference]: With dead ends: 1009 [2019-10-02 11:40:48,110 INFO L226 Difference]: Without dead ends: 898 [2019-10-02 11:40:48,111 INFO L640 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 [2019-10-02 11:40:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-10-02 11:40:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 860. [2019-10-02 11:40:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-02 11:40:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1152 transitions. [2019-10-02 11:40:48,191 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1152 transitions. Word has length 60 [2019-10-02 11:40:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:48,191 INFO L475 AbstractCegarLoop]: Abstraction has 860 states and 1152 transitions. [2019-10-02 11:40:48,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:40:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1152 transitions. [2019-10-02 11:40:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 11:40:48,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:48,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:48,195 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:48,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2019-10-02 11:40:48,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:48,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:48,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:48,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:48,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:48,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:48,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:48,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:48,345 INFO L87 Difference]: Start difference. First operand 860 states and 1152 transitions. Second operand 11 states. [2019-10-02 11:40:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:48,520 INFO L93 Difference]: Finished difference Result 929 states and 1245 transitions. [2019-10-02 11:40:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:48,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-02 11:40:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:48,526 INFO L225 Difference]: With dead ends: 929 [2019-10-02 11:40:48,526 INFO L226 Difference]: Without dead ends: 874 [2019-10-02 11:40:48,527 INFO L640 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 [2019-10-02 11:40:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-02 11:40:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 864. [2019-10-02 11:40:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-10-02 11:40:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1170 transitions. [2019-10-02 11:40:48,580 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1170 transitions. Word has length 60 [2019-10-02 11:40:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:48,580 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1170 transitions. [2019-10-02 11:40:48,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1170 transitions. [2019-10-02 11:40:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 11:40:48,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:48,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:48,583 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2019-10-02 11:40:48,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:48,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:48,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:48,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:48,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:40:48,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:40:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:40:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:40:48,656 INFO L87 Difference]: Start difference. First operand 864 states and 1170 transitions. Second operand 9 states. [2019-10-02 11:40:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:48,845 INFO L93 Difference]: Finished difference Result 895 states and 1207 transitions. [2019-10-02 11:40:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:40:48,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-10-02 11:40:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:48,849 INFO L225 Difference]: With dead ends: 895 [2019-10-02 11:40:48,849 INFO L226 Difference]: Without dead ends: 856 [2019-10-02 11:40:48,852 INFO L640 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 [2019-10-02 11:40:48,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-02 11:40:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2019-10-02 11:40:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-02 11:40:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2019-10-02 11:40:48,905 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 60 [2019-10-02 11:40:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:48,906 INFO L475 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2019-10-02 11:40:48,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:40:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2019-10-02 11:40:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 11:40:48,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:48,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:48,910 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:48,911 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2019-10-02 11:40:48,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:48,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:49,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:49,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:40:49,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:40:49,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:40:49,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:40:49,105 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 13 states. [2019-10-02 11:40:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:49,421 INFO L93 Difference]: Finished difference Result 873 states and 1172 transitions. [2019-10-02 11:40:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:40:49,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-10-02 11:40:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:49,426 INFO L225 Difference]: With dead ends: 873 [2019-10-02 11:40:49,426 INFO L226 Difference]: Without dead ends: 851 [2019-10-02 11:40:49,426 INFO L640 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 [2019-10-02 11:40:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-10-02 11:40:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2019-10-02 11:40:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-10-02 11:40:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1147 transitions. [2019-10-02 11:40:49,477 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1147 transitions. Word has length 62 [2019-10-02 11:40:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:49,477 INFO L475 AbstractCegarLoop]: Abstraction has 851 states and 1147 transitions. [2019-10-02 11:40:49,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:40:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1147 transitions. [2019-10-02 11:40:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 11:40:49,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:49,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:49,482 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2019-10-02 11:40:49,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:49,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:49,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:49,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:49,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:49,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:49,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:49,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:49,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:49,515 INFO L87 Difference]: Start difference. First operand 851 states and 1147 transitions. Second operand 3 states. [2019-10-02 11:40:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:49,555 INFO L93 Difference]: Finished difference Result 1124 states and 1516 transitions. [2019-10-02 11:40:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:49,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-02 11:40:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:49,558 INFO L225 Difference]: With dead ends: 1124 [2019-10-02 11:40:49,558 INFO L226 Difference]: Without dead ends: 790 [2019-10-02 11:40:49,560 INFO L640 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 [2019-10-02 11:40:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-02 11:40:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 741. [2019-10-02 11:40:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-10-02 11:40:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 964 transitions. [2019-10-02 11:40:49,603 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 964 transitions. Word has length 62 [2019-10-02 11:40:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:49,603 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 964 transitions. [2019-10-02 11:40:49,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 964 transitions. [2019-10-02 11:40:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 11:40:49,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:49,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:49,607 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash -967621732, now seen corresponding path program 1 times [2019-10-02 11:40:49,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:49,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:49,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:49,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:49,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:49,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:49,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:40:49,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:40:49,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:40:49,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:40:49,751 INFO L87 Difference]: Start difference. First operand 741 states and 964 transitions. Second operand 12 states. [2019-10-02 11:40:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:50,009 INFO L93 Difference]: Finished difference Result 765 states and 989 transitions. [2019-10-02 11:40:50,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:40:50,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-10-02 11:40:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:50,013 INFO L225 Difference]: With dead ends: 765 [2019-10-02 11:40:50,014 INFO L226 Difference]: Without dead ends: 741 [2019-10-02 11:40:50,016 INFO L640 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 [2019-10-02 11:40:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-02 11:40:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2019-10-02 11:40:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-10-02 11:40:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 960 transitions. [2019-10-02 11:40:50,078 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 960 transitions. Word has length 62 [2019-10-02 11:40:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:50,080 INFO L475 AbstractCegarLoop]: Abstraction has 739 states and 960 transitions. [2019-10-02 11:40:50,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:40:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 960 transitions. [2019-10-02 11:40:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 11:40:50,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:50,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:50,085 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2019-10-02 11:40:50,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:50,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:50,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:40:50,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:40:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:40:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:40:50,309 INFO L87 Difference]: Start difference. First operand 739 states and 960 transitions. Second operand 13 states. [2019-10-02 11:40:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:50,616 INFO L93 Difference]: Finished difference Result 759 states and 981 transitions. [2019-10-02 11:40:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:40:50,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-10-02 11:40:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:50,619 INFO L225 Difference]: With dead ends: 759 [2019-10-02 11:40:50,619 INFO L226 Difference]: Without dead ends: 737 [2019-10-02 11:40:50,619 INFO L640 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 [2019-10-02 11:40:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-02 11:40:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-10-02 11:40:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-02 11:40:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 956 transitions. [2019-10-02 11:40:50,665 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 956 transitions. Word has length 72 [2019-10-02 11:40:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:50,666 INFO L475 AbstractCegarLoop]: Abstraction has 737 states and 956 transitions. [2019-10-02 11:40:50,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:40:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 956 transitions. [2019-10-02 11:40:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 11:40:50,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:50,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:50,670 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:50,670 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2019-10-02 11:40:50,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:50,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:50,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:50,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:40:50,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:40:50,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:40:50,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:40:50,817 INFO L87 Difference]: Start difference. First operand 737 states and 956 transitions. Second operand 13 states. [2019-10-02 11:40:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:51,088 INFO L93 Difference]: Finished difference Result 754 states and 974 transitions. [2019-10-02 11:40:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:40:51,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-10-02 11:40:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:51,092 INFO L225 Difference]: With dead ends: 754 [2019-10-02 11:40:51,092 INFO L226 Difference]: Without dead ends: 732 [2019-10-02 11:40:51,093 INFO L640 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 [2019-10-02 11:40:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-10-02 11:40:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2019-10-02 11:40:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-10-02 11:40:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 949 transitions. [2019-10-02 11:40:51,149 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 949 transitions. Word has length 63 [2019-10-02 11:40:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:51,149 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 949 transitions. [2019-10-02 11:40:51,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:40:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 949 transitions. [2019-10-02 11:40:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 11:40:51,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:51,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:51,152 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1777618660, now seen corresponding path program 1 times [2019-10-02 11:40:51,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:51,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:51,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:51,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:51,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:40:51,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:40:51,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:40:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:40:51,277 INFO L87 Difference]: Start difference. First operand 732 states and 949 transitions. Second operand 12 states. [2019-10-02 11:40:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:51,519 INFO L93 Difference]: Finished difference Result 756 states and 974 transitions. [2019-10-02 11:40:51,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:40:51,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-10-02 11:40:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:51,524 INFO L225 Difference]: With dead ends: 756 [2019-10-02 11:40:51,524 INFO L226 Difference]: Without dead ends: 732 [2019-10-02 11:40:51,525 INFO L640 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 [2019-10-02 11:40:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-10-02 11:40:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2019-10-02 11:40:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-02 11:40:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 945 transitions. [2019-10-02 11:40:51,566 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 945 transitions. Word has length 67 [2019-10-02 11:40:51,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:51,566 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 945 transitions. [2019-10-02 11:40:51,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:40:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 945 transitions. [2019-10-02 11:40:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 11:40:51,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:51,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:51,569 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2077254621, now seen corresponding path program 1 times [2019-10-02 11:40:51,569 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:51,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:51,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:51,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:51,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:40:51,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:40:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:40:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:40:51,691 INFO L87 Difference]: Start difference. First operand 730 states and 945 transitions. Second operand 12 states. [2019-10-02 11:40:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:51,909 INFO L93 Difference]: Finished difference Result 754 states and 970 transitions. [2019-10-02 11:40:51,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:40:51,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-10-02 11:40:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:51,912 INFO L225 Difference]: With dead ends: 754 [2019-10-02 11:40:51,913 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 11:40:51,913 INFO L640 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 [2019-10-02 11:40:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 11:40:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 728. [2019-10-02 11:40:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-02 11:40:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 941 transitions. [2019-10-02 11:40:51,959 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 941 transitions. Word has length 66 [2019-10-02 11:40:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:51,959 INFO L475 AbstractCegarLoop]: Abstraction has 728 states and 941 transitions. [2019-10-02 11:40:51,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:40:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 941 transitions. [2019-10-02 11:40:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 11:40:51,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:51,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:51,962 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash 735394788, now seen corresponding path program 1 times [2019-10-02 11:40:51,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:51,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:51,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:51,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:52,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:52,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:40:52,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:40:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:40:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:40:52,107 INFO L87 Difference]: Start difference. First operand 728 states and 941 transitions. Second operand 12 states. [2019-10-02 11:40:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:52,328 INFO L93 Difference]: Finished difference Result 750 states and 964 transitions. [2019-10-02 11:40:52,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:40:52,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-10-02 11:40:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:52,331 INFO L225 Difference]: With dead ends: 750 [2019-10-02 11:40:52,331 INFO L226 Difference]: Without dead ends: 726 [2019-10-02 11:40:52,332 INFO L640 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 [2019-10-02 11:40:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-10-02 11:40:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-10-02 11:40:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-10-02 11:40:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 937 transitions. [2019-10-02 11:40:52,379 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 937 transitions. Word has length 63 [2019-10-02 11:40:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:52,379 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 937 transitions. [2019-10-02 11:40:52,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:40:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 937 transitions. [2019-10-02 11:40:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 11:40:52,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:52,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:52,382 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:52,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1698824433, now seen corresponding path program 1 times [2019-10-02 11:40:52,382 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:52,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:52,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:52,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:52,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:52,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:52,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:52,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:52,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:52,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:52,421 INFO L87 Difference]: Start difference. First operand 726 states and 937 transitions. Second operand 3 states. [2019-10-02 11:40:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:52,464 INFO L93 Difference]: Finished difference Result 856 states and 1110 transitions. [2019-10-02 11:40:52,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:52,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-02 11:40:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:52,477 INFO L225 Difference]: With dead ends: 856 [2019-10-02 11:40:52,477 INFO L226 Difference]: Without dead ends: 726 [2019-10-02 11:40:52,478 INFO L640 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 [2019-10-02 11:40:52,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-10-02 11:40:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-10-02 11:40:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-10-02 11:40:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 934 transitions. [2019-10-02 11:40:52,532 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 934 transitions. Word has length 66 [2019-10-02 11:40:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:52,533 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 934 transitions. [2019-10-02 11:40:52,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 934 transitions. [2019-10-02 11:40:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-02 11:40:52,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:52,536 INFO L411 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] [2019-10-02 11:40:52,537 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash -658089671, now seen corresponding path program 1 times [2019-10-02 11:40:52,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:52,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:52,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:52,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:52,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:40:52,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:40:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:40:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:52,596 INFO L87 Difference]: Start difference. First operand 726 states and 934 transitions. Second operand 3 states. [2019-10-02 11:40:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:52,664 INFO L93 Difference]: Finished difference Result 935 states and 1202 transitions. [2019-10-02 11:40:52,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:40:52,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-10-02 11:40:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:52,667 INFO L225 Difference]: With dead ends: 935 [2019-10-02 11:40:52,667 INFO L226 Difference]: Without dead ends: 798 [2019-10-02 11:40:52,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:40:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-10-02 11:40:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 767. [2019-10-02 11:40:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-10-02 11:40:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 985 transitions. [2019-10-02 11:40:52,721 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 985 transitions. Word has length 80 [2019-10-02 11:40:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:52,722 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 985 transitions. [2019-10-02 11:40:52,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:40:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 985 transitions. [2019-10-02 11:40:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 11:40:52,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:52,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:52,724 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2019-10-02 11:40:52,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:52,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:52,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:52,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:52,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 11:40:52,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:40:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:40:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:40:52,890 INFO L87 Difference]: Start difference. First operand 767 states and 985 transitions. Second operand 15 states. [2019-10-02 11:40:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:53,416 INFO L93 Difference]: Finished difference Result 817 states and 1047 transitions. [2019-10-02 11:40:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:40:53,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-10-02 11:40:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:53,418 INFO L225 Difference]: With dead ends: 817 [2019-10-02 11:40:53,419 INFO L226 Difference]: Without dead ends: 791 [2019-10-02 11:40:53,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:40:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-02 11:40:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 773. [2019-10-02 11:40:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-02 11:40:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 993 transitions. [2019-10-02 11:40:53,469 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 993 transitions. Word has length 65 [2019-10-02 11:40:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:53,469 INFO L475 AbstractCegarLoop]: Abstraction has 773 states and 993 transitions. [2019-10-02 11:40:53,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:40:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 993 transitions. [2019-10-02 11:40:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 11:40:53,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:53,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:53,472 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash -157011960, now seen corresponding path program 1 times [2019-10-02 11:40:53,472 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:53,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:53,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:53,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:53,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:53,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:53,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:53,590 INFO L87 Difference]: Start difference. First operand 773 states and 993 transitions. Second operand 11 states. [2019-10-02 11:40:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:53,750 INFO L93 Difference]: Finished difference Result 846 states and 1073 transitions. [2019-10-02 11:40:53,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:53,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-10-02 11:40:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:53,753 INFO L225 Difference]: With dead ends: 846 [2019-10-02 11:40:53,753 INFO L226 Difference]: Without dead ends: 769 [2019-10-02 11:40:53,754 INFO L640 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 [2019-10-02 11:40:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-10-02 11:40:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 763. [2019-10-02 11:40:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-10-02 11:40:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 977 transitions. [2019-10-02 11:40:53,799 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 977 transitions. Word has length 66 [2019-10-02 11:40:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:53,799 INFO L475 AbstractCegarLoop]: Abstraction has 763 states and 977 transitions. [2019-10-02 11:40:53,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 977 transitions. [2019-10-02 11:40:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 11:40:53,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:53,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:53,802 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:53,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:53,802 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2019-10-02 11:40:53,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:53,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:53,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:53,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:53,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:53,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:53,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:53,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:53,922 INFO L87 Difference]: Start difference. First operand 763 states and 977 transitions. Second operand 11 states. [2019-10-02 11:40:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:54,109 INFO L93 Difference]: Finished difference Result 821 states and 1040 transitions. [2019-10-02 11:40:54,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:54,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-10-02 11:40:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:54,112 INFO L225 Difference]: With dead ends: 821 [2019-10-02 11:40:54,112 INFO L226 Difference]: Without dead ends: 757 [2019-10-02 11:40:54,113 INFO L640 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 [2019-10-02 11:40:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-10-02 11:40:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2019-10-02 11:40:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-10-02 11:40:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 968 transitions. [2019-10-02 11:40:54,155 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 968 transitions. Word has length 67 [2019-10-02 11:40:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:54,155 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 968 transitions. [2019-10-02 11:40:54,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 968 transitions. [2019-10-02 11:40:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 11:40:54,157 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:54,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:54,159 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:54,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2019-10-02 11:40:54,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:54,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:54,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:54,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:54,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:54,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:54,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:54,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:54,279 INFO L87 Difference]: Start difference. First operand 757 states and 968 transitions. Second operand 11 states. [2019-10-02 11:40:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:54,441 INFO L93 Difference]: Finished difference Result 818 states and 1031 transitions. [2019-10-02 11:40:54,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:54,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-02 11:40:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:54,447 INFO L225 Difference]: With dead ends: 818 [2019-10-02 11:40:54,447 INFO L226 Difference]: Without dead ends: 740 [2019-10-02 11:40:54,447 INFO L640 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 [2019-10-02 11:40:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-10-02 11:40:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2019-10-02 11:40:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-10-02 11:40:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 941 transitions. [2019-10-02 11:40:54,493 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 941 transitions. Word has length 68 [2019-10-02 11:40:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:54,493 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 941 transitions. [2019-10-02 11:40:54,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 941 transitions. [2019-10-02 11:40:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 11:40:54,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:54,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:54,497 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash -715584647, now seen corresponding path program 1 times [2019-10-02 11:40:54,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:54,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:54,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:54,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:54,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:54,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:54,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:40:54,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:40:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:40:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:40:54,545 INFO L87 Difference]: Start difference. First operand 740 states and 941 transitions. Second operand 5 states. [2019-10-02 11:40:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:55,050 INFO L93 Difference]: Finished difference Result 801 states and 1020 transitions. [2019-10-02 11:40:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:40:55,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-02 11:40:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:55,053 INFO L225 Difference]: With dead ends: 801 [2019-10-02 11:40:55,054 INFO L226 Difference]: Without dead ends: 795 [2019-10-02 11:40:55,054 INFO L640 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 [2019-10-02 11:40:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-10-02 11:40:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 740. [2019-10-02 11:40:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-10-02 11:40:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 940 transitions. [2019-10-02 11:40:55,100 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 940 transitions. Word has length 68 [2019-10-02 11:40:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:55,100 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 940 transitions. [2019-10-02 11:40:55,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:40:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 940 transitions. [2019-10-02 11:40:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 11:40:55,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:55,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:55,103 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2019-10-02 11:40:55,103 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:55,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:55,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:55,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:55,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:55,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:55,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:55,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:55,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:55,206 INFO L87 Difference]: Start difference. First operand 740 states and 940 transitions. Second operand 11 states. [2019-10-02 11:40:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:55,351 INFO L93 Difference]: Finished difference Result 798 states and 1003 transitions. [2019-10-02 11:40:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:55,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-10-02 11:40:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:55,354 INFO L225 Difference]: With dead ends: 798 [2019-10-02 11:40:55,354 INFO L226 Difference]: Without dead ends: 735 [2019-10-02 11:40:55,355 INFO L640 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 [2019-10-02 11:40:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-02 11:40:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2019-10-02 11:40:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-10-02 11:40:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 932 transitions. [2019-10-02 11:40:55,394 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 932 transitions. Word has length 69 [2019-10-02 11:40:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:55,394 INFO L475 AbstractCegarLoop]: Abstraction has 735 states and 932 transitions. [2019-10-02 11:40:55,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 932 transitions. [2019-10-02 11:40:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 11:40:55,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:55,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:55,397 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2019-10-02 11:40:55,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:55,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:55,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:55,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:55,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:55,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:55,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:55,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:55,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:55,514 INFO L87 Difference]: Start difference. First operand 735 states and 932 transitions. Second operand 11 states. [2019-10-02 11:40:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:55,664 INFO L93 Difference]: Finished difference Result 762 states and 962 transitions. [2019-10-02 11:40:55,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:55,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-10-02 11:40:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:55,667 INFO L225 Difference]: With dead ends: 762 [2019-10-02 11:40:55,667 INFO L226 Difference]: Without dead ends: 732 [2019-10-02 11:40:55,668 INFO L640 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 [2019-10-02 11:40:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-10-02 11:40:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2019-10-02 11:40:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-10-02 11:40:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 927 transitions. [2019-10-02 11:40:55,711 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 927 transitions. Word has length 69 [2019-10-02 11:40:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:55,711 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 927 transitions. [2019-10-02 11:40:55,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 927 transitions. [2019-10-02 11:40:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 11:40:55,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:55,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:55,714 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2019-10-02 11:40:55,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:55,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:55,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:55,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:55,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:55,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:55,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:55,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:55,842 INFO L87 Difference]: Start difference. First operand 732 states and 927 transitions. Second operand 11 states. [2019-10-02 11:40:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:56,059 INFO L93 Difference]: Finished difference Result 742 states and 936 transitions. [2019-10-02 11:40:56,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:56,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-10-02 11:40:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:56,062 INFO L225 Difference]: With dead ends: 742 [2019-10-02 11:40:56,062 INFO L226 Difference]: Without dead ends: 736 [2019-10-02 11:40:56,063 INFO L640 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 [2019-10-02 11:40:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-10-02 11:40:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 730. [2019-10-02 11:40:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-02 11:40:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 923 transitions. [2019-10-02 11:40:56,106 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 923 transitions. Word has length 69 [2019-10-02 11:40:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:56,106 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 923 transitions. [2019-10-02 11:40:56,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 923 transitions. [2019-10-02 11:40:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 11:40:56,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:56,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:56,109 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:56,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1348884900, now seen corresponding path program 1 times [2019-10-02 11:40:56,109 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:56,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:56,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:56,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:56,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:56,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:40:56,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:40:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:40:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:40:56,157 INFO L87 Difference]: Start difference. First operand 730 states and 923 transitions. Second operand 5 states. [2019-10-02 11:40:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:56,535 INFO L93 Difference]: Finished difference Result 787 states and 998 transitions. [2019-10-02 11:40:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:40:56,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-10-02 11:40:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:56,538 INFO L225 Difference]: With dead ends: 787 [2019-10-02 11:40:56,538 INFO L226 Difference]: Without dead ends: 725 [2019-10-02 11:40:56,539 INFO L640 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 [2019-10-02 11:40:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-02 11:40:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 674. [2019-10-02 11:40:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-02 11:40:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 852 transitions. [2019-10-02 11:40:56,583 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 852 transitions. Word has length 69 [2019-10-02 11:40:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:56,583 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 852 transitions. [2019-10-02 11:40:56,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:40:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 852 transitions. [2019-10-02 11:40:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 11:40:56,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:56,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:56,585 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2125065170, now seen corresponding path program 1 times [2019-10-02 11:40:56,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:56,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:56,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:56,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:56,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:40:56,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:40:56,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:40:56,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:40:56,749 INFO L87 Difference]: Start difference. First operand 674 states and 852 transitions. Second operand 14 states. [2019-10-02 11:40:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:57,007 INFO L93 Difference]: Finished difference Result 731 states and 912 transitions. [2019-10-02 11:40:57,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:40:57,008 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-10-02 11:40:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:57,010 INFO L225 Difference]: With dead ends: 731 [2019-10-02 11:40:57,010 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 11:40:57,011 INFO L640 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 [2019-10-02 11:40:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 11:40:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-10-02 11:40:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-02 11:40:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 834 transitions. [2019-10-02 11:40:57,050 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 834 transitions. Word has length 74 [2019-10-02 11:40:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:57,050 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 834 transitions. [2019-10-02 11:40:57,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:40:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 834 transitions. [2019-10-02 11:40:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 11:40:57,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:57,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:57,053 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:57,053 INFO L82 PathProgramCache]: Analyzing trace with hash 765553274, now seen corresponding path program 1 times [2019-10-02 11:40:57,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:57,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:57,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:57,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:57,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:57,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:57,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:40:57,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:40:57,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:40:57,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:40:57,194 INFO L87 Difference]: Start difference. First operand 663 states and 834 transitions. Second operand 14 states. [2019-10-02 11:40:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:57,407 INFO L93 Difference]: Finished difference Result 687 states and 860 transitions. [2019-10-02 11:40:57,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:40:57,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-10-02 11:40:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:57,409 INFO L225 Difference]: With dead ends: 687 [2019-10-02 11:40:57,409 INFO L226 Difference]: Without dead ends: 660 [2019-10-02 11:40:57,410 INFO L640 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 [2019-10-02 11:40:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-02 11:40:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-10-02 11:40:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-02 11:40:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 829 transitions. [2019-10-02 11:40:57,450 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 829 transitions. Word has length 70 [2019-10-02 11:40:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:57,450 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 829 transitions. [2019-10-02 11:40:57,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:40:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 829 transitions. [2019-10-02 11:40:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 11:40:57,452 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:57,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:57,453 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:57,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2019-10-02 11:40:57,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:57,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:57,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:57,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:57,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:57,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:57,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:40:57,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:40:57,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:40:57,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:40:57,634 INFO L87 Difference]: Start difference. First operand 660 states and 829 transitions. Second operand 13 states. [2019-10-02 11:40:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:57,965 INFO L93 Difference]: Finished difference Result 677 states and 847 transitions. [2019-10-02 11:40:57,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:40:57,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2019-10-02 11:40:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:57,968 INFO L225 Difference]: With dead ends: 677 [2019-10-02 11:40:57,968 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 11:40:57,969 INFO L640 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 [2019-10-02 11:40:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 11:40:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-02 11:40:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 11:40:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 813 transitions. [2019-10-02 11:40:58,021 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 813 transitions. Word has length 79 [2019-10-02 11:40:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:58,021 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 813 transitions. [2019-10-02 11:40:58,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:40:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 813 transitions. [2019-10-02 11:40:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 11:40:58,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:58,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:58,024 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2019-10-02 11:40:58,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:58,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:58,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:58,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:58,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:58,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:58,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:40:58,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:40:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:40:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:40:58,239 INFO L87 Difference]: Start difference. First operand 647 states and 813 transitions. Second operand 13 states. [2019-10-02 11:40:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:58,492 INFO L93 Difference]: Finished difference Result 649 states and 814 transitions. [2019-10-02 11:40:58,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:40:58,492 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-10-02 11:40:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:58,495 INFO L225 Difference]: With dead ends: 649 [2019-10-02 11:40:58,495 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:40:58,496 INFO L640 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 [2019-10-02 11:40:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:40:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:40:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:40:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 755 transitions. [2019-10-02 11:40:58,531 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 755 transitions. Word has length 69 [2019-10-02 11:40:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:58,531 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 755 transitions. [2019-10-02 11:40:58,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:40:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 755 transitions. [2019-10-02 11:40:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 11:40:58,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:58,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:58,533 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1618206117, now seen corresponding path program 1 times [2019-10-02 11:40:58,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:58,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:58,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:58,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:58,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:40:58,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:40:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:40:58,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:40:58,684 INFO L87 Difference]: Start difference. First operand 596 states and 755 transitions. Second operand 14 states. [2019-10-02 11:40:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:58,892 INFO L93 Difference]: Finished difference Result 655 states and 818 transitions. [2019-10-02 11:40:58,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:40:58,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-10-02 11:40:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:58,894 INFO L225 Difference]: With dead ends: 655 [2019-10-02 11:40:58,895 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 11:40:58,895 INFO L640 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 [2019-10-02 11:40:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 11:40:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 11:40:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 11:40:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 744 transitions. [2019-10-02 11:40:58,933 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 744 transitions. Word has length 71 [2019-10-02 11:40:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:58,933 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 744 transitions. [2019-10-02 11:40:58,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:40:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 744 transitions. [2019-10-02 11:40:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 11:40:58,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:58,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:58,935 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1661633858, now seen corresponding path program 1 times [2019-10-02 11:40:58,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:58,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:58,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:58,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:59,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:59,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:40:59,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:40:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:40:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:40:59,085 INFO L87 Difference]: Start difference. First operand 589 states and 744 transitions. Second operand 14 states. [2019-10-02 11:40:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:59,320 INFO L93 Difference]: Finished difference Result 648 states and 807 transitions. [2019-10-02 11:40:59,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:40:59,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-10-02 11:40:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:59,322 INFO L225 Difference]: With dead ends: 648 [2019-10-02 11:40:59,322 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 11:40:59,323 INFO L640 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 [2019-10-02 11:40:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 11:40:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-02 11:40:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-02 11:40:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 735 transitions. [2019-10-02 11:40:59,359 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 735 transitions. Word has length 71 [2019-10-02 11:40:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:59,360 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 735 transitions. [2019-10-02 11:40:59,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:40:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 735 transitions. [2019-10-02 11:40:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 11:40:59,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:59,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:59,362 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2019-10-02 11:40:59,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:59,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:59,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:59,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:59,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:59,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:59,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:59,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:59,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:59,465 INFO L87 Difference]: Start difference. First operand 583 states and 735 transitions. Second operand 11 states. [2019-10-02 11:40:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:59,607 INFO L93 Difference]: Finished difference Result 610 states and 765 transitions. [2019-10-02 11:40:59,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:59,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-10-02 11:40:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:59,609 INFO L225 Difference]: With dead ends: 610 [2019-10-02 11:40:59,609 INFO L226 Difference]: Without dead ends: 565 [2019-10-02 11:40:59,610 INFO L640 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 [2019-10-02 11:40:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-02 11:40:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2019-10-02 11:40:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-02 11:40:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 707 transitions. [2019-10-02 11:40:59,645 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 707 transitions. Word has length 72 [2019-10-02 11:40:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:59,645 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 707 transitions. [2019-10-02 11:40:59,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 707 transitions. [2019-10-02 11:40:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 11:40:59,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:59,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:59,647 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2019-10-02 11:40:59,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:59,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:59,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:40:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:59,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:40:59,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:40:59,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:40:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:40:59,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:40:59,751 INFO L87 Difference]: Start difference. First operand 565 states and 707 transitions. Second operand 11 states. [2019-10-02 11:40:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:40:59,872 INFO L93 Difference]: Finished difference Result 623 states and 770 transitions. [2019-10-02 11:40:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:40:59,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-10-02 11:40:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:40:59,874 INFO L225 Difference]: With dead ends: 623 [2019-10-02 11:40:59,874 INFO L226 Difference]: Without dead ends: 553 [2019-10-02 11:40:59,875 INFO L640 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 [2019-10-02 11:40:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-02 11:40:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-02 11:40:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-02 11:40:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 690 transitions. [2019-10-02 11:40:59,912 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 690 transitions. Word has length 71 [2019-10-02 11:40:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:40:59,912 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 690 transitions. [2019-10-02 11:40:59,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:40:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 690 transitions. [2019-10-02 11:40:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 11:40:59,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:40:59,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:40:59,914 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:40:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:40:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash -389549299, now seen corresponding path program 1 times [2019-10-02 11:40:59,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:40:59,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:40:59,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:59,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:40:59,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:40:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:00,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:00,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:41:00,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:41:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:41:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:41:00,108 INFO L87 Difference]: Start difference. First operand 553 states and 690 transitions. Second operand 14 states. [2019-10-02 11:41:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:00,312 INFO L93 Difference]: Finished difference Result 612 states and 753 transitions. [2019-10-02 11:41:00,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:41:00,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-10-02 11:41:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:00,314 INFO L225 Difference]: With dead ends: 612 [2019-10-02 11:41:00,314 INFO L226 Difference]: Without dead ends: 541 [2019-10-02 11:41:00,315 INFO L640 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 [2019-10-02 11:41:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-02 11:41:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-02 11:41:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-02 11:41:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 671 transitions. [2019-10-02 11:41:00,355 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 671 transitions. Word has length 72 [2019-10-02 11:41:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:00,355 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 671 transitions. [2019-10-02 11:41:00,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:41:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 671 transitions. [2019-10-02 11:41:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:41:00,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:00,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:00,359 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2019-10-02 11:41:00,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:00,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:00,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:00,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:00,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:00,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:00,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:41:00,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:41:00,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:41:00,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:41:00,480 INFO L87 Difference]: Start difference. First operand 541 states and 671 transitions. Second operand 10 states. [2019-10-02 11:41:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:02,100 INFO L93 Difference]: Finished difference Result 1066 states and 1325 transitions. [2019-10-02 11:41:02,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:41:02,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-10-02 11:41:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:02,103 INFO L225 Difference]: With dead ends: 1066 [2019-10-02 11:41:02,103 INFO L226 Difference]: Without dead ends: 921 [2019-10-02 11:41:02,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:41:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-10-02 11:41:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 849. [2019-10-02 11:41:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-10-02 11:41:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1075 transitions. [2019-10-02 11:41:02,165 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1075 transitions. Word has length 73 [2019-10-02 11:41:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:02,165 INFO L475 AbstractCegarLoop]: Abstraction has 849 states and 1075 transitions. [2019-10-02 11:41:02,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:41:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1075 transitions. [2019-10-02 11:41:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:41:02,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:02,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:02,168 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:02,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1980389399, now seen corresponding path program 1 times [2019-10-02 11:41:02,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:02,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:02,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:02,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:02,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:02,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:41:02,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:41:02,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:41:02,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:41:02,234 INFO L87 Difference]: Start difference. First operand 849 states and 1075 transitions. Second operand 6 states. [2019-10-02 11:41:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:02,921 INFO L93 Difference]: Finished difference Result 1069 states and 1323 transitions. [2019-10-02 11:41:02,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:41:02,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-02 11:41:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:02,923 INFO L225 Difference]: With dead ends: 1069 [2019-10-02 11:41:02,923 INFO L226 Difference]: Without dead ends: 964 [2019-10-02 11:41:02,924 INFO L640 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 [2019-10-02 11:41:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-10-02 11:41:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 920. [2019-10-02 11:41:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-10-02 11:41:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1159 transitions. [2019-10-02 11:41:02,991 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1159 transitions. Word has length 73 [2019-10-02 11:41:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:02,992 INFO L475 AbstractCegarLoop]: Abstraction has 920 states and 1159 transitions. [2019-10-02 11:41:02,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:41:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1159 transitions. [2019-10-02 11:41:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 11:41:02,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:02,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:02,995 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1233648810, now seen corresponding path program 1 times [2019-10-02 11:41:02,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:02,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:02,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:03,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:03,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:41:03,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:41:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:41:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:41:03,115 INFO L87 Difference]: Start difference. First operand 920 states and 1159 transitions. Second operand 6 states. [2019-10-02 11:41:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:03,215 INFO L93 Difference]: Finished difference Result 1194 states and 1515 transitions. [2019-10-02 11:41:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:41:03,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-10-02 11:41:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:03,218 INFO L225 Difference]: With dead ends: 1194 [2019-10-02 11:41:03,218 INFO L226 Difference]: Without dead ends: 906 [2019-10-02 11:41:03,219 INFO L640 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 [2019-10-02 11:41:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-10-02 11:41:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2019-10-02 11:41:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-02 11:41:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1137 transitions. [2019-10-02 11:41:03,288 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1137 transitions. Word has length 77 [2019-10-02 11:41:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:03,288 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1137 transitions. [2019-10-02 11:41:03,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:41:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1137 transitions. [2019-10-02 11:41:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 11:41:03,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:03,291 INFO L411 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] [2019-10-02 11:41:03,291 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash -532137541, now seen corresponding path program 1 times [2019-10-02 11:41:03,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:03,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:03,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:41:03,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:03,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:41:03,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:41:03,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:41:03,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:41:03,432 INFO L87 Difference]: Start difference. First operand 906 states and 1137 transitions. Second operand 11 states. [2019-10-02 11:41:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:03,587 INFO L93 Difference]: Finished difference Result 970 states and 1206 transitions. [2019-10-02 11:41:03,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:41:03,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-10-02 11:41:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:03,590 INFO L225 Difference]: With dead ends: 970 [2019-10-02 11:41:03,590 INFO L226 Difference]: Without dead ends: 859 [2019-10-02 11:41:03,591 INFO L640 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 [2019-10-02 11:41:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-10-02 11:41:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 853. [2019-10-02 11:41:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-10-02 11:41:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1070 transitions. [2019-10-02 11:41:03,654 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1070 transitions. Word has length 75 [2019-10-02 11:41:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:03,655 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1070 transitions. [2019-10-02 11:41:03,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:41:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1070 transitions. [2019-10-02 11:41:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 11:41:03,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:03,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:03,658 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:03,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1265424292, now seen corresponding path program 1 times [2019-10-02 11:41:03,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:03,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:03,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:03,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:03,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:41:03,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:41:03,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:41:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:41:03,700 INFO L87 Difference]: Start difference. First operand 853 states and 1070 transitions. Second operand 3 states. [2019-10-02 11:41:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:03,764 INFO L93 Difference]: Finished difference Result 916 states and 1140 transitions. [2019-10-02 11:41:03,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:41:03,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-02 11:41:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:03,766 INFO L225 Difference]: With dead ends: 916 [2019-10-02 11:41:03,767 INFO L226 Difference]: Without dead ends: 863 [2019-10-02 11:41:03,767 INFO L640 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 [2019-10-02 11:41:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-02 11:41:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 855. [2019-10-02 11:41:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-10-02 11:41:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1072 transitions. [2019-10-02 11:41:03,834 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1072 transitions. Word has length 79 [2019-10-02 11:41:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:03,835 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1072 transitions. [2019-10-02 11:41:03,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:41:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1072 transitions. [2019-10-02 11:41:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 11:41:03,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:03,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:03,838 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash 785559706, now seen corresponding path program 1 times [2019-10-02 11:41:03,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:03,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:03,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:03,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:03,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:03,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:41:03,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:41:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:41:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:41:03,969 INFO L87 Difference]: Start difference. First operand 855 states and 1072 transitions. Second operand 12 states. [2019-10-02 11:41:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:04,168 INFO L93 Difference]: Finished difference Result 895 states and 1119 transitions. [2019-10-02 11:41:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:41:04,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2019-10-02 11:41:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:04,171 INFO L225 Difference]: With dead ends: 895 [2019-10-02 11:41:04,171 INFO L226 Difference]: Without dead ends: 855 [2019-10-02 11:41:04,171 INFO L640 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 [2019-10-02 11:41:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-10-02 11:41:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-10-02 11:41:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-10-02 11:41:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1070 transitions. [2019-10-02 11:41:04,235 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1070 transitions. Word has length 79 [2019-10-02 11:41:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:04,235 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1070 transitions. [2019-10-02 11:41:04,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:41:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1070 transitions. [2019-10-02 11:41:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-02 11:41:04,240 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:04,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:04,240 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1291488052, now seen corresponding path program 1 times [2019-10-02 11:41:04,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:04,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:04,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:04,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:04,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:04,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:04,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:41:04,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:41:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:41:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:41:04,402 INFO L87 Difference]: Start difference. First operand 855 states and 1070 transitions. Second operand 14 states. [2019-10-02 11:41:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:04,615 INFO L93 Difference]: Finished difference Result 949 states and 1177 transitions. [2019-10-02 11:41:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:41:04,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2019-10-02 11:41:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:04,618 INFO L225 Difference]: With dead ends: 949 [2019-10-02 11:41:04,618 INFO L226 Difference]: Without dead ends: 841 [2019-10-02 11:41:04,619 INFO L640 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 [2019-10-02 11:41:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-02 11:41:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2019-10-02 11:41:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-10-02 11:41:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1046 transitions. [2019-10-02 11:41:04,677 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1046 transitions. Word has length 80 [2019-10-02 11:41:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:04,678 INFO L475 AbstractCegarLoop]: Abstraction has 841 states and 1046 transitions. [2019-10-02 11:41:04,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:41:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1046 transitions. [2019-10-02 11:41:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 11:41:04,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:04,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:04,680 INFO L418 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:04,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash -287687659, now seen corresponding path program 1 times [2019-10-02 11:41:04,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:04,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:04,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:04,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:04,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:04,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:04,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:41:04,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:41:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:41:04,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:41:04,825 INFO L87 Difference]: Start difference. First operand 841 states and 1046 transitions. Second operand 14 states. [2019-10-02 11:41:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:05,031 INFO L93 Difference]: Finished difference Result 856 states and 1062 transitions. [2019-10-02 11:41:05,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:41:05,032 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2019-10-02 11:41:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:05,034 INFO L225 Difference]: With dead ends: 856 [2019-10-02 11:41:05,034 INFO L226 Difference]: Without dead ends: 741 [2019-10-02 11:41:05,035 INFO L640 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 [2019-10-02 11:41:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-02 11:41:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 463. [2019-10-02 11:41:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-02 11:41:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 563 transitions. [2019-10-02 11:41:05,070 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 563 transitions. Word has length 77 [2019-10-02 11:41:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:05,071 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 563 transitions. [2019-10-02 11:41:05,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:41:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 563 transitions. [2019-10-02 11:41:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 11:41:05,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:05,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:05,072 INFO L418 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1789747715, now seen corresponding path program 1 times [2019-10-02 11:41:05,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:05,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:05,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:05,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:05,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:05,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:05,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:41:05,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:41:05,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:41:05,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:41:05,124 INFO L87 Difference]: Start difference. First operand 463 states and 563 transitions. Second operand 5 states. [2019-10-02 11:41:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:05,332 INFO L93 Difference]: Finished difference Result 597 states and 735 transitions. [2019-10-02 11:41:05,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:41:05,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-02 11:41:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:05,334 INFO L225 Difference]: With dead ends: 597 [2019-10-02 11:41:05,334 INFO L226 Difference]: Without dead ends: 447 [2019-10-02 11:41:05,335 INFO L640 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 [2019-10-02 11:41:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-02 11:41:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2019-10-02 11:41:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-10-02 11:41:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 543 transitions. [2019-10-02 11:41:05,367 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 543 transitions. Word has length 81 [2019-10-02 11:41:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:05,367 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 543 transitions. [2019-10-02 11:41:05,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:41:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 543 transitions. [2019-10-02 11:41:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 11:41:05,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:05,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:05,369 INFO L418 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2019-10-02 11:41:05,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:05,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:05,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:05,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:05,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:05,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:41:05,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:41:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:41:05,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:41:05,467 INFO L87 Difference]: Start difference. First operand 447 states and 543 transitions. Second operand 10 states. [2019-10-02 11:41:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:06,829 INFO L93 Difference]: Finished difference Result 759 states and 932 transitions. [2019-10-02 11:41:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:41:06,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-02 11:41:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:06,831 INFO L225 Difference]: With dead ends: 759 [2019-10-02 11:41:06,831 INFO L226 Difference]: Without dead ends: 622 [2019-10-02 11:41:06,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:41:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-02 11:41:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 310. [2019-10-02 11:41:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-02 11:41:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2019-10-02 11:41:06,860 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 78 [2019-10-02 11:41:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:06,860 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2019-10-02 11:41:06,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:41:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2019-10-02 11:41:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 11:41:06,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:06,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:06,861 INFO L418 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:06,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:06,861 INFO L82 PathProgramCache]: Analyzing trace with hash 752230136, now seen corresponding path program 1 times [2019-10-02 11:41:06,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:06,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:06,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:06,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:06,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:06,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:06,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:41:06,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:41:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:41:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:41:06,926 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2019-10-02 11:41:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:07,154 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2019-10-02 11:41:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:41:07,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-02 11:41:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:07,156 INFO L225 Difference]: With dead ends: 445 [2019-10-02 11:41:07,156 INFO L226 Difference]: Without dead ends: 303 [2019-10-02 11:41:07,156 INFO L640 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 [2019-10-02 11:41:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-02 11:41:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2019-10-02 11:41:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-10-02 11:41:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2019-10-02 11:41:07,179 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2019-10-02 11:41:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:07,179 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2019-10-02 11:41:07,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:41:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2019-10-02 11:41:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 11:41:07,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:07,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:07,181 INFO L418 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1148690809, now seen corresponding path program 1 times [2019-10-02 11:41:07,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:07,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:07,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:07,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:07,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:07,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:07,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:41:07,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:41:07,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:41:07,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:41:07,314 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 14 states. [2019-10-02 11:41:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:08,464 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2019-10-02 11:41:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:41:08,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2019-10-02 11:41:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:08,466 INFO L225 Difference]: With dead ends: 312 [2019-10-02 11:41:08,466 INFO L226 Difference]: Without dead ends: 285 [2019-10-02 11:41:08,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:41:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-02 11:41:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 257. [2019-10-02 11:41:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-10-02 11:41:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2019-10-02 11:41:08,482 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2019-10-02 11:41:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:08,483 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2019-10-02 11:41:08,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:41:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2019-10-02 11:41:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:41:08,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:08,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:08,483 INFO L418 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:08,484 INFO L82 PathProgramCache]: Analyzing trace with hash -22783563, now seen corresponding path program 1 times [2019-10-02 11:41:08,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:08,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:08,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:08,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:08,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:08,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:08,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:41:08,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:41:08,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:41:08,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:41:08,579 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 10 states. [2019-10-02 11:41:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:09,818 INFO L93 Difference]: Finished difference Result 551 states and 641 transitions. [2019-10-02 11:41:09,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:41:09,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-10-02 11:41:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:09,820 INFO L225 Difference]: With dead ends: 551 [2019-10-02 11:41:09,820 INFO L226 Difference]: Without dead ends: 492 [2019-10-02 11:41:09,821 INFO L640 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 [2019-10-02 11:41:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-02 11:41:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 448. [2019-10-02 11:41:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-02 11:41:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 522 transitions. [2019-10-02 11:41:09,859 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 522 transitions. Word has length 101 [2019-10-02 11:41:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:09,859 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 522 transitions. [2019-10-02 11:41:09,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:41:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 522 transitions. [2019-10-02 11:41:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:41:09,860 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:09,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:09,860 INFO L418 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:09,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:09,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1854279667, now seen corresponding path program 1 times [2019-10-02 11:41:09,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:09,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:09,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:09,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:09,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:09,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:09,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:41:09,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:41:09,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:41:09,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:41:09,924 INFO L87 Difference]: Start difference. First operand 448 states and 522 transitions. Second operand 8 states. [2019-10-02 11:41:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:09,993 INFO L93 Difference]: Finished difference Result 466 states and 541 transitions. [2019-10-02 11:41:09,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:41:09,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-02 11:41:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:09,995 INFO L225 Difference]: With dead ends: 466 [2019-10-02 11:41:09,995 INFO L226 Difference]: Without dead ends: 407 [2019-10-02 11:41:09,996 INFO L640 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 [2019-10-02 11:41:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-02 11:41:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 219. [2019-10-02 11:41:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-02 11:41:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 251 transitions. [2019-10-02 11:41:10,017 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 251 transitions. Word has length 101 [2019-10-02 11:41:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:10,018 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 251 transitions. [2019-10-02 11:41:10,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:41:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 251 transitions. [2019-10-02 11:41:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 11:41:10,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:10,019 INFO L411 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] [2019-10-02 11:41:10,019 INFO L418 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1386403738, now seen corresponding path program 1 times [2019-10-02 11:41:10,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:10,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:10,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:41:10,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:41:10,070 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-02 11:41:10,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:10,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 11:41:10,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:41:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:41:10,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:41:10,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 11:41:10,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:41:10,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:41:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:41:10,380 INFO L87 Difference]: Start difference. First operand 219 states and 251 transitions. Second operand 6 states. [2019-10-02 11:41:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:10,596 INFO L93 Difference]: Finished difference Result 310 states and 370 transitions. [2019-10-02 11:41:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:41:10,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-10-02 11:41:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:10,598 INFO L225 Difference]: With dead ends: 310 [2019-10-02 11:41:10,598 INFO L226 Difference]: Without dead ends: 181 [2019-10-02 11:41:10,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:41:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-02 11:41:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2019-10-02 11:41:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-02 11:41:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2019-10-02 11:41:10,625 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 114 [2019-10-02 11:41:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:10,626 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2019-10-02 11:41:10,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:41:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2019-10-02 11:41:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 11:41:10,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:10,627 INFO L411 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] [2019-10-02 11:41:10,627 INFO L418 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:10,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:10,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1458723173, now seen corresponding path program 1 times [2019-10-02 11:41:10,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:10,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:10,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:10,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:10,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 11:41:10,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:10,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:41:10,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:41:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:41:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:41:10,788 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 11 states. [2019-10-02 11:41:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:11,406 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2019-10-02 11:41:11,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:41:11,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-10-02 11:41:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:11,408 INFO L225 Difference]: With dead ends: 151 [2019-10-02 11:41:11,408 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:41:11,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:41:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:41:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:41:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:41:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:41:11,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-10-02 11:41:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:11,410 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:41:11,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:41:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:41:11,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:41:11,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:41:12,566 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 170 [2019-10-02 11:41:12,720 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 167 [2019-10-02 11:41:13,970 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 167 [2019-10-02 11:41:14,547 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 208 [2019-10-02 11:41:15,594 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 1 [2019-10-02 11:41:15,815 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:16,035 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:16,520 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-10-02 11:41:16,710 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:17,641 WARN L191 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 110 [2019-10-02 11:41:17,934 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2019-10-02 11:41:18,067 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-10-02 11:41:18,195 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-10-02 11:41:18,456 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-10-02 11:41:18,694 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-10-02 11:41:19,872 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 224 DAG size of output: 108 [2019-10-02 11:41:20,006 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:20,289 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-10-02 11:41:21,272 WARN L191 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 98 [2019-10-02 11:41:21,885 WARN L191 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 66 [2019-10-02 11:41:22,693 WARN L191 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 95 [2019-10-02 11:41:22,848 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 70 [2019-10-02 11:41:23,261 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 65 [2019-10-02 11:41:23,521 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-02 11:41:24,247 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2019-10-02 11:41:24,580 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 65 [2019-10-02 11:41:26,039 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 197 DAG size of output: 102 [2019-10-02 11:41:26,261 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:26,420 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-10-02 11:41:26,553 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:26,689 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-10-02 11:41:27,059 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 66 [2019-10-02 11:41:27,356 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-10-02 11:41:28,239 WARN L191 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 98 [2019-10-02 11:41:29,718 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 207 DAG size of output: 103 [2019-10-02 11:41:30,286 WARN L191 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 69 [2019-10-02 11:41:30,507 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:31,086 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 89 [2019-10-02 11:41:31,419 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 56 [2019-10-02 11:41:31,886 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 72 [2019-10-02 11:41:32,540 WARN L191 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2019-10-02 11:41:32,781 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 72 [2019-10-02 11:41:32,938 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-10-02 11:41:33,197 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-10-02 11:41:33,366 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 1 [2019-10-02 11:41:33,491 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-10-02 11:41:33,935 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-10-02 11:41:34,852 WARN L191 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 98 [2019-10-02 11:41:35,515 WARN L191 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2019-10-02 11:41:35,775 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-10-02 11:41:35,994 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:36,195 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:36,319 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-10-02 11:41:36,914 WARN L191 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 72 [2019-10-02 11:41:37,220 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 72 [2019-10-02 11:41:37,633 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2019-10-02 11:41:37,781 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-10-02 11:41:37,968 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2019-10-02 11:41:38,189 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:38,353 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-10-02 11:41:38,650 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-10-02 11:41:38,903 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-10-02 11:41:39,059 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-10-02 11:41:39,297 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-10-02 11:41:39,641 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-02 11:41:39,769 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-10-02 11:41:39,998 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-10-02 11:41:40,142 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-10-02 11:41:40,256 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-10-02 11:41:40,448 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-10-02 11:41:40,873 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 85 [2019-10-02 11:41:41,519 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2019-10-02 11:41:42,623 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 161 DAG size of output: 85 [2019-10-02 11:41:42,971 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 1 [2019-10-02 11:41:43,374 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 78 [2019-10-02 11:41:43,524 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 1 [2019-10-02 11:41:43,743 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:45,058 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 224 DAG size of output: 108 [2019-10-02 11:41:45,221 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-10-02 11:41:45,505 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-10-02 11:41:45,621 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2019-10-02 11:41:45,757 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:45,978 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-10-02 11:41:46,221 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-10-02 11:41:46,393 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-02 11:41:46,615 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:47,536 WARN L191 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 98 [2019-10-02 11:41:47,778 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-10-02 11:41:49,249 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 207 DAG size of output: 103 [2019-10-02 11:41:49,430 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2019-10-02 11:41:49,727 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:50,006 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-10-02 11:41:50,152 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2019-10-02 11:41:50,277 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-10-02 11:41:50,676 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 65 [2019-10-02 11:41:50,863 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-10-02 11:41:51,019 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-10-02 11:41:51,406 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 63 [2019-10-02 11:41:51,726 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:41:52,254 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 78 [2019-10-02 11:41:52,697 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-10-02 11:41:52,906 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 62 [2019-10-02 11:41:53,148 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-10-02 11:41:53,413 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-10-02 11:41:53,547 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-10-02 11:41:53,905 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 85 [2019-10-02 11:41:54,014 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-10-02 11:41:54,148 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:54,512 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 68 [2019-10-02 11:41:55,157 WARN L191 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 85 [2019-10-02 11:41:55,305 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 1 [2019-10-02 11:41:55,545 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-10-02 11:41:56,449 WARN L191 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 101 [2019-10-02 11:41:56,584 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:57,786 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 267 DAG size of output: 87 [2019-10-02 11:41:58,718 WARN L191 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 75 [2019-10-02 11:41:59,025 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-10-02 11:41:59,162 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:59,300 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:41:59,472 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 1 [2019-10-02 11:41:59,981 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 83 [2019-10-02 11:42:00,973 WARN L191 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 82 [2019-10-02 11:42:01,116 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-10-02 11:42:01,348 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-10-02 11:42:01,565 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-10-02 11:42:01,700 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:42:02,095 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2019-10-02 11:42:02,506 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 66 [2019-10-02 11:42:02,920 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2019-10-02 11:42:03,077 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-10-02 11:42:03,360 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 60 [2019-10-02 11:42:03,675 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-02 11:42:03,963 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-10-02 11:42:04,221 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-10-02 11:42:04,347 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-10-02 11:42:04,485 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-10-02 11:42:04,796 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-10-02 11:42:05,268 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 56 [2019-10-02 11:42:05,394 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-10-02 11:42:05,643 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-10-02 11:42:06,007 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 75 [2019-10-02 11:42:06,171 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 1 [2019-10-02 11:42:06,978 WARN L191 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 100 [2019-10-02 11:42:07,221 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-10-02 11:42:07,732 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 83 [2019-10-02 11:42:08,016 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-10-02 11:42:08,265 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-10-02 11:42:08,500 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-10-02 11:42:08,504 INFO L443 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2019-10-02 11:42:08,505 INFO L439 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse0 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))) (or (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~myStatus~0 0)) (or (or .cse1 .cse2 .cse3 .cse4 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse5 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse0)))) [2019-10-02 11:42:08,506 INFO L443 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2019-10-02 11:42:08,506 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2019-10-02 11:42:08,506 INFO L443 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2019-10-02 11:42:08,506 INFO L439 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse0 (= ~s~0 |old(~s~0)|)) (.cse2 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (and (or .cse0 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse1 (or .cse2 .cse3 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse4 .cse5 .cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)))) (or .cse0 (or (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~myStatus~0 0)) (or (or .cse2 .cse3 .cse4 .cse5 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse6 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse1))))) [2019-10-02 11:42:08,506 INFO L443 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2019-10-02 11:42:08,507 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2019-10-02 11:42:08,507 INFO L443 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2019-10-02 11:42:08,507 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2019-10-02 11:42:08,507 INFO L439 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(~DC~0)|)) (not (= 0 ~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)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 |old(~s~0)|) (= ~s~0 ~SKIP2~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (= ~MPR3~0 ~s~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,507 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2019-10-02 11:42:08,507 INFO L443 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2019-10-02 11:42:08,507 INFO L439 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (<= .cse9 0)))) (let ((.cse1 (let ((.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 0 .cse9)) .cse10 .cse11 .cse12) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))))) (and (or .cse0 .cse1) (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse1))))) [2019-10-02 11:42:08,507 INFO L443 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2019-10-02 11:42:08,507 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2019-10-02 11:42:08,507 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2019-10-02 11:42:08,508 INFO L439 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0)) (= ~s~0 |old(~s~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2019-10-02 11:42:08,508 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2019-10-02 11:42:08,508 INFO L443 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2019-10-02 11:42:08,508 INFO L443 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2019-10-02 11:42:08,508 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2019-10-02 11:42:08,508 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-10-02 11:42:08,508 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2019-10-02 11:42:08,508 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2019-10-02 11:42:08,508 INFO L439 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (<= .cse9 0)))) (let ((.cse1 (let ((.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 0 .cse9)) .cse10 .cse11 .cse12) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))))) (and (or .cse0 .cse1) (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse1))))) [2019-10-02 11:42:08,508 INFO L439 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0)) (= ~s~0 |old(~s~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2019-10-02 11:42:08,509 INFO L443 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2019-10-02 11:42:08,509 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-10-02 11:42:08,509 INFO L439 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse11 (= ~myStatus~0 0))) (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not .cse11) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and .cse11 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~routine~0 1))))) [2019-10-02 11:42:08,509 INFO L439 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (let ((.cse11 (= ~myStatus~0 0))) (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not .cse11) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and .cse11 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~routine~0 1))))) [2019-10-02 11:42:08,509 INFO L443 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2019-10-02 11:42:08,510 INFO L439 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or (or (not (<= (+ ~SKIP2~0 3) ~IPC~0)) .cse0) (= ~myStatus~0 |old(~myStatus~0)|)) (or (= ~s~0 |old(~s~0)|) .cse0))) [2019-10-02 11:42:08,510 INFO L443 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2019-10-02 11:42:08,510 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or (or (not (<= (+ ~SKIP2~0 3) ~IPC~0)) .cse0) (= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) (or .cse0 (and (= ~s~0 |old(~s~0)|) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|))))) [2019-10-02 11:42:08,510 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-10-02 11:42:08,510 INFO L443 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2019-10-02 11:42:08,510 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2019-10-02 11:42:08,511 INFO L439 ceAbstractionStarter]: At program point L1786(lines 1785 1816) the Hoare annotation is: (or (and (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 (= 0 ~routine~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse7 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 .cse7) .cse8 .cse9 (<= .cse7 0) .cse10)) (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (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))) [2019-10-02 11:42:08,511 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2019-10-02 11:42:08,511 INFO L443 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2019-10-02 11:42:08,511 INFO L439 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse15 (+ ~IPC~0 ~SKIP1~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (and (= 0 ~pended~0) .cse13)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) .cse15))) (let ((.cse4 (= ~s~0 ~SKIP2~0)) (.cse2 (= main_~status~9 0)) (.cse8 (<= (+ ~NP~0 ~DC~0 7) .cse15)) (.cse9 (not (= main_~status~9 259))) (.cse11 (and (<= (+ ~DC~0 5) ~IPC~0) (and .cse5 (and .cse3 .cse6) (= ~s~0 ~DC~0)) .cse7)) (.cse0 (= ~s~0 ~IPC~0)) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= main_~status~9 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse14 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and .cse1 .cse4 .cse5 .cse3 .cse6 .cse7) (not (= 0 |old(~routine~0)|)) (and .cse1 .cse4 .cse2 .cse3) (and .cse0 .cse1 .cse8 .cse9 .cse3 .cse6) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (and .cse10 (<= (+ main_~status~9 1073741789) 0) .cse11) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse8 (<= (+ ~DC~0 7) ~s~0) .cse3 .cse6) (and .cse0 .cse10 .cse1 .cse12 .cse6 (= 0 ~routine~0) (<= 1 ~compRegistered~0) .cse13 .cse5 .cse14) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse10 .cse9 .cse14 .cse11) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse10 .cse1 .cse12 .cse5 .cse3 .cse6 .cse14) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)))))) [2019-10-02 11:42:08,511 INFO L439 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(~DC~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= 0 ~routine~0) (= ~s~0 ~SKIP2~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (= ~MPR3~0 ~s~0)) (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))) [2019-10-02 11:42:08,511 INFO L443 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2019-10-02 11:42:08,511 INFO L443 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2019-10-02 11:42:08,512 INFO L439 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))) [2019-10-02 11:42:08,512 INFO L439 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse15 (+ ~IPC~0 ~SKIP1~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (and (= 0 ~pended~0) .cse13)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) .cse15))) (let ((.cse4 (= ~s~0 ~SKIP2~0)) (.cse2 (= main_~status~9 0)) (.cse8 (<= (+ ~NP~0 ~DC~0 7) .cse15)) (.cse9 (not (= main_~status~9 259))) (.cse11 (and (<= (+ ~DC~0 5) ~IPC~0) (and .cse5 (and .cse3 .cse6) (= ~s~0 ~DC~0)) .cse7)) (.cse0 (= ~s~0 ~IPC~0)) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= main_~status~9 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse14 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and .cse1 .cse4 .cse5 .cse3 .cse6 .cse7) (not (= 0 |old(~routine~0)|)) (and .cse1 .cse4 .cse2 .cse3) (and .cse0 .cse1 .cse8 .cse9 .cse3 .cse6) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (and .cse10 (<= (+ main_~status~9 1073741789) 0) .cse11) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse8 (<= (+ ~DC~0 7) ~s~0) .cse3 .cse6) (and .cse0 .cse10 .cse1 .cse12 .cse6 (= 0 ~routine~0) (<= 1 ~compRegistered~0) .cse13 .cse5 .cse14) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse10 .cse9 .cse14 .cse11) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse10 .cse1 .cse12 .cse5 .cse3 .cse6 .cse14) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)))))) [2019-10-02 11:42:08,512 INFO L443 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2019-10-02 11:42:08,512 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2019-10-02 11:42:08,512 INFO L443 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2019-10-02 11:42:08,512 INFO L439 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse1 (= main_~status~9 ~lowerDriverReturn~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (and .cse1 .cse2)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (+ ~IPC~0 ~SKIP1~0))) (let ((.cse3 (<= (+ ~NP~0 ~DC~0 7) .cse7)) (.cse0 (and (and (<= (+ ~DC~0 2) ~SKIP2~0) (or (and .cse4 .cse5) (and (and .cse2 .cse5) (= ~s~0 ~DC~0)))) (<= (+ ~SKIP2~0 ~NP~0 5) .cse7))) (.cse6 (not (= main_~status~9 259)))) (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and .cse0 (<= ~SKIP2~0 ~s~0)) (not (= 0 |old(~routine~0)|)) (and .cse1 (= main_~status~9 0) .cse2) (and .cse3 (<= (+ ~DC~0 7) ~s~0) .cse4 .cse5) (and .cse3 .cse6 .cse4 .cse5) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)))))) [2019-10-02 11:42:08,512 INFO L439 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(~DC~0)|)) (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)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~s~0 ~SKIP2~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (= ~MPR3~0 ~s~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,513 INFO L443 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2019-10-02 11:42:08,513 INFO L439 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 (= 0 ~routine~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)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~myStatus~0 |old(~myStatus~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)|)) (let ((.cse10 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 .cse10) .cse7 .cse8 (<= .cse10 0) .cse9)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:42:08,513 INFO L439 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (+ ~IPC~0 ~SKIP1~0))) (let ((.cse2 (<= (+ ~NP~0 ~DC~0 7) .cse15)) (.cse6 (= ~s~0 ~SKIP2~0)) (.cse0 (= ~s~0 ~IPC~0)) (.cse1 (= main_~status~9 ~lowerDriverReturn~0)) (.cse13 (= main_~status~9 0)) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse10 (and .cse3 .cse4)) (.cse11 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (= ~s~0 ~DC~0)) (.cse5 (not (= main_~status~9 259))) (.cse14 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) .cse15))) (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 (<= (+ ~DC~0 7) ~s~0) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4) (not (= 0 |old(~routine~0)|)) (and .cse1 .cse6 .cse7 .cse3 .cse4 .cse8) (and .cse9 .cse10 .cse11 .cse7 .cse12 (<= (+ main_~status~9 1073741789) 0) .cse8) (and .cse1 .cse6 .cse13 .cse4) (and .cse0 .cse9 .cse1 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse7 .cse3 .cse4 .cse14) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse13 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse9 .cse10 .cse11 .cse7 .cse12 .cse5 .cse14 .cse8) (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 (= |old(~s~0)| |old(~MPR3~0)|))))) [2019-10-02 11:42:08,513 INFO L443 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2019-10-02 11:42:08,514 INFO L439 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse15 (+ ~IPC~0 ~SKIP1~0)) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and .cse14 (= 0 ~pended~0))) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) .cse15))) (let ((.cse5 (= ~s~0 ~SKIP2~0)) (.cse2 (and (<= (+ ~DC~0 5) ~IPC~0) (and (= ~s~0 ~DC~0) (and .cse9 .cse7)) .cse8 .cse10)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse6 (= main_~status~9 0)) (.cse11 (= ~s~0 ~IPC~0)) (.cse4 (= main_~status~9 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 ~DC~0 7) .cse15)) (.cse1 (not (= main_~status~9 259)))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse5 .cse8 .cse9 .cse7 .cse10) (and .cse11 .cse4 .cse12 (<= (+ ~DC~0 7) ~s~0) .cse9 .cse7) (and .cse11 .cse0 .cse4 .cse13 .cse8 .cse9 .cse3 .cse7) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse0 (<= (+ main_~status~9 1073741789) 0) .cse2) (not (= |old(~customIrp~0)| 0)) (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse11 .cse0 .cse4 .cse13 .cse9 (= 0 ~routine~0) (<= 1 ~compRegistered~0) .cse14 .cse8 .cse3) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse11 .cse4 .cse6 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse11 .cse4 .cse12 .cse1 .cse9 .cse7) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)))))) [2019-10-02 11:42:08,514 INFO L443 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2019-10-02 11:42:08,514 INFO L443 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2019-10-02 11:42:08,514 INFO L443 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2019-10-02 11:42:08,514 INFO L443 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2019-10-02 11:42:08,514 INFO L439 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)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 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)) (.cse6 (= 0 ~routine~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse7 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 .cse7) .cse8 .cse9 (<= .cse7 0) .cse10)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 (= ~myStatus~0 |old(~myStatus~0)|) .cse10)))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,514 INFO L443 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2019-10-02 11:42:08,514 INFO L439 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)|)) (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (not (= |old(~s~0)| |old(~DC~0)|)) (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))) [2019-10-02 11:42:08,515 INFO L443 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2019-10-02 11:42:08,515 INFO L439 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))) [2019-10-02 11:42:08,515 INFO L443 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2019-10-02 11:42:08,515 INFO L443 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2019-10-02 11:42:08,515 INFO L443 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2019-10-02 11:42:08,515 INFO L443 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2019-10-02 11:42:08,515 INFO L446 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2019-10-02 11:42:08,515 INFO L443 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2019-10-02 11:42:08,515 INFO L443 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2019-10-02 11:42:08,515 INFO L443 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2019-10-02 11:42:08,515 INFO L439 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))) [2019-10-02 11:42:08,515 INFO L439 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse3 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= 1 ~compRegistered~0))))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 (not (<= 0 .cse2)))) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0))))) (not (= ~customIrp~0 0))) [2019-10-02 11:42:08,516 INFO L443 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2019-10-02 11:42:08,516 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse3 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= 1 ~compRegistered~0))))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 (not (<= 0 .cse2)))) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0))))) (= ~s~0 |old(~s~0)|) (not (= ~customIrp~0 0))) [2019-10-02 11:42:08,516 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2019-10-02 11:42:08,516 INFO L443 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2019-10-02 11:42:08,516 INFO L439 ceAbstractionStarter]: At program point L2075(lines 2074 2097) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,516 INFO L439 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,516 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2019-10-02 11:42:08,516 INFO L439 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,517 INFO L443 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2019-10-02 11:42:08,517 INFO L443 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2019-10-02 11:42:08,517 INFO L443 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2019-10-02 11:42:08,517 INFO L439 ceAbstractionStarter]: At program point L2080(lines 2079 2096) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,517 INFO L443 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2019-10-02 11:42:08,517 INFO L443 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2019-10-02 11:42:08,517 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,518 INFO L443 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2019-10-02 11:42:08,518 INFO L443 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2019-10-02 11:42:08,518 INFO L443 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2019-10-02 11:42:08,518 INFO L443 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2019-10-02 11:42:08,518 INFO L439 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) [2019-10-02 11:42:08,518 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2019-10-02 11:42:08,518 INFO L443 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2019-10-02 11:42:08,518 INFO L443 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2019-10-02 11:42:08,519 INFO L439 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,519 INFO L439 ceAbstractionStarter]: At program point L2082(lines 2081 2096) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,519 INFO L443 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2019-10-02 11:42:08,519 INFO L439 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,519 INFO L443 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2019-10-02 11:42:08,519 INFO L439 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (= ~s~0 |old(~s~0)|) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0))) [2019-10-02 11:42:08,519 INFO L443 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2019-10-02 11:42:08,520 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2019-10-02 11:42:08,520 INFO L439 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (= ~s~0 |old(~s~0)|) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0))) [2019-10-02 11:42:08,520 INFO L443 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2019-10-02 11:42:08,520 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-10-02 11:42:08,520 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-10-02 11:42:08,520 INFO L443 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2019-10-02 11:42:08,520 INFO L443 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-10-02 11:42:08,520 INFO L443 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2019-10-02 11:42:08,521 INFO L443 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2019-10-02 11:42:08,521 INFO L443 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2019-10-02 11:42:08,521 INFO L439 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse10 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse11 (not (= 0 ~pended~0))) (.cse8 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse13 (not (= 1 ~routine~0))) (.cse12 (not (<= 1 ~compRegistered~0))) (.cse15 (= ~s~0 |old(~s~0)|)) (.cse17 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (not (= ~myStatus~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse2 (not (<= .cse20 0))) (.cse7 (not (<= 0 .cse20))) (.cse16 (or .cse1 .cse3 (or .cse10 .cse19 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse5 .cse11 .cse8 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)))) (.cse14 (not (= |old(~customIrp~0)| 0)))) (and (or (or (let ((.cse4 (or .cse10 .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse6 .cse9 .cse8 .cse3 .cse4))) (not (= |old(~s~0)| ~MPR3~0))) .cse14) (or .cse6 .cse9 .cse15 .cse16) (or (and (and (= ~setEventCalled~0 1) .cse15) .cse17) (let ((.cse18 (or (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse10 .cse3 .cse13 .cse19 .cse5 .cse11 .cse8 .cse12))) (and (or .cse0 .cse18 .cse6 .cse2 .cse7) (or .cse0 .cse18 .cse6 .cse9))) .cse14) (or .cse6 .cse2 .cse7 .cse15 .cse16) (or .cse17 (and (or .cse6 .cse9 .cse16) (or .cse6 .cse2 .cse7 .cse16)) .cse14)))) [2019-10-02 11:42:08,521 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2019-10-02 11:42:08,521 INFO L443 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2019-10-02 11:42:08,522 INFO L439 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse10 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse18 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse11 (not (= 0 ~pended~0))) (.cse8 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse13 (not (= 1 ~routine~0))) (.cse12 (not (<= 1 ~compRegistered~0))) (.cse14 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (not (= ~myStatus~0 0))) (.cse16 (not (= |old(~customIrp~0)| 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse2 (not (<= .cse20 0))) (.cse15 (= ~s~0 ~NP~0)) (.cse7 (not (<= 0 .cse20))) (.cse19 (or .cse1 .cse3 (or .cse10 .cse18 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse5 .cse11 .cse8 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))))) (and (or (or (let ((.cse4 (or .cse10 .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse6 .cse9 .cse8 .cse3 .cse4))) (not (= |old(~s~0)| ~MPR3~0))) (and .cse14 .cse15) .cse16) (or (let ((.cse17 (or (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse10 .cse3 .cse13 .cse18 .cse5 .cse11 .cse8 .cse12))) (and (or .cse0 .cse17 .cse6 .cse2 .cse7) (or .cse0 .cse17 .cse6 .cse9))) (and (and (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1)) .cse14) .cse16) (or .cse15 .cse6 .cse9 .cse19) (or .cse14 (and (or .cse6 .cse9 .cse19) (or .cse6 .cse2 .cse7 .cse19)) .cse16) (or .cse6 .cse2 .cse15 .cse7 .cse19)))) [2019-10-02 11:42:08,522 INFO L439 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse10 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse18 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse11 (not (= 0 ~pended~0))) (.cse8 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse13 (not (= 1 ~routine~0))) (.cse12 (not (<= 1 ~compRegistered~0))) (.cse14 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (not (= ~myStatus~0 0))) (.cse16 (not (= |old(~customIrp~0)| 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse2 (not (<= .cse20 0))) (.cse15 (= ~s~0 ~NP~0)) (.cse7 (not (<= 0 .cse20))) (.cse19 (or .cse1 .cse3 (or .cse10 .cse18 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse5 .cse11 .cse8 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))))) (and (or (or (let ((.cse4 (or .cse10 .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse6 .cse9 .cse8 .cse3 .cse4))) (not (= |old(~s~0)| ~MPR3~0))) (and .cse14 .cse15) .cse16) (or (let ((.cse17 (or (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse10 .cse3 .cse13 .cse18 .cse5 .cse11 .cse8 .cse12))) (and (or .cse0 .cse17 .cse6 .cse2 .cse7) (or .cse0 .cse17 .cse6 .cse9))) (and (and (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1)) .cse14) .cse16) (or .cse15 .cse6 .cse9 .cse19) (or .cse14 (and (or .cse6 .cse9 .cse19) (or .cse6 .cse2 .cse7 .cse19)) .cse16) (or .cse6 .cse2 .cse15 .cse7 .cse19)))) [2019-10-02 11:42:08,523 INFO L439 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse15 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse11 (not (= 0 ~pended~0))) (.cse12 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse13 (not (<= 1 ~compRegistered~0))) (.cse8 (not (= 1 ~routine~0))) (.cse14 (not (= |old(~customIrp~0)| 0))) (.cse5 (not (= ~myStatus~0 0))) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse3 (not (<= .cse18 0))) (.cse4 (not (<= 0 .cse18))) (.cse17 (or .cse15 .cse7 (or .cse6 .cse9 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse10 .cse11 .cse12 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))))) (and (or (let ((.cse1 (or (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse5))) .cse14) (or (or (let ((.cse16 (or .cse6 .cse11 .cse13 .cse8))) (and (or .cse0 .cse15 .cse3 .cse7 .cse16 .cse10 .cse2 .cse4 .cse12) (or .cse0 .cse15 .cse10 .cse2 .cse5 .cse12 .cse7 .cse16))) (not (= |old(~s~0)| ~MPR3~0))) .cse14) (or .cse2 .cse5 .cse17) (or .cse2 .cse3 .cse4 .cse17)))) [2019-10-02 11:42:08,523 INFO L443 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2019-10-02 11:42:08,523 INFO L443 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2019-10-02 11:42:08,523 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2019-10-02 11:42:08,523 INFO L443 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2019-10-02 11:42:08,523 INFO L443 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2019-10-02 11:42:08,524 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse19 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse9 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse13 (not (= 0 ~pended~0))) (.cse14 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse21 (+ ~myStatus~0 1073741637)) (.cse17 (= ~s~0 |old(~s~0)|))) (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse15 (not (<= 1 ~compRegistered~0))) (.cse10 (not (= 1 ~routine~0))) (.cse1 (and .cse17 (= ~setEventCalled~0 1))) (.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (not (= ~myStatus~0 0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse5 (not (<= .cse21 0))) (.cse6 (not (<= 0 .cse21))) (.cse18 (or .cse19 .cse9 (or .cse8 .cse11 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse12 .cse13 .cse14 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)))) (.cse16 (not (= |old(~customIrp~0)| 0)))) (and (or (and .cse0 .cse1) (let ((.cse3 (or (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse2 .cse3 .cse4 .cse7))) .cse16) (or .cse17 .cse4 .cse7 .cse18) (or .cse4 .cse5 .cse17 .cse6 .cse18) (or (or (let ((.cse20 (or .cse8 .cse13 .cse15 .cse10))) (and (or .cse2 .cse19 .cse5 .cse9 .cse20 .cse12 .cse4 .cse6 .cse14) (or .cse2 .cse19 .cse12 .cse4 .cse7 .cse14 .cse9 .cse20))) (not (= |old(~s~0)| ~MPR3~0))) (and .cse1 .cse0) .cse16) (or .cse0 (and (or .cse4 .cse7 .cse18) (or .cse4 .cse5 .cse6 .cse18)) .cse16)))) [2019-10-02 11:42:08,524 INFO L439 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (not .cse14)) (.cse3 (and .cse12 (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse13 .cse14)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (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 (not (<= .cse11 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,524 INFO L443 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2019-10-02 11:42:08,524 INFO L439 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse8 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (<= 1 ~compRegistered~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 0 .cse2)) .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse8 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11))) [2019-10-02 11:42:08,524 INFO L443 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2019-10-02 11:42:08,525 INFO L439 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10 .cse2)))) [2019-10-02 11:42:08,525 INFO L439 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse10 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 0 .cse10)) .cse7 .cse8 .cse9)))) [2019-10-02 11:42:08,525 INFO L443 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2019-10-02 11:42:08,525 INFO L443 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2019-10-02 11:42:08,525 INFO L443 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2019-10-02 11:42:08,525 INFO L439 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse10 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 0 .cse10)) .cse7 .cse8 .cse9)))) [2019-10-02 11:42:08,526 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2019-10-02 11:42:08,526 INFO L443 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2019-10-02 11:42:08,526 INFO L443 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2019-10-02 11:42:08,526 INFO L443 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2019-10-02 11:42:08,526 INFO L443 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2019-10-02 11:42:08,526 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse4 (= ~s~0 |old(~s~0)|)) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (= 0 ~pended~0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (not (= 0 ~routine~0)) .cse2 .cse3 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)) .cse4 (or .cse5 (not (= ~compRegistered~0 0)))) (or .cse4 (or (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (or (not (<= (+ ~MPR3~0 1) ~IPC~0)) (or (or .cse0 .cse5) .cse2 .cse3 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) .cse1 (not (= 1 ~routine~0)))))))) [2019-10-02 11:42:08,526 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2019-10-02 11:42:08,527 INFO L439 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (= 0 ~pended~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 (not (= 0 ~routine~0)) .cse1 .cse2 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse3 (not (<= (+ ~DC~0 5) ~IPC~0)) (or .cse4 (not (= ~compRegistered~0 0)))) (or (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (or (not (<= (+ ~MPR3~0 1) ~IPC~0)) (or (or .cse0 .cse4) .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) .cse3 (not (= 1 ~routine~0))))))) [2019-10-02 11:42:08,527 INFO L439 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,527 INFO L443 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2019-10-02 11:42:08,527 INFO L439 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,527 INFO L439 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-02 11:42:08,527 INFO L443 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2019-10-02 11:42:08,527 INFO L443 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2019-10-02 11:42:08,527 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2019-10-02 11:42:08,528 INFO L443 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2019-10-02 11:42:08,528 INFO L443 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2019-10-02 11:42:08,528 INFO L439 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (= 0 ~pended~0)) (.cse2 (not (<= (+ ~s~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse6 (not (= ~s~0 ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse11 (not (<= 1 ~compRegistered~0)))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (not (<= .cse1 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 0 .cse1)) .cse9 .cse10 .cse11)) (or .cse0 (not (= ~myStatus~0 0)) .cse5 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-10-02 11:42:08,528 INFO L443 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2019-10-02 11:42:08,528 INFO L439 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= .cse0 0)) (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 0 .cse0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= 1 ~compRegistered~0)))) [2019-10-02 11:42:08,528 INFO L443 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2019-10-02 11:42:08,528 INFO L439 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~s~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= 1 ~compRegistered~0)))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (not (<= .cse1 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse1)) .cse8 .cse9 .cse10)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-10-02 11:42:08,529 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2019-10-02 11:42:08,529 INFO L443 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2019-10-02 11:42:08,529 INFO L443 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2019-10-02 11:42:08,529 INFO L446 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2019-10-02 11:42:08,529 INFO L443 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2019-10-02 11:42:08,529 INFO L443 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2019-10-02 11:42:08,529 INFO L443 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2019-10-02 11:42:08,529 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2019-10-02 11:42:08,529 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2019-10-02 11:42:08,529 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2019-10-02 11:42:08,530 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2019-10-02 11:42:08,530 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (not (<= .cse10 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 0 .cse10)) .cse7 .cse8 .cse9)))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,530 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2019-10-02 11:42:08,530 INFO L446 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2019-10-02 11:42:08,530 INFO L443 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2019-10-02 11:42:08,530 INFO L446 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2019-10-02 11:42:08,530 INFO L443 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2019-10-02 11:42:08,530 INFO L443 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2019-10-02 11:42:08,531 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2019-10-02 11:42:08,531 INFO L439 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,531 INFO L443 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2019-10-02 11:42:08,531 INFO L439 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= CdAudioPnp_~status~2 |old(~myStatus~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,531 INFO L443 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2019-10-02 11:42:08,531 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2019-10-02 11:42:08,532 INFO L443 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2019-10-02 11:42:08,532 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2019-10-02 11:42:08,532 INFO L439 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= |old(~customIrp~0)| ~customIrp~0) (and (= ~myStatus~0 |old(~myStatus~0)|) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 ~routine~0)))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,532 INFO L443 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2019-10-02 11:42:08,532 INFO L443 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2019-10-02 11:42:08,532 INFO L439 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= |old(~customIrp~0)| ~customIrp~0) (and (= ~myStatus~0 |old(~myStatus~0)|) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 ~routine~0)))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,533 INFO L439 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= |old(~customIrp~0)| ~customIrp~0) (and (= ~myStatus~0 |old(~myStatus~0)|) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 ~routine~0)))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,533 INFO L439 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (and (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0)) (= ~s~0 |old(~s~0)|)) (<= CdAudioPnp_~setPagable~0 0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,533 INFO L443 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2019-10-02 11:42:08,533 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2019-10-02 11:42:08,533 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-10-02 11:42:08,533 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-10-02 11:42:08,533 INFO L439 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= CdAudioPnp_~status~2 |old(~myStatus~0)|) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,534 INFO L443 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2019-10-02 11:42:08,534 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2019-10-02 11:42:08,534 INFO L439 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0)) (= ~s~0 |old(~s~0)|) (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,534 INFO L439 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .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) (= 0 ~compRegistered~0) (= 0 ~routine~0)) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,534 INFO L439 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (and (and (and (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= ~setEventCalled~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) (= CdAudioPnp_~status~2 |old(~myStatus~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,535 INFO L443 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2019-10-02 11:42:08,535 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-10-02 11:42:08,535 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2019-10-02 11:42:08,535 INFO L443 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2019-10-02 11:42:08,535 INFO L443 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2019-10-02 11:42:08,535 INFO L439 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= |old(~customIrp~0)| 0))) [2019-10-02 11:42:08,535 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2019-10-02 11:42:08,535 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2019-10-02 11:42:08,535 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2019-10-02 11:42:08,536 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2019-10-02 11:42:08,536 INFO L439 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,536 INFO L443 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2019-10-02 11:42:08,536 INFO L439 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (let ((.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (not .cse14)) (.cse3 (and .cse12 (= 0 ~pended~0) (= ~s~0 ~NP~0) .cse13 .cse14)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,536 INFO L443 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2019-10-02 11:42:08,537 INFO L439 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,537 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2019-10-02 11:42:08,537 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2019-10-02 11:42:08,537 INFO L443 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2019-10-02 11:42:08,537 INFO L439 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,537 INFO L439 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (let ((.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (= 0 ~routine~0)) (.cse16 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse15)) (.cse3 (not .cse16)) (.cse4 (not .cse14)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not .cse13)) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (and .cse12 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse13 (= ~s~0 |old(~s~0)|) .cse14 (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0) .cse15 .cse16)) (.cse8 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse11)))) [2019-10-02 11:42:08,538 INFO L443 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2019-10-02 11:42:08,538 INFO L443 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2019-10-02 11:42:08,538 INFO L443 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2019-10-02 11:42:08,538 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2019-10-02 11:42:08,538 INFO L439 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,539 INFO L439 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (let ((.cse16 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse5 (and (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse16)) (.cse15 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse15)) (.cse1 (not .cse16)) (.cse2 (and .cse15 .cse5 (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) (.cse7 (= ~myStatus~0 |old(~myStatus~0)|)) (.cse6 (= 0 CdAudio535DeviceControl_~status~5)) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse11 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse12 (not (= ~compRegistered~0 0))) (.cse13 (not (= 0 |old(~pended~0)|))) (.cse14 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse3 0)) .cse4 (and .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 (not (<= 0 .cse3)) .cse12 .cse13 .cse14)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) (and (and .cse5 .cse7) .cse6) .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2019-10-02 11:42:08,539 INFO L439 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,539 INFO L443 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2019-10-02 11:42:08,539 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2019-10-02 11:42:08,539 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2019-10-02 11:42:08,539 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2019-10-02 11:42:08,539 INFO L439 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10)))) [2019-10-02 11:42:08,540 INFO L443 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2019-10-02 11:42:08,540 INFO L443 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2019-10-02 11:42:08,540 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2019-10-02 11:42:08,540 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2019-10-02 11:42:08,540 INFO L439 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (and .cse13 (and (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse12) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) (.cse0 (not .cse13)) (.cse1 (not .cse12)) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse3 0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 0 .cse3)) .cse9 .cse10 .cse11)) (or .cse2 .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-10-02 11:42:08,540 INFO L443 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2019-10-02 11:42:08,541 INFO L439 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,541 INFO L443 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2019-10-02 11:42:08,541 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2019-10-02 11:42:08,541 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2019-10-02 11:42:08,541 INFO L439 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,541 INFO L443 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2019-10-02 11:42:08,541 INFO L439 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (and (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse13) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse3 0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 0 .cse3)) .cse9 .cse10 .cse11)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-10-02 11:42:08,542 INFO L443 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2019-10-02 11:42:08,542 INFO L443 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2019-10-02 11:42:08,542 INFO L439 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,542 INFO L443 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2019-10-02 11:42:08,542 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2019-10-02 11:42:08,542 INFO L443 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2019-10-02 11:42:08,543 INFO L439 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (let ((.cse12 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not .cse12)) (.cse3 (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse12) (= ~myStatus~0 |old(~myStatus~0)|) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,543 INFO L439 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (and .cse13 (and (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse12) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) (.cse0 (not .cse13)) (.cse1 (not .cse12)) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse3 0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 0 .cse3)) .cse9 .cse10 .cse11)) (or .cse2 .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-10-02 11:42:08,543 INFO L443 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2019-10-02 11:42:08,543 INFO L443 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2019-10-02 11:42:08,544 INFO L439 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,544 INFO L443 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2019-10-02 11:42:08,544 INFO L443 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2019-10-02 11:42:08,544 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2019-10-02 11:42:08,544 INFO L443 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2019-10-02 11:42:08,544 INFO L443 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2019-10-02 11:42:08,544 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2019-10-02 11:42:08,544 INFO L439 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (let ((.cse12 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse15 (= 0 ~routine~0)) (.cse17 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse13)) (.cse1 (not .cse16)) (.cse3 (not .cse17)) (.cse4 (not .cse15)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not .cse14)) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse11 (and .cse13 (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse14 (= ~s~0 |old(~s~0)|) .cse15 .cse16 .cse17 (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) .cse12)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not .cse12))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse2)) .cse8 .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9 .cse10)))) [2019-10-02 11:42:08,545 INFO L443 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2019-10-02 11:42:08,545 INFO L439 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (let ((.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse3 (not .cse14)) (.cse4 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13 .cse14)) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 0 .cse2)) .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-10-02 11:42:08,545 INFO L443 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2019-10-02 11:42:08,545 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2019-10-02 11:42:08,545 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2019-10-02 11:42:08,546 INFO L439 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10)))) [2019-10-02 11:42:08,546 INFO L443 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2019-10-02 11:42:08,546 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2019-10-02 11:42:08,546 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2019-10-02 11:42:08,546 INFO L439 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (let ((.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse3 (not .cse14)) (.cse2 (and .cse12 (and (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse13) .cse14)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,546 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2019-10-02 11:42:08,546 INFO L439 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and (and .cse12 (= 0 ~pended~0) (= ~s~0 ~NP~0) .cse13) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,547 INFO L443 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2019-10-02 11:42:08,547 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2019-10-02 11:42:08,547 INFO L439 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10)))) [2019-10-02 11:42:08,547 INFO L443 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2019-10-02 11:42:08,547 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2019-10-02 11:42:08,547 INFO L443 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2019-10-02 11:42:08,547 INFO L439 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (let ((.cse12 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not .cse12)) (.cse3 (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse12) (= ~myStatus~0 |old(~myStatus~0)|) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,548 INFO L443 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2019-10-02 11:42:08,548 INFO L443 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2019-10-02 11:42:08,548 INFO L443 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2019-10-02 11:42:08,548 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2019-10-02 11:42:08,548 INFO L443 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2019-10-02 11:42:08,548 INFO L439 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (and .cse12 (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) .cse13)) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,548 INFO L443 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2019-10-02 11:42:08,549 INFO L443 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2019-10-02 11:42:08,549 INFO L439 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637)) (.cse19 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse7 (= 0 ~pended~0)) (.cse9 (not (= ~myStatus~0 0))) (.cse0 (not .cse19)) (.cse17 (and (= ~s~0 |old(~s~0)|) .cse19)) (.cse10 (not (<= .cse18 0))) (.cse12 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (not (= 0 ~routine~0))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse11 (not (<= 0 .cse18))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse14 (not (<= 1 ~compRegistered~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (not (<= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3 .cse4 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse5 .cse6 (and .cse7 (= ~SKIP1~0 ~s~0))) (or (let ((.cse8 (or .cse0 .cse12 .cse1 (not (= 1 ~routine~0)) .cse13 .cse3 .cse5 .cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse14))) (and (or .cse4 .cse8 .cse9) (or .cse4 .cse10 .cse8 .cse11))) (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse15 0) .cse7 (<= 0 .cse15) (<= .cse16 0) (<= 0 .cse16) (= ~setEventCalled~0 1))) (not (= ~customIrp~0 0))) (or .cse0 .cse17 .cse9 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14) (or .cse0 .cse17 .cse10 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse11 .cse5 .cse6 .cse14)))) [2019-10-02 11:42:08,549 INFO L439 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637)) (.cse19 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse7 (= 0 ~pended~0)) (.cse9 (not (= ~myStatus~0 0))) (.cse0 (not .cse19)) (.cse17 (and (= ~s~0 |old(~s~0)|) .cse19)) (.cse10 (not (<= .cse18 0))) (.cse12 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (not (= 0 ~routine~0))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse11 (not (<= 0 .cse18))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse14 (not (<= 1 ~compRegistered~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (not (<= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3 .cse4 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse5 .cse6 (and .cse7 (= ~SKIP1~0 ~s~0))) (or (let ((.cse8 (or .cse0 .cse12 .cse1 (not (= 1 ~routine~0)) .cse13 .cse3 .cse5 .cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse14))) (and (or .cse4 .cse8 .cse9) (or .cse4 .cse10 .cse8 .cse11))) (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse15 0) .cse7 (<= 0 .cse15) (<= .cse16 0) (<= 0 .cse16) (= ~setEventCalled~0 1))) (not (= ~customIrp~0 0))) (or .cse0 .cse17 .cse9 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14) (or .cse0 .cse17 .cse10 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse11 .cse5 .cse6 .cse14)))) [2019-10-02 11:42:08,549 INFO L443 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2019-10-02 11:42:08,549 INFO L443 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2019-10-02 11:42:08,550 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2019-10-02 11:42:08,550 INFO L443 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2019-10-02 11:42:08,550 INFO L443 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2019-10-02 11:42:08,550 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse15 (= 0 ~pended~0)) (.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse3 (not (= ~myStatus~0 0))) (.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= .cse16 0))) (.cse7 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse8 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse14 (not (= 0 ~routine~0))) (.cse0 (and .cse15 (= ~s~0 |old(~s~0)|))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse5 (not (<= 0 .cse16))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse13 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (let ((.cse2 (or .cse6 .cse7 .cse8 (not (= 1 ~routine~0)) .cse9 .cse10 .cse11 .cse12 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse13))) (and (or .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse2 .cse5))) (not (= ~customIrp~0 0))) (or .cse6 .cse3 .cse0 .cse7 .cse8 .cse14 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse6 .cse8 (not (<= |old(~s~0)| ~SKIP1~0)) .cse14 .cse10 .cse1 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse11 .cse12 (and .cse15 (= ~SKIP1~0 ~s~0))) (or .cse6 .cse4 .cse7 .cse8 .cse14 .cse0 .cse9 .cse10 .cse1 .cse5 .cse11 .cse12 .cse13)))) [2019-10-02 11:42:08,550 INFO L443 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2019-10-02 11:42:08,550 INFO L443 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2019-10-02 11:42:08,550 INFO L443 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2019-10-02 11:42:08,551 INFO L439 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637)) (.cse19 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse7 (= 0 ~pended~0)) (.cse9 (not (= ~myStatus~0 0))) (.cse0 (not .cse19)) (.cse17 (and (= ~s~0 |old(~s~0)|) .cse19)) (.cse10 (not (<= .cse18 0))) (.cse12 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (not (= 0 ~routine~0))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse11 (not (<= 0 .cse18))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse14 (not (<= 1 ~compRegistered~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (not (<= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3 .cse4 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse5 .cse6 (and .cse7 (= ~SKIP1~0 ~s~0))) (or (let ((.cse8 (or .cse0 .cse12 .cse1 (not (= 1 ~routine~0)) .cse13 .cse3 .cse5 .cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse14))) (and (or .cse4 .cse8 .cse9) (or .cse4 .cse10 .cse8 .cse11))) (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse15 0) .cse7 (<= 0 .cse15) (<= .cse16 0) (<= 0 .cse16) (= ~setEventCalled~0 1))) (not (= ~customIrp~0 0))) (or .cse0 .cse17 .cse9 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14) (or .cse0 .cse17 .cse10 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse11 .cse5 .cse6 .cse14)))) [2019-10-02 11:42:08,551 INFO L443 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2019-10-02 11:42:08,551 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2019-10-02 11:42:08,551 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2019-10-02 11:42:08,551 INFO L439 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse4 (not (= 0 ~routine~0))) (.cse12 (not (= ~myStatus~0 0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse1 (not (<= .cse14 0))) (.cse8 (not (<= 0 .cse14))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse11 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse3 (not (<= |old(~s~0)| ~SKIP1~0)) .cse4 .cse6 .cse7 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse9 .cse10) (or (let ((.cse13 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse11))) (and (or .cse7 .cse13 .cse12) (or .cse7 .cse1 .cse13 .cse8))) (not (= ~customIrp~0 0)))))) [2019-10-02 11:42:08,551 INFO L443 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2019-10-02 11:42:08,552 INFO L439 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse15 (+ ~myStatus~0 1073741637))) (let ((.cse2 (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse1 (not (= ~myStatus~0 0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse12 (not (<= .cse15 0))) (.cse13 (not (<= 0 .cse15))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse11 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse4 (not (<= |old(~s~0)| ~SKIP1~0)) .cse5 .cse7 .cse8 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse9 .cse10) (or (let ((.cse14 (or .cse0 .cse3 .cse4 (not (= 1 ~routine~0)) .cse6 .cse7 .cse9 .cse10 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse11))) (and (or .cse8 .cse14 .cse1) (or .cse8 .cse12 .cse14 .cse13))) (not (= ~customIrp~0 0)))))) [2019-10-02 11:42:08,552 INFO L443 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2019-10-02 11:42:08,552 INFO L439 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637)) (.cse19 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse7 (= 0 ~pended~0)) (.cse9 (not (= ~myStatus~0 0))) (.cse0 (not .cse19)) (.cse17 (and (= ~s~0 |old(~s~0)|) .cse19)) (.cse10 (not (<= .cse18 0))) (.cse12 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (not (= 0 ~routine~0))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse11 (not (<= 0 .cse18))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse14 (not (<= 1 ~compRegistered~0)))) (and (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse1 (not (<= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3 .cse4 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse5 .cse6 (and .cse7 (= ~SKIP1~0 ~s~0))) (or (let ((.cse8 (or .cse0 .cse12 .cse1 (not (= 1 ~routine~0)) .cse13 .cse3 .cse5 .cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse14))) (and (or .cse4 .cse8 .cse9) (or .cse4 .cse10 .cse8 .cse11))) (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse15 0) .cse7 (<= 0 .cse15) (<= .cse16 0) (<= 0 .cse16) (= ~setEventCalled~0 1))) (not (= ~customIrp~0 0))) (or .cse0 .cse17 .cse9 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14) (or .cse0 .cse17 .cse10 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse11 .cse5 .cse6 .cse14)))) [2019-10-02 11:42:08,552 INFO L439 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse1 (not (<= .cse16 0))) (.cse8 (not (<= 0 .cse16))) (.cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse11 (not (<= 1 ~compRegistered~0))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 ~routine~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (or (let ((.cse13 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse5 .cse6 .cse9 .cse10 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse11))) (and (or .cse7 .cse13 .cse12) (or .cse7 .cse1 .cse13 .cse8))) (and (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse14 0) (= 0 ~pended~0) (<= 0 .cse14) (<= .cse15 0) (<= 0 .cse15) (= ~setEventCalled~0 1))) (= ~s~0 |old(~s~0)|)) (not (= ~customIrp~0 0))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse3 (not (<= |old(~s~0)| ~SKIP1~0)) .cse4 .cse6 .cse7 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse9 .cse10)))) [2019-10-02 11:42:08,553 INFO L439 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse3 (not (<= .cse14 0))) (.cse4 (not (<= 0 .cse14))) (.cse2 (not (= ~myStatus~0 0))) (.cse6 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (<= 1 ~compRegistered~0))) (.cse5 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse13 (not (= 0 ~routine~0))) (.cse9 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse0 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (let ((.cse1 (or .cse5 .cse6 .cse7 (not (= 1 ~routine~0)) .cse8 .cse9 .cse10 .cse11 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) .cse12))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse1 .cse4))) (not (= ~customIrp~0 0))) (or .cse5 .cse3 .cse6 .cse7 .cse13 .cse8 .cse9 .cse0 .cse4 .cse10 .cse11 .cse12) (or .cse5 .cse2 .cse6 .cse7 .cse13 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse5 .cse7 (not (<= |old(~s~0)| ~SKIP1~0)) .cse13 .cse9 .cse0 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse10 .cse11)))) [2019-10-02 11:42:08,553 INFO L443 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2019-10-02 11:42:08,553 INFO L443 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2019-10-02 11:42:08,553 INFO L443 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2019-10-02 11:42:08,553 INFO L439 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-10-02 11:42:08,554 INFO L439 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-10-02 11:42:08,554 INFO L443 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2019-10-02 11:42:08,554 INFO L439 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-10-02 11:42:08,554 INFO L443 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2019-10-02 11:42:08,554 INFO L443 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2019-10-02 11:42:08,554 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2019-10-02 11:42:08,554 INFO L443 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2019-10-02 11:42:08,554 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:42:08,554 INFO L439 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)) [2019-10-02 11:42:08,555 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:42:08,555 INFO L439 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:42:08,555 INFO L443 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2019-10-02 11:42:08,555 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2019-10-02 11:42:08,555 INFO L439 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:42:08,555 INFO L443 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2019-10-02 11:42:08,555 INFO L443 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2019-10-02 11:42:08,555 INFO L443 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2019-10-02 11:42:08,556 INFO L439 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:42:08,556 INFO L443 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2019-10-02 11:42:08,556 INFO L439 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:42:08,556 INFO L443 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2019-10-02 11:42:08,556 INFO L439 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:42:08,556 INFO L443 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2019-10-02 11:42:08,556 INFO L443 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2019-10-02 11:42:08,557 INFO L439 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (let ((.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (not .cse14)) (.cse3 (and .cse12 (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse13 .cse14)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,557 INFO L439 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse10 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse10 (not (<= .cse11 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 0 .cse11)) .cse7 .cse8 .cse9)))) [2019-10-02 11:42:08,557 INFO L443 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2019-10-02 11:42:08,557 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2019-10-02 11:42:08,557 INFO L443 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2019-10-02 11:42:08,557 INFO L443 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2019-10-02 11:42:08,557 INFO L443 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2019-10-02 11:42:08,558 INFO L439 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse24 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse15 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse18 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse21 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse23 (= ~s~0 ~IPC~0)) (.cse22 (= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0)) (.cse19 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (and (= 0 ~pended~0) .cse24)) (.cse20 (= 0 ~routine~0)) (.cse17 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse17)) (.cse1 (not .cse24)) (.cse2 (and (not (= CdAudioDeviceControl_~status~3 259)) (and .cse17 (and (and .cse16 .cse20) (= ~s~0 ~DC~0))))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not .cse19)) (.cse5 (and .cse23 .cse17 .cse19 .cse20 (<= 1 ~compRegistered~0) .cse22 .cse24)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse21)) (.cse8 (and .cse22 .cse17 (and .cse23 .cse16 .cse19 .cse20) .cse21)) (.cse9 (not .cse18)) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (not .cse15)) (.cse12 (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) .cse15 (and .cse16 .cse17 (= ~s~0 ~SKIP2~0) .cse18 .cse19 .cse20) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3) .cse21)) (.cse13 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse14 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (<= 0 .cse14)) .cse13)))))) [2019-10-02 11:42:08,558 INFO L439 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (let ((.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (not .cse14)) (.cse3 (and .cse12 (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse13 .cse14)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,558 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2019-10-02 11:42:08,558 INFO L439 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10)))) [2019-10-02 11:42:08,559 INFO L443 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2019-10-02 11:42:08,559 INFO L443 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2019-10-02 11:42:08,559 INFO L439 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10)))) [2019-10-02 11:42:08,559 INFO L443 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2019-10-02 11:42:08,559 INFO L439 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (let ((.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~NP~0 2) ~SKIP1~0))) (let ((.cse0 (not .cse12)) (.cse1 (not .cse13)) (.cse2 (not .cse14)) (.cse3 (and .cse12 (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) .cse13 .cse14)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10))))) [2019-10-02 11:42:08,559 INFO L439 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (not (<= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 0 .cse11)) .cse8 .cse9 .cse10 .cse2)))) [2019-10-02 11:42:08,560 INFO L443 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2019-10-02 11:42:08,560 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2019-10-02 11:42:08,560 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:42:08,560 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= ~myStatus~0 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= 0 ~customIrp~0) (= ~s~0 ~SKIP2~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) [2019-10-02 11:42:08,560 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:42:08,560 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:42:08,560 INFO L439 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,560 INFO L443 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2019-10-02 11:42:08,561 INFO L439 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,561 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2019-10-02 11:42:08,561 INFO L439 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,561 INFO L443 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2019-10-02 11:42:08,561 INFO L443 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2019-10-02 11:42:08,561 INFO L439 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,562 INFO L443 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2019-10-02 11:42:08,562 INFO L443 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2019-10-02 11:42:08,562 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2019-10-02 11:42:08,562 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2019-10-02 11:42:08,562 INFO L439 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,562 INFO L443 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2019-10-02 11:42:08,562 INFO L443 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2019-10-02 11:42:08,563 INFO L439 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,563 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2019-10-02 11:42:08,563 INFO L439 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= 0 CdAudio435DeviceControl_~status~6)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,563 INFO L443 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2019-10-02 11:42:08,563 INFO L443 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2019-10-02 11:42:08,563 INFO L439 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,563 INFO L443 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2019-10-02 11:42:08,563 INFO L443 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2019-10-02 11:42:08,563 INFO L443 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2019-10-02 11:42:08,564 INFO L443 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2019-10-02 11:42:08,564 INFO L439 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse0 (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse0) (and (= 0 CdAudio435DeviceControl_~status~6) .cse0) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0))))) [2019-10-02 11:42:08,564 INFO L443 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2019-10-02 11:42:08,564 INFO L443 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2019-10-02 11:42:08,564 INFO L439 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,564 INFO L443 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2019-10-02 11:42:08,564 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2019-10-02 11:42:08,564 INFO L439 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,565 INFO L439 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,565 INFO L439 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse0 (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse0) (and (= 0 CdAudio435DeviceControl_~status~6) .cse0) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0))))) [2019-10-02 11:42:08,565 INFO L443 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2019-10-02 11:42:08,565 INFO L443 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2019-10-02 11:42:08,565 INFO L439 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0))) [2019-10-02 11:42:08,565 INFO L439 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,565 INFO L443 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2019-10-02 11:42:08,565 INFO L443 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2019-10-02 11:42:08,565 INFO L443 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2019-10-02 11:42:08,565 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2019-10-02 11:42:08,566 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2019-10-02 11:42:08,566 INFO L439 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 |old(~s~0)|))) (or (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,566 INFO L439 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,566 INFO L443 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2019-10-02 11:42:08,566 INFO L443 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2019-10-02 11:42:08,566 INFO L439 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,566 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2019-10-02 11:42:08,566 INFO L443 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2019-10-02 11:42:08,566 INFO L443 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2019-10-02 11:42:08,566 INFO L443 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2019-10-02 11:42:08,566 INFO L439 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2019-10-02 11:42:08,566 INFO L443 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2019-10-02 11:42:08,567 INFO L439 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,567 INFO L443 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2019-10-02 11:42:08,567 INFO L439 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,567 INFO L443 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2019-10-02 11:42:08,567 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2019-10-02 11:42:08,567 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2019-10-02 11:42:08,567 INFO L443 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2019-10-02 11:42:08,567 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2019-10-02 11:42:08,567 INFO L439 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,567 INFO L439 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0))) [2019-10-02 11:42:08,567 INFO L443 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2019-10-02 11:42:08,567 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2019-10-02 11:42:08,568 INFO L439 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,568 INFO L443 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2019-10-02 11:42:08,568 INFO L443 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2019-10-02 11:42:08,568 INFO L439 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,568 INFO L443 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2019-10-02 11:42:08,568 INFO L439 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,568 INFO L443 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2019-10-02 11:42:08,568 INFO L439 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,568 INFO L443 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-10-02 11:42:08,568 INFO L443 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2019-10-02 11:42:08,568 INFO L443 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2019-10-02 11:42:08,568 INFO L439 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L439 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (or (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp103~1)) (<= (+ CdAudio435DeviceControl_~status~6 1073741686) 0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (= ~myStatus~0 |old(~myStatus~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L439 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2019-10-02 11:42:08,569 INFO L443 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L439 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 |old(~s~0)|))) (or (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L439 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2019-10-02 11:42:08,570 INFO L443 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L439 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= 0 CdAudio435DeviceControl_~status~6)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L439 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2019-10-02 11:42:08,571 INFO L443 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L439 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)))) [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L446 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L439 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse2 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0)))))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (not (<= .cse1 0)) (not (<= 0 .cse1)) .cse2)) (or .cse0 (not (= ~myStatus~0 0)) .cse2))) [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2019-10-02 11:42:08,572 INFO L443 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2019-10-02 11:42:08,573 INFO L439 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse3 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0)))))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse1 (not (<= .cse2 0)) (not (<= 0 .cse2)) .cse3)) (or .cse1 (not (= ~myStatus~0 0)) .cse3))))) (and (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 (not (= |old(~customIrp~0)| 0))) (or (and (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= ~s~0 |old(~s~0)|)) .cse0))) [2019-10-02 11:42:08,573 INFO L443 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2019-10-02 11:42:08,573 INFO L439 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse3 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0)))))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse1 (not (<= .cse2 0)) (not (<= 0 .cse2)) .cse3)) (or .cse1 (not (= ~myStatus~0 0)) .cse3))))) (and (or .cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0))) (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 (not (= |old(~customIrp~0)| 0))))) [2019-10-02 11:42:08,573 INFO L439 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse2 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0)))))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (not (<= .cse1 0)) (not (<= 0 .cse1)) .cse2)) (or .cse0 (not (= ~myStatus~0 0)) .cse2))) [2019-10-02 11:42:08,573 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2019-10-02 11:42:08,573 INFO L443 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2019-10-02 11:42:08,574 INFO L439 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0)))))) (and (let ((.cse7 (+ ~myStatus~0 1073741637))) (or .cse6 (not (<= .cse7 0)) (not (<= 0 .cse7)) .cse8)) (or .cse6 (not (= ~myStatus~0 0)) .cse8))))) (and (let ((.cse1 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse4 (= ~routine~0 1)) (.cse5 (= ~setEventCalled~0 1))) (or .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5) (= ~MPR3~0 ~s~0)) (and .cse1 .cse2 (= ~s~0 |old(~s~0)|) .cse3 .cse4 .cse5))) (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 (not (= |old(~customIrp~0)| 0))))) [2019-10-02 11:42:08,574 INFO L446 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2019-10-02 11:42:08,574 INFO L446 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2019-10-02 11:42:08,574 INFO L446 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2019-10-02 11:42:08,574 INFO L443 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2019-10-02 11:42:08,574 INFO L443 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2019-10-02 11:42:08,574 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2019-10-02 11:42:08,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:42:08 BoogieIcfgContainer [2019-10-02 11:42:08,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:42:08,686 INFO L168 Benchmark]: Toolchain (without parser) took 111587.23 ms. Allocated memory was 137.9 MB in the beginning and 854.6 MB in the end (delta: 716.7 MB). Free memory was 83.4 MB in the beginning and 144.7 MB in the end (delta: -61.3 MB). Peak memory consumption was 824.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:08,687 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:42:08,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.19 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 83.2 MB in the beginning and 152.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:08,687 INFO L168 Benchmark]: Boogie Preprocessor took 114.61 ms. Allocated memory is still 198.2 MB. Free memory was 152.2 MB in the beginning and 146.3 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:08,688 INFO L168 Benchmark]: RCFGBuilder took 1544.24 ms. Allocated memory was 198.2 MB in the beginning and 219.2 MB in the end (delta: 21.0 MB). Free memory was 146.3 MB in the beginning and 115.6 MB in the end (delta: 30.7 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:08,690 INFO L168 Benchmark]: TraceAbstraction took 109072.28 ms. Allocated memory was 219.2 MB in the beginning and 854.6 MB in the end (delta: 635.4 MB). Free memory was 115.6 MB in the beginning and 144.7 MB in the end (delta: -29.1 MB). Peak memory consumption was 775.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:08,692 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.19 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 83.2 MB in the beginning and 152.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.61 ms. Allocated memory is still 198.2 MB. Free memory was 152.2 MB in the beginning and 146.3 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1544.24 ms. Allocated memory was 198.2 MB in the beginning and 219.2 MB in the end (delta: 21.0 MB). Free memory was 146.3 MB in the beginning and 115.6 MB in the end (delta: 30.7 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109072.28 ms. Allocated memory was 219.2 MB in the beginning and 854.6 MB in the end (delta: 635.4 MB). Free memory was 115.6 MB in the beginning and 144.7 MB in the end (delta: -29.1 MB). Peak memory consumption was 775.5 MB. Max. memory is 7.1 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: (((((((((((((((((((((((s == IPC && status == lowerDriverReturn) && status == 0) && 0 == pended && NP + 5 <= MPR3) || !(\old(SKIP1) == \old(s))) || (((((status == lowerDriverReturn && s == SKIP2) && DC + 2 <= SKIP2) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(0 == \old(routine))) || (((status == lowerDriverReturn && s == SKIP2) && status == 0) && 0 == pended && NP + 5 <= MPR3)) || (((((s == IPC && status == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && !(status == 259)) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || ((NP + 2 <= SKIP1 && status + 1073741789 <= 0) && (DC + 5 <= IPC && (DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(myStatus) == 0)) || !(\old(SKIP2) == \old(s))) || (((((s == IPC && status == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && DC + 7 <= s) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1)) || (((((((((s == IPC && NP + 2 <= SKIP1) && status == lowerDriverReturn) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((NP + 2 <= SKIP1 && !(status == 259)) && MPR3 + 1 <= IPC) && (DC + 5 <= IPC && (DC + 2 <= SKIP2 && (0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(s) == \old(MPR1))) || (((((((s == IPC && NP + 2 <= SKIP1) && status == lowerDriverReturn) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((0 == pended && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(s) == \old(DC))) || !(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: 636]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((NP + 2 <= SKIP1 && (s == NP && 0 == pended) && NP + 5 <= MPR3) && status + 1073741670 <= 0)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((((s == NP && 0 == pended) && NP + 5 <= MPR3) && 0 == status) && myStatus == \old(myStatus))) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((NP + 2 <= SKIP1 && (s == NP && 0 == pended) && NP + 5 <= MPR3) && status + 1073741670 <= 0)) || !(\old(myStatus) == 0)) || ((((s == NP && 0 == pended) && NP + 5 <= MPR3) && myStatus == \old(myStatus)) && 0 == status)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 2074]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || (0 == pended && SKIP1 == s)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 2 <= SKIP2) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((NP + 2 <= SKIP1 && !(status == 259)) && ((DC + 5 <= IPC && s == DC && SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= IPC + SKIP1) && MPR3 + 1 <= IPC) || !(\old(SKIP1) == \old(s))) || !(0 == \old(routine))) || (((status == lowerDriverReturn && s == SKIP2) && status == 0) && NP + 5 <= MPR3 && 0 == pended)) || (((((status == lowerDriverReturn && s == SKIP2) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((((s == IPC && status == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && 0 == pended)) || (((((((s == IPC && NP + 2 <= SKIP1) && status == lowerDriverReturn) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) && NP + 5 <= MPR3 && 0 == pended)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((NP + 2 <= SKIP1 && status + 1073741789 <= 0) && ((DC + 5 <= IPC && s == DC && SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || s == UNLOADED) || !(\old(SKIP2) == \old(s))) || (((((((((s == IPC && NP + 2 <= SKIP1) && status == lowerDriverReturn) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((s == IPC && status == lowerDriverReturn) && status == 0) && NP + 5 <= MPR3 && 0 == pended)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((s == IPC && status == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && !(status == 259)) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && 0 == pended)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 1934]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || (0 == pended && SKIP1 == s)) && (((((!(SKIP2 + 3 <= IPC) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(myStatus == 0)) && (((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(0 <= myStatus + 1073741637))) || ((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && 0 <= __cil_tmp8 + 1073741802) && setEventCalled == 1)) || !(customIrp == 0))) && (((((((((((!(NP + 5 <= MPR3) || (s == \old(s) && NP + 5 <= MPR3)) || !(myStatus == 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered))) && ((((((((((((!(NP + 5 <= MPR3) || (s == \old(s) && NP + 5 <= MPR3)) || !(myStatus + 1073741637 <= 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || ((NP + 2 <= SKIP1 && (s == NP && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((NP + 2 <= SKIP1 && (s == NP && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(myStatus + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(MPR3 + 1 <= IPC)) && (((((((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(myStatus == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 2 <= SKIP2)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine))) || !(\old(s) == MPR3)) || (\old(customIrp) == customIrp && s == NP)) || !(\old(customIrp) == 0)) && (((((((!(\old(setEventCalled) == 1) || (((((((!(\old(s) + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(SKIP2 + 3 <= IPC)) || !(myStatus + 1073741637 <= 0)) || !(0 <= myStatus + 1073741637)) && (((!(\old(setEventCalled) == 1) || (((((((!(\old(s) + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(SKIP2 + 3 <= IPC)) || !(myStatus == 0))) || ((s == \old(s) && setEventCalled == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0))) && (((s == NP || !(SKIP2 + 3 <= IPC)) || !(myStatus == 0)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC))) && ((\old(customIrp) == customIrp || (((!(SKIP2 + 3 <= IPC) || !(myStatus == 0)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)) && (((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || !(0 <= myStatus + 1073741637)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)))) || !(\old(customIrp) == 0))) && ((((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || s == NP) || !(0 <= myStatus + 1073741637)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || (0 == pended && SKIP1 == s)) && (((((!(SKIP2 + 3 <= IPC) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(myStatus == 0)) && (((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(0 <= myStatus + 1073741637))) || ((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && 0 <= __cil_tmp8 + 1073741802) && setEventCalled == 1)) || !(customIrp == 0))) && (((((((((((!(NP + 5 <= MPR3) || (s == \old(s) && NP + 5 <= MPR3)) || !(myStatus == 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered))) && ((((((((((((!(NP + 5 <= MPR3) || (s == \old(s) && NP + 5 <= MPR3)) || !(myStatus + 1073741637 <= 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(compRegistered == 0)) || (0 == pended && SKIP1 == s)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 2 <= SKIP2) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (!(myStatus + 1073741637 <= 0) || ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(myStatus + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(myStatus == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)))) && ((((0 == pended && s == \old(s)) && 1 <= compRegistered) && routine == 1) || ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(myStatus + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(myStatus == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)))) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || ((((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || (0 == pended && SKIP1 == s)) && (((((!(SKIP2 + 3 <= IPC) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(myStatus == 0)) && (((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(0 <= myStatus + 1073741637))) || ((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && 0 <= __cil_tmp8 + 1073741802) && setEventCalled == 1)) || !(customIrp == 0))) && (((((((((((!(NP + 5 <= MPR3) || (s == \old(s) && NP + 5 <= MPR3)) || !(myStatus == 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered))) && ((((((((((((!(NP + 5 <= MPR3) || (s == \old(s) && NP + 5 <= MPR3)) || !(myStatus + 1073741637 <= 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(myStatus + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(MPR3 + 1 <= IPC)) && (((((((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(myStatus == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 2 <= SKIP2)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine))) || !(\old(s) == MPR3)) || (\old(customIrp) == customIrp && s == NP)) || !(\old(customIrp) == 0)) && (((((((!(\old(setEventCalled) == 1) || (((((((!(\old(s) + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(SKIP2 + 3 <= IPC)) || !(myStatus + 1073741637 <= 0)) || !(0 <= myStatus + 1073741637)) && (((!(\old(setEventCalled) == 1) || (((((((!(\old(s) + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(SKIP2 + 3 <= IPC)) || !(myStatus == 0))) || ((s == \old(s) && setEventCalled == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0))) && (((s == NP || !(SKIP2 + 3 <= IPC)) || !(myStatus == 0)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC))) && ((\old(customIrp) == customIrp || (((!(SKIP2 + 3 <= IPC) || !(myStatus == 0)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)) && (((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || !(0 <= myStatus + 1073741637)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)))) || !(\old(customIrp) == 0))) && ((((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || s == NP) || !(0 <= myStatus + 1073741637)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(myStatus + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(myStatus == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC))) || (myStatus == 0 && ((0 == pended && s == \old(s)) && 1 <= compRegistered) && routine == 1) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus))) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus))) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: ((status + 1073741670 <= 0 && s == NP && 0 == pended) || (0 == status && s == NP && 0 == pended)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || ((((((((((NP + 2 <= SKIP1 && myStatus == 0) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(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: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 1792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) || ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(myStatus + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(MPR3 + 1 <= IPC)) && (((((((!(\old(setEventCalled) == 1) || !(NP + 2 <= SKIP1)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(myStatus == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 2 <= SKIP2)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (((!(SKIP2 + 3 <= IPC) || !(myStatus == 0)) || s == \old(s)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC))) && ((((setEventCalled == 1 && s == \old(s)) && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || (((((((!(\old(s) + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(SKIP2 + 3 <= IPC)) || !(myStatus + 1073741637 <= 0)) || !(0 <= myStatus + 1073741637)) && (((!(\old(setEventCalled) == 1) || (((((((!(\old(s) + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(SKIP2 + 3 <= IPC)) || !(myStatus == 0)))) || !(\old(customIrp) == 0))) && ((((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || !(0 <= myStatus + 1073741637)) || s == \old(s)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC))) && ((\old(customIrp) == customIrp || (((!(SKIP2 + 3 <= IPC) || !(myStatus == 0)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)) && (((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || !(0 <= myStatus + 1073741637)) || (((((((!(NP + 2 <= SKIP1) || !(DC + 2 <= SKIP2)) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(SKIP1) == \old(s)) || (((DC + 2 <= SKIP2 && (((status == lowerDriverReturn && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) || ((NP + 5 <= MPR3 && SKIP1 + 2 <= MPR1) && s == DC))) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP2 <= s)) || !(0 == \old(routine))) || ((status == lowerDriverReturn && status == 0) && NP + 5 <= MPR3)) || (((NP + DC + 7 <= IPC + SKIP1 && DC + 7 <= s) && status == lowerDriverReturn && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1)) || (((NP + DC + 7 <= IPC + SKIP1 && !(status == 259)) && status == lowerDriverReturn && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((DC + 2 <= SKIP2 && (((status == lowerDriverReturn && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) || ((NP + 5 <= MPR3 && SKIP1 + 2 <= MPR1) && s == DC))) && SKIP2 + NP + 5 <= IPC + SKIP1) && !(status == 259))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || (0 == pended && SKIP1 == s)) && (((((!(SKIP2 + 3 <= IPC) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(myStatus == 0)) && (((!(SKIP2 + 3 <= IPC) || !(myStatus + 1073741637 <= 0)) || ((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(1 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(0 <= myStatus + 1073741637))) || ((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && 0 <= __cil_tmp8 + 1073741802) && setEventCalled == 1)) || !(customIrp == 0))) && (((((((((((!(NP + 5 <= MPR3) || (s == \old(s) && NP + 5 <= MPR3)) || !(myStatus == 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered))) && ((((((((((((!(NP + 5 <= MPR3) || (s == \old(s) && NP + 5 <= MPR3)) || !(myStatus + 1073741637 <= 0)) || !(\old(s) + 2 <= SKIP1)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((0 == pended && s == \old(s)) && myStatus == \old(myStatus))) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((0 == pended && s == \old(s)) && myStatus == \old(myStatus))) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || (!(status == 259) && NP + 2 <= SKIP1 && ((0 == pended && NP + 5 <= MPR3) && 0 == routine) && s == DC)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || ((((((s == IPC && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && status == lowerDriverReturn) && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || (((status == lowerDriverReturn && NP + 2 <= SKIP1) && ((s == IPC && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && 0 == routine) && MPR3 + 1 <= IPC)) || !(DC + 2 <= SKIP2)) || !(\old(s) == NP)) || !(SKIP2 + 3 <= IPC)) || ((((status <= lowerDriverReturn && SKIP2 + 3 <= IPC) && (((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && s == SKIP2) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && lowerDriverReturn <= status) && MPR3 + 1 <= IPC)) || !(0 == \old(pended))) && (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || (!(status == 259) && NP + 2 <= SKIP1 && ((0 == pended && NP + 5 <= MPR3) && 0 == routine) && s == DC)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || ((((((s == IPC && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && status == lowerDriverReturn) && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || (((status == lowerDriverReturn && NP + 2 <= SKIP1) && ((s == IPC && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && 0 == routine) && MPR3 + 1 <= IPC)) || !(DC + 2 <= SKIP2)) || !(\old(s) == NP)) || !(SKIP2 + 3 <= IPC)) || ((((status <= lowerDriverReturn && SKIP2 + 3 <= IPC) && (((((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && s == SKIP2) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && lowerDriverReturn <= status) && MPR3 + 1 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(0 == \old(pended))) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && s == \old(s)) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && s == \old(s)) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((0 == pended && 0 == compRegistered) && 0 == routine) && s == \old(s)) && myStatus + 1073741637 <= 0) && myStatus == \old(myStatus)) || ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((0 == pended && s == \old(s)) && !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42)) || ((0 == pended && s == \old(s)) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 2079]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(compRegistered == 0)) || (0 == pended && SKIP1 == s)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 2 <= SKIP2) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus == \old(myStatus)) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 <= myStatus + 1073741637) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: ((0 == pended && s == \old(s)) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || ((((s == NP && 0 == pended) && NP + 5 <= MPR3) && myStatus == \old(myStatus)) && status + 1073741670 <= 0)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || ((((s == NP && 0 == pended) && NP + 5 <= MPR3) && myStatus == \old(myStatus)) && status + 1073741670 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus))) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus))) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: (0 == pended && s == \old(s)) || ((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((((0 == pended && 0 == compRegistered) && 0 == routine) && s == \old(s)) && setPagable <= 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(\old(SKIP1) == \old(s)) || (((((s == IPC && status == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || (((((s == IPC && status == lowerDriverReturn) && NP + DC + 7 <= IPC + SKIP1) && !(status == 259)) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(0 == \old(routine))) || (((((status == lowerDriverReturn && s == SKIP2) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && s == DC) && status + 1073741789 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((status == lowerDriverReturn && s == SKIP2) && status == 0) && NP + 5 <= MPR3)) || (((((((s == IPC && NP + 2 <= SKIP1) && status == lowerDriverReturn) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || s == UNLOADED) || !(\old(SKIP2) == \old(s))) || (((s == IPC && status == lowerDriverReturn) && status == 0) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && s == DC) && !(status == 259)) && MPR3 + 1 <= IPC) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC))) || (\old(customIrp) == customIrp && myStatus == \old(myStatus) && ((0 == pended && s == NP) && 0 == compRegistered) && 0 == routine)) || !(\old(customIrp) == 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus))) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine) && myStatus == \old(myStatus))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((NP + 2 <= SKIP1 && 0 == pended) && s == \old(s)) && NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(DC + 2 <= SKIP2)) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && s == \old(s)) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) && ((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || !(DC + 2 <= SKIP2)) || ((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && s == \old(s)) && 0 == routine) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) - InvariantResult [Line: 2050]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || (0 == pended && SKIP1 == s)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(SKIP2 + NP + 5 <= SKIP1 + IPC) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 515 locations, 1 error locations. SAFE Result, 108.8s OverallTime, 81 OverallIterations, 2 TraceHistogramMax, 37.8s AutomataDifference, 0.0s DeadEndRemovalTime, 57.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45026 SDtfs, 26609 SDslu, 224507 SDs, 0 SdLazy, 32497 SolverSat, 5421 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1099 GetRequests, 316 SyntacticMatches, 4 SemanticMatches, 779 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=944occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 81 MinimizatonAttempts, 3693 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1679 PreInvPairs, 2015 NumberOfFragments, 24422 HoareAnnotationTreeSize, 1679 FomulaSimplifications, 1400389391 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 171 FomulaSimplificationsInter, 37553548 FormulaSimplificationTreeSizeReductionInter, 53.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 5217 NumberOfCodeBlocks, 5217 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 5135 ConstructedInterpolants, 0 QuantifiedInterpolants, 760702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 82 InterpolantComputations, 81 PerfectInterpolantSequences, 32/39 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...